analiza aiqbench
This research demonstrates that boson sampling, a key benchmark for quantum supremacy, can be efficiently simulated on qubit circuits with logarithmic depth using Clifford+$T$ gates and arbitrary connectivity. By decomposing optical transformations into quadratic shears and redistributing modes, the study places this specific photonic task firmly within the realm of shallow quantum computation. The result provides significant theoretical insight into the boundaries between photonic and digital quantum architectures, informing future strategies for verifying quantum advantage claims.
Logarithmic-depth quantum simulation of boson sampling
arXiv:2609.18907v1 Announce Type: new Abstract: We show that boson sampling with an arbitrary $m$-mode interferometer and $n\le m$ single-photon inputs can be simulated to inverse-polynomial total-variation error by a logarithmic-depth qubit circuit with polynomially many qubits. The circuit uses Clifford+$T$ gates, arbitrary qubit connectivity, and a single final measurement, and its family is logspace uniform. The key idea is to enlarge the optical system, decompose the resulting transformation into six quadratic shears, and distribute each mode over many submodes. This redistribution permits a fixed local occupation cutoff, after which local basis changes and parallel phase gates give the qubit circuit. Consequently, our result places boson sampling within shallow quantum computation.
Abstract:We show that boson sampling with an arbitrary $m$-mode interferometer and $n\le m$ single-photon inputs can be simulated to inverse-polynomial total-variation error by a logarithmic-depth qubit circuit with polynomially many qubits. The circuit uses Clifford+$T$ gates, arbitrary qubit connectivity, and a single final measurement, and its family is logspace uniform. The key idea is to enlarge the optical system, decompose the resulting transformation into six quadratic shears, and distribute each mode over many submodes. This redistribution permits a fixed local occupation cutoff, after which local basis changes and parallel phase gates give the qubit circuit. Consequently, our result places boson sampling within shallow quantum computation.
arXiv:2609.18907 [quant-ph]
(or arXiv:2609.18907v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2609.18907 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.
Text integral sub licența deschisă a publicației · 196 cuvinte
Subiecte conexe

A brief history of quantum vs classical computational advantage
Quantum Journal · 1 sept. 2026

New study probes entanglement in noisy quantum processors
Quantum Zeitgeist · 6 aug. 2026

Quantum algorithm prepares initial states with perfect symmetry
Quantum Zeitgeist · 1 sept. 2026

Researchers Bound Spin Chain Mixing Time with Logarithmic Scaling
Quantum Zeitgeist · 4 oct. 2026