aiqbench analysis
This research establishes robust exponential lower bounds for the Gaussian rank in both bosonic and fermionic quantum systems, proving that non-Gaussianity inherently leads to high decomposition complexity. These findings define fundamental limits on classical simulation strategies based on coherent decomposition, thereby clarifying the scope of quantum computational advantages in continuous-variable settings. The results advance theoretical understanding without relying on energy constraints for bosonic states, offering new mathematical tools for analyzing simulation hardness.
Robust exponential lower bounds for fermionic and bosonic Gaussian ranks
arXiv:2610.02172v1 Announce Type: new Abstract: The power and limitations of classical simulation are central to understanding quantum computational advantages. A leading simulation paradigm is based on coherent decomposition into classically tractable free states where the decomposition rank determines the simulation complexity. Proving strong lower bounds on this number is a notoriously difficult and mathematically rich problem, as exemplified by the qubit stabilizer rank problem. Here, we study the Gaussian version of this problem in both bosonic and fermionic systems and establish robust exponential lower bounds on Gaussian rank. In particular, we prove that for every pure non-Gaussian state on finitely many modes, with definite parity in the fermionic case, the approximate border Gaussian rank of its tensor powers grows at least exponentially at any fixed norm error below one. Our proofs combine reduction to four modes with Majorana spectral bounds for fermions, and Gaussian postselection with an entropy-based rank bound for bosons. As concrete examples, we derive explicit exponential lower bounds for the four-mode fermionic GHZ state and the bosonic single-photon state. The bosonic results require no assumption on the energy of the target state. Our results show that non-Gaussianity universally entails exponential Gaussian decomposition complexity, setting fundamental limitations on decomposition-based classical simulation of bosonic and fermionic systems.
Abstract:The power and limitations of classical simulation are central to understanding quantum computational advantages. A leading simulation paradigm is based on coherent decomposition into classically tractable free states where the decomposition rank determines the simulation complexity. Proving strong lower bounds on this number is a notoriously difficult and mathematically rich problem, as exemplified by the qubit stabilizer rank problem. Here, we study the Gaussian version of this problem in both bosonic and fermionic systems and establish robust exponential lower bounds on Gaussian rank. In particular, we prove that for every pure non-Gaussian state on finitely many modes, with definite parity in the fermionic case, the approximate border Gaussian rank of its tensor powers grows at least exponentially at any fixed norm error below one. Our proofs combine reduction to four modes with Majorana spectral bounds for fermions, and Gaussian postselection with an entropy-based rank bound for bosons. As concrete examples, we derive explicit exponential lower bounds for the four-mode fermionic GHZ state and the bosonic single-photon state. The bosonic results require no assumption on the energy of the target state. Our results show that non-Gaussianity universally entails exponential Gaussian decomposition complexity, setting fundamental limitations on decomposition-based classical simulation of bosonic and fermionic systems.
arXiv:2610.02172 [quant-ph]
(or arXiv:2610.02172v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2610.02172 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 294 words
Related coverage
Researchers Bound Quantum System Complexity Using Exponentials
Quantum Zeitgeist · Oct 2, 2026
Exponential lower bounds on the fermionic Gaussian rank of magic states and the bosonic coherent state rank of Fock states
arXiv · Oct 5, 2026
A brief history of quantum vs classical computational advantage
Quantum Journal · Sep 1, 2026
Researchers Decode up to 1,023 Qubits Using Rank Decomposition
Quantum Zeitgeist · Oct 3, 2026