Researchers have shown that boson sampling, a computational problem believed to be hard for classical computers, can be simulated with a logarithmic-depth qubit circuit. This advancement places boson sampling within the realm of shallow quantum computation, which has implications for understanding the limits and capabilities of quantum computers.

The proposed method allows for the simulation of an arbitrary m-mode interferometer with n single-photon inputs (where n ≤ m) with an inverse-polynomial total-variation error. The qubit circuit employs a polynomially many qubits and uses Clifford+T gates, allowing for arbitrary qubit connectivity and a single final measurement. The family of these circuits is logspace uniform, indicating an efficient construction.

The key to this simulation lies in enlarging the original optical system and decomposing the resulting transformation into six quadratic shears. Each optical mode is then distributed over many submodes, which permits a fixed local occupation cutoff. From there, local basis changes and parallel phase gates are applied to construct the qubit circuit. This innovative approach allows the complexity of boson sampling to be tackled with a relatively simple quantum circuit architecture.