Curator's Take
AI Commentary
This article shows that the notoriously hard‑to‑simulate boson‑sampling problem can be reproduced by a logarithmic‑depth qubit circuit built from standard Clifford + T gates, meaning the task sits inside shallow quantum computation rather than requiring deep, fault‑tolerant architectures. By expanding the optical network into six quadratic shears and spreading each mode over many submodes, the authors achieve a fixed local occupation cutoff that enables parallel phase operations and a single final measurement—an approach that dovetails with recent pushes for low‑depth algorithms on near‑term devices. The result suggests boson sampling may be experimentally accessible sooner than expected, though it still demands polynomially many qubits and careful error control to reach the inverse‑polynomial total‑variation accuracy claimed.
— Mark Eatherly
Summary
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.