Researchers Classify Quantum Data Using Polynomial Measurements

A new framework classifies quantum states by linking learning efficiency to data structure instead of task-specific physics, and it has been implemented using a programmable photonic processor. An analysis guarantees accurate classifications when the number of measurements scales favourably with system size, a polynomial relationship, and they applied this to continuous-variable (CV) quantum computing. The experimental setup surpasses existing platforms by processing both Gaussian and non-Gaussian states despite imperfections in current hardware.

The team created a technique using machine learning to categorise complex quantum states; key reductions in the number of measurements needed were achieved compared to previous approaches. Experiments demonstrate its effectiveness through use of an advanced photonics processor capable of handling standard Gaussian and intricate non-Gaussian types of quantum data. Researchers from The University of Tokyo developed a new technique using machine learning to categorise complex quantum states, achieving key reductions in the number of measurements needed compared to previous approaches.

Learning efficiency is now directly linked to underlying data structure rather than specific physics governing these states. Analysing a quantum state resembles taking a detailed photograph describing all its properties; the team measures how different each “snapshot” is from simple, well-behaved Gaussian states, this difference being termed stellar rank, essentially measuring complexity.

This work utilises a continuous-variable photonic processor which processes information with light particles in an analogue way similar to playing music on vinyl versus digital files. Accurate classification was demonstrated despite imperfections in current hardware and researchers now ask: could this framework unlock more efficient analysis for even more complex quantum systems?

Polynomial scaling unlocks efficient classification of non-Gaussian quantum states

Measurement costs have been reduced from exponential scaling, typical of full quantum state reconstruction, to polynomial scaling, a strong improvement that enables analysis of larger systems. At The University of Tokyo, scientists accurately classified continuous-variable (CV) quantum states with stellar rank zero and one using their new technique; they previously found this impossible due to limitations in existing photonic platforms largely focused on Gaussian states only. This achievement came through an experimentally validated framework linking learning efficiency directly to inherent data structure rather than task-specific physics, bypassing the need for detailed physical descriptions.

A programmable CV photonic processor not only prepares diverse types of quantum states but also performs virtual projections, surpassing current hardware capabilities while maintaining accuracy despite real-world imperfections. Sufficient conditions for accurate classification were proven when applied to identifying these non-Gaussian resources, scaling polynomially with system size, though whether this framework will scale effectively enough to tackle sharply more complex or high dimensional systems remains unproven. The team successfully classified continuous variable quantum states by assessing their deviation from standard ‘Gaussian’ behaviour using fewer measurements than traditional methods require.

Reduced measurement techniques classify non-classical light with polynomial scaling

This new framework demonstrably reduces the demands for classifying quantum information, moving from exponential scaling typical in full state reconstruction to a manageable polynomial relationship; however, its current success is limited. Scientists accurately distinguished between continuous-variable quantum states possessing ‘stellar rank’ zero or one, measuring how far removed they were from simple Gaussian behaviour, extending these findings still presents an open question. Despite not yet demonstrating broad applicability across all quantum states, this work represents a strong step forward: reducing resources needed for quantum analysis is vital as systems grow more complex. The team established a framework linking learning efficiency directly to inherent properties within the data itself, bypassing reliance on task-specific physical descriptions that often limit analysis. Experimentally validating their approach using continuous-variable quantum computing, manipulating light rather than matter, researchers successfully distinguished between well-behaved Gaussian states and more complex non-Gaussian ones via ‘stellar rank’.

Researchers developed a new method for classifying quantum states that requires a number of measurements which scales polynomially with system size, an improvement over traditional methods requiring exponentially increasing measurements. The framework links the efficiency of learning to properties within the quantum data itself, allowing classification without needing specific details about each task. These results establish an efficient, theory-guided scheme for quantum-state classification validated on current quantum devices.

👉 More information
🗞 Provably efficient experimental classification of quantum data with quantum kernels
✍️ Keitaro Anai, Shintaro Ooka, Hiroko Tomoda, Yohji Chin and Shuntaro Takeda (The University of Tokyo); Akimoto Nakayama, Yuto Morohoshi and Kosuke Mitarai (The University of Osaka); Shigehito Miki, Masahiro Yabuno and Hirotaka Terai (Affiliation: Advanced ICT Research Institute); Peter van Loock (Johannes-Gutenberg University of Mainz)
🧠 ArXiv: https://arxiv.org/abs/2610.39350

Stay current

See today’s quantum computing news on Quantum Zeitgeist for the latest breakthroughs in qubits, hardware, algorithms, and industry deals.

Avatar of Ivy Delaney

Ivy Delaney

Ivy Delaney has been working with neural networks and machine learning since the mid-nineties, back when a couple of hidden layers and a long afternoon of training counted as ambitious. She has watched the field go from academic curiosity to the thing quietly running underneath everything, and she brings that long view to quantum computing. For Quantum Zeitgeist she covers the ground where the two fields meet. That means quantum machine learning and the variational algorithms it leans on, and it also means the less glamorous but more interesting story of classical machine learning already doing real work inside quantum machines, decoding error-correcting codes, calibrating noisy hardware and learning the error models that simulators depend on. She writes about the hardware those algorithms have to run on too, and about the post-quantum cryptography scramble that the same hardware has set off. Her stories typically start with the paper, whether that is peer-reviewed work, conference proceedings or an arXiv preprint, with the source linked so you can hold a claim up against the research it came from. She is unimpressed by benchmarks that will not say what they beat, and by demonstrations that only work in the press release.

Latest Posts by Ivy Delaney: