DOE PAGES title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Classical Simulation of Boson Sampling Based on Graph Structure

Journal Article · · Physical Review Letters

Boson sampling is a fundamentally and practically important task that can be used to demonstrate quantum supremacy using noisy intermediate-scale quantum devices. In this Letter, we present classical sampling algorithms for single-photon and Gaussian input states that take advantage of a graph structure of a linear-optical circuit. The algorithms’ complexity grows as so-called treewidth, which is closely related to the connectivity of a given linear-optical circuit. Using the algorithms, we study approximated simulations for local Haar-random linear-optical circuits. For equally spaced initial sources, we show that, when the circuit depth is less than the quadratic in the lattice spacing, the efficient simulation is possible with an exponentially small error. Notably, right after this depth, photons start to interfere each other and the algorithms’ complexity becomes subexponential in the number of sources, implying that there is a sharp transition of its complexity. Finally, when a circuit is sufficiently deep enough for photons to typically propagate to all modes, the complexity becomes exponential as generic sampling algorithms. We numerically implement a likelihood test with a recent Gaussian boson sampling experiment and show that the treewidth-based algorithm with a limited treewidth renders a larger likelihood than the experimental data.

Research Organization:
Yale Univ., New Haven, CT (United States)
Sponsoring Organization:
USDOE Office of Science (SC); National Science Foundation (NSF); US Army Research Office (ARO); US Air Force Office of Scientific Research (AFOSR); National Research Foundation of Korea (NRF); Packard Foundation
Grant/Contract Number:
SC0019406
OSTI ID:
1980281
Journal Information:
Physical Review Letters, Journal Name: Physical Review Letters Journal Issue: 19 Vol. 128; ISSN 0031-9007
Publisher:
American Physical Society (APS)Copyright Statement
Country of Publication:
United States
Language:
English

References (43)

Combinatorics and Complexity of Partition Functions book January 2016
Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices journal February 2009
An efficient tree decomposition method for permanents and mixed discriminants journal March 2016
Quantum information with Gaussian states journal August 2007
Experimental Gaussian Boson sampling journal April 2019
Entanglement formation in continuous-variable random quantum networks journal February 2021
Characterizing quantum supremacy in near-term devices journal April 2018
Quantum supremacy using a programmable superconducting processor journal October 2019
Direct dialling of Haar random unitary matrices journal March 2017
Classical simulation of photonic linear optics with lost particles journal September 2018
A limit formula for the quantum fidelity journal December 2012
Classically simulating near-term partially-distinguishable and lossy boson sampling journal November 2019
Combinatorial Optimization on Graphs of Bounded Treewidth journal November 2007
Symmetric Gauge Functions and Unitarily Invariant Norms journal January 1960
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
  • Bremner, Michael J.; Jozsa, Richard; Shepherd, Dan J.
  • Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, Vol. 467, Issue 2126 https://doi.org/10.1098/rspa.2010.0301
journal July 2010
Quadratic Speed-Up for Simulating Gaussian Boson Sampling journal January 2022
Detailed study of Gaussian boson sampling journal September 2019
Classical simulation of lossy boson sampling using matrix product operators journal August 2021
Convergence conditions for random quantum circuits journal December 2005
Complexity of simulating constant-depth BosonSampling journal April 2015
BosonSampling is robust against small errors in the network matrix journal December 2015
BosonSampling with lost photons journal January 2016
Quantum Fidelity for Arbitrary Gaussian States journal December 2015
Gaussian Boson Sampling journal October 2017
Dynamical Phase Transitions in Sampling Complexity journal July 2018
Regimes of Classical Simulability for Noisy Gaussian Boson Sampling journal March 2020
Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light journal October 2021
Exact simulation of Gaussian boson sampling in polynomial space and exponential time journal April 2020
Gaussian quantum information journal May 2012
Cryptographic distinguishability measures for quantum-mechanical states journal May 1999
Quantum computational advantage via high-dimensional Gaussian boson sampling journal January 2022
The boundary for quantum advantage in Gaussian boson sampling journal January 2022
Quantum computational advantage using photons journal December 2020
Simulating Quantum Computation by Contracting Tensor Networks journal January 2008
Complexity of Finding Embeddings in a k -Tree journal April 1987
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth journal December 1996
Continuous Variable Quantum Information: Gaussian States and Beyond journal March 2014
A Faster Hafnian Formula for Complex Matrices and Its Benchmarking on a Supercomputer journal June 2019
Quantum Continuous Variables: A Primer of Theoretical Methods book October 2017
Two Algorithmic Results for the Traveling Salesman Problem journal February 1996
The Walrus: a library for the calculation of hafnians, Hermite polynomials and Gaussian boson sampling journal December 2019
Quantum Computing in the NISQ era and beyond journal August 2018
Simulating boson sampling in lossy architectures journal August 2019