Efficient sampling from shallow Gaussian quantum-optical circuits with local interactions

TL;DR

This paper demonstrates that shallow, local Gaussian optical circuits can be efficiently simulated classically, challenging the prospects of quantum supremacy in photonic systems with such architectures.

Contribution

It extends classical simulation techniques for Gaussian states to shallow, local circuits in the continuous-variable domain, using small bandwidth adjacency matrices.

Findings

Classical algorithms efficiently sample from shallow Gaussian circuits.

Shallow local circuits have small bandwidth adjacency matrices.

Results challenge quantum supremacy claims in photonic platforms.

Abstract

We prove that a classical computer can efficiently sample from the photon-number probability distribution of a Gaussian state prepared by using an optical circuit that is shallow and local. Our work generalizes previous known results for qubits to the continuous-variable domain. The key to our proof is the observation that the adjacency matrices characterizing the Gaussian states generated by shallow and local circuits have small bandwidth. To exploit this structure, we devise fast algorithms to calculate loop hafnians of banded matrices. Since sampling from deep optical circuits with exponential-scaling photon loss is classically simulable, our results pose a challenge to the feasibility of demonstrating quantum supremacy on photonic platforms with local interactions.