aiqbench analysis
This research introduces coherent matrix phase-space distributions that leverage conservation laws to significantly enhance the accuracy and speed of validating Gaussian boson sampling experiments. By achieving at worst quadratic scaling, this method overcomes the exponential hardness of classical simulation required for proving quantum computational advantage in low-loss networks. The approach offers a crucial numerical efficiency boost essential for benchmarking large-scale photonic quantum processors against classical limits.
Matrix phase-space representations for gaussian boson sampling
arXiv:2503.12749v2 Announce Type: replace Abstract: We introduce coherent matrix phase-space distributions. These use conservation laws and symmetries to improve the accuracy and speed of quantum phase-space representations. As an example, this is applied to validation of low-loss Gaussian boson sampling (GBS) quantum computational advantage experiments, where classical generation of the random photon-number counts is exponentially hard. Large improvements in sampling errors are demonstrated compared to previous methods. Matrix phase-space representations also provide a large numerical speed-up, due to their (at worst) quadratic scaling, compared to other methods for validating total count probabilities of large-scale, low-loss GBS networks.
Abstract:We introduce coherent matrix phase-space distributions. These use conservation laws and symmetries to improve the accuracy and speed of quantum phase-space representations. As an example, this is applied to validation of low-loss Gaussian boson sampling (GBS) quantum computational advantage experiments, where classical generation of the random photon-number counts is exponentially hard. Large improvements in sampling errors are demonstrated compared to previous methods. Matrix phase-space representations also provide a large numerical speed-up, due to their (at worst) quadratic scaling, compared to other methods for validating total count probabilities of large-scale, low-loss GBS networks.
Quantum Physics (quant-ph); Mathematical Physics (math-ph); Computational Physics (physics.comp-ph)
arXiv:2503.12749 [quant-ph]
(or arXiv:2503.12749v2 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2503.12749 Focus to learn more arXiv-issued DOI via DataCite
Phys. Rev. Lett. 136, 013601, 2026
https://doi.org/10.1103/htk1-rn8v Focus to learn more DOI(s) linking to related resources
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 · 206 words
Related coverage
Matrix phase-space representations for quantum symmetries
arXiv · Jun 12, 2026

Flow-Based Modeling Reconstructs Quantum States From Fewer Measurements
Quantum Zeitgeist · Jul 31, 2026

A brief history of quantum vs classical computational advantage
Quantum Journal · Sep 1, 2026
Flow-based Phase-space Tomography of Continuous-variable Quantum States
arXiv · Jul 24, 2026