aiqbench analysis
This research introduces "matrix phase-space" representations as a rigorous method to incorporate global quantum symmetries, significantly reducing sampling errors in many-body simulations and Gaussian boson sampling verification. By unifying previous approaches through detailed operator identities, the work offers a theoretical framework that enhances the efficiency of verifying outputs from emerging photonic quantum computers using photon number resolving detectors.
Matrix phase-space representations for quantum symmetries
arXiv:2606.12769v1 Announce Type: new Abstract: We introduce a general phase-space representation that includes global quantum symmetries in the basis expansion. This method, called matrix phase-space, projects the basis onto a reduced Hilbert space, which can greatly reduce sampling errors of many-body quantum simulations and unifies several previous phase-space methods. The purpose of this paper is to provide detailed proofs of basic theorems and operator identities. We also treat several different types of symmetries. To illustrate the benefits of matrix phase-space methods, we give a detailed derivation of a recent application to the topical problem of verifying the outputs of Gaussian boson sampling (GBS) quantum computers with photon number resolving detectors. This has exponential complexity, and using parity symmetry reduces sampling errors by very large factors relative to earlier methods.
Abstract:We introduce a general phase-space representation that includes global quantum symmetries in the basis expansion. This method, called matrix phase-space, projects the basis onto a reduced Hilbert space, which can greatly reduce sampling errors of many-body quantum simulations and unifies several previous phase-space methods. The purpose of this paper is to provide detailed proofs of basic theorems and operator identities. We also treat several different types of symmetries. To illustrate the benefits of matrix phase-space methods, we give a detailed derivation of a recent application to the topical problem of verifying the outputs of Gaussian boson sampling (GBS) quantum computers with photon number resolving detectors. This has exponential complexity, and using parity symmetry reduces sampling errors by very large factors relative to earlier methods.
arXiv:2606.12769 [quant-ph]
(or arXiv:2606.12769v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2606.12769 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 · 215 words
Related coverage

Symmetry-enriched topological order in tensor networks: Defects, gauging and anyon condensation
Quantum Journal · Sep 1, 2026

Utrecht University Cuts Simulation Times with New Symmetry Tool
Quantum Zeitgeist · Sep 10, 2026
Matrix phase-space representations for gaussian boson sampling
arXiv · Jun 12, 2026

Quantifying mixed-state entanglement via partial transpose and realignment moments
Quantum Journal · Aug 19, 2026