Logarithmic-depth quantum simulation of boson sampling
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...
Description / Details
We show that boson sampling with an arbitrary -mode interferometer and 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+ 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.
Source: arXiv:2609.18907v1 - http://arxiv.org/abs/2609.18907v1 PDF: https://arxiv.org/pdf/2609.18907v1 Original Link: http://arxiv.org/abs/2609.18907v1
Please sign in to join the discussion.
No comments yet. Be the first to share your thoughts!
Sep 17, 2026
Quantum Computing
Quantum Physics
0