Classical Simulation of Boson Sampling Based on Graph Structure
Abstract
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.
- Authors:
-
- Univ. of Chicago, IL (United States)
- Korea Institute of Advanced Study, Seoul (South Korea)
- Publication Date:
- Research Org.:
- Yale Univ., New Haven, CT (United States)
- Sponsoring Org.:
- 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
- OSTI Identifier:
- 1980281
- Grant/Contract Number:
- SC0019406; W911NF-15-2-0067; W911NF-18-1-0020; W911NF-18-1-0212; 911NF-16-1-0349; A9550-15-1-0015; FA9550-19-1-0399; EFMA-1640959; OMA-1936118; 2013-39273; 2020M3E4A1077861; FA9550-18-1-0148; FA9550-21-1-0008; CCF-2044923
- Resource Type:
- Accepted Manuscript
- Journal Name:
- Physical Review Letters
- Additional Journal Information:
- Journal Volume: 128; Journal Issue: 19; Journal ID: ISSN 0031-9007
- Publisher:
- American Physical Society (APS)
- Country of Publication:
- United States
- Language:
- English
- Subject:
- 72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS; Physics; boson sampling
Citation Formats
Oh, Changhun, Lim, Youngrong, Fefferman, Bill, and Jiang, Liang. Classical Simulation of Boson Sampling Based on Graph Structure. United States: N. p., 2022.
Web. doi:10.1103/physrevlett.128.190501.
Oh, Changhun, Lim, Youngrong, Fefferman, Bill, & Jiang, Liang. Classical Simulation of Boson Sampling Based on Graph Structure. United States. https://doi.org/10.1103/physrevlett.128.190501
Oh, Changhun, Lim, Youngrong, Fefferman, Bill, and Jiang, Liang. Fri .
"Classical Simulation of Boson Sampling Based on Graph Structure". United States. https://doi.org/10.1103/physrevlett.128.190501. https://www.osti.gov/servlets/purl/1980281.
@article{osti_1980281,
title = {Classical Simulation of Boson Sampling Based on Graph Structure},
author = {Oh, Changhun and Lim, Youngrong and Fefferman, Bill and Jiang, Liang},
abstractNote = {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.},
doi = {10.1103/physrevlett.128.190501},
journal = {Physical Review Letters},
number = 19,
volume = 128,
place = {United States},
year = {Fri May 13 00:00:00 EDT 2022},
month = {Fri May 13 00:00:00 EDT 2022}
}
Works referenced in this record:
Detailed study of Gaussian boson sampling
journal, September 2019
- Kruse, Regina; Hamilton, Craig S.; Sansoni, Linda
- Physical Review A, Vol. 100, Issue 3
Quantum computational advantage using photons
journal, December 2020
- Zhong, Han-Sen; Wang, Hui; Deng, Yu-Hao
- Science, Vol. 370, Issue 6523
The boundary for quantum advantage in Gaussian boson sampling
journal, January 2022
- Bulmer, Jacob F. F.; Bell, Bryn A.; Chadwick, Rachel S.
- Science Advances, Vol. 8, Issue 4
Regimes of Classical Simulability for Noisy Gaussian Boson Sampling
journal, March 2020
- Qi, Haoyu; Brod, Daniel J.; Quesada, Nicolás
- Physical Review Letters, Vol. 124, Issue 10
Gaussian quantum information
journal, May 2012
- Weedbrook, Christian; Pirandola, Stefano; García-Patrón, Raúl
- Reviews of Modern Physics, Vol. 84, Issue 2
Convergence conditions for random quantum circuits
journal, December 2005
- Emerson, Joseph; Livine, Etera; Lloyd, Seth
- Physical Review A, Vol. 72, Issue 6
Characterizing quantum supremacy in near-term devices
journal, April 2018
- Boixo, Sergio; Isakov, Sergei V.; Smelyanskiy, Vadim N.
- Nature Physics, Vol. 14, Issue 6
Classical simulation of photonic linear optics with lost particles
journal, September 2018
- Oszmaniec, Michał; Brod, Daniel J.
- New Journal of Physics, Vol. 20, Issue 9
Simulating Quantum Computation by Contracting Tensor Networks
journal, January 2008
- Markov, Igor L.; Shi, Yaoyun
- SIAM Journal on Computing, Vol. 38, Issue 3
The Walrus: a library for the calculation of hafnians, Hermite polynomials and Gaussian boson sampling
journal, December 2019
- Gupt, Brajesh; Izaac, Josh; Quesada, Nicolás
- Journal of Open Source Software, Vol. 4, Issue 44
Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
journal, October 2021
- Zhong, Han-Sen; Deng, Yu-Hao; Qin, Jian
- Physical Review Letters, Vol. 127, Issue 18
A Faster Hafnian Formula for Complex Matrices and Its Benchmarking on a Supercomputer
journal, June 2019
- Björklund, Andreas; Gupt, Brajesh; Quesada, Nicolás
- ACM Journal of Experimental Algorithmics, Vol. 24
Experimental Gaussian Boson sampling
journal, April 2019
- Zhong, Han-Sen; Peng, Li-Chao; Li, Yuan
- Science Bulletin, Vol. 64, Issue 8
A limit formula for the quantum fidelity
journal, December 2012
- Spedalieri, Gaetana; Weedbrook, Christian; Pirandola, Stefano
- Journal of Physics A: Mathematical and Theoretical, Vol. 46, Issue 2
Classical simulation of lossy boson sampling using matrix product operators
journal, August 2021
- Oh, Changhun; Noh, Kyungjoo; Fefferman, Bill
- Physical Review A, Vol. 104, Issue 2
Cryptographic distinguishability measures for quantum-mechanical states
journal, May 1999
- Fuchs, C. A.; van de Graaf, J.
- IEEE Transactions on Information Theory, Vol. 45, Issue 4
Quantum Continuous Variables: A Primer of Theoretical Methods
book, October 2017
- Serafini, Alessio
- CRC Press
Complexity of Finding Embeddings in a k -Tree
journal, April 1987
- Arnborg, Stefan; Corneil, Derek G.; Proskurowski, Andrzej
- SIAM Journal on Algebraic Discrete Methods, Vol. 8, Issue 2
Quantum information with Gaussian states
journal, August 2007
- Wang, X.; Hiroshima, T.; Tomita, A.
- Physics Reports, Vol. 448, Issue 1-4
Continuous Variable Quantum Information: Gaussian States and Beyond
journal, March 2014
- Adesso, Gerardo; Ragy, Sammy; Lee, Antony R.
- Open Systems & Information Dynamics, Vol. 21, Issue 01n02
Quantum supremacy using a programmable superconducting processor
journal, October 2019
- Arute, Frank; Arya, Kunal; Babbush, Ryan
- Nature, Vol. 574, Issue 7779
Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices
journal, February 2009
- Schwartz, Moshe
- Linear Algebra and its Applications, Vol. 430, Issue 4
Quadratic Speed-Up for Simulating Gaussian Boson Sampling
journal, January 2022
- Quesada, Nicolás; Chadwick, Rachel S.; Bell, Bryn A.
- PRX Quantum, Vol. 3, Issue 1
Combinatorial Optimization on Graphs of Bounded Treewidth
journal, November 2007
- Bodlaender, H. L.; Koster, A. M. C. A.
- The Computer Journal, Vol. 51, Issue 3
Quantum computational advantage via high-dimensional Gaussian boson sampling
journal, January 2022
- Deshpande, Abhinav; Mehta, Arthur; Vincent, Trevor
- Science Advances, Vol. 8, Issue 1
Two Algorithmic Results for the Traveling Salesman Problem
journal, February 1996
- Barvinok, Alexander I.
- Mathematics of Operations Research, Vol. 21, Issue 1
Quantum Fidelity for Arbitrary Gaussian States
journal, December 2015
- Banchi, Leonardo; Braunstein, Samuel L.; Pirandola, Stefano
- Physical Review Letters, Vol. 115, Issue 26
Gaussian Boson Sampling
journal, October 2017
- Hamilton, Craig S.; Kruse, Regina; Sansoni, Linda
- Physical Review Letters, Vol. 119, Issue 17
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
journal, December 1996
- Bodlaender, Hans L.
- SIAM Journal on Computing, Vol. 25, Issue 6
Dynamical Phase Transitions in Sampling Complexity
journal, July 2018
- Deshpande, Abhinav; Fefferman, Bill; Tran, Minh C.
- Physical Review Letters, Vol. 121, Issue 3
Entanglement formation in continuous-variable random quantum networks
journal, February 2021
- Zhang, Bingzhi; Zhuang, Quntao
- npj Quantum Information, Vol. 7, Issue 1
Exact simulation of Gaussian boson sampling in polynomial space and exponential time
journal, April 2020
- Quesada, Nicolás; Arrazola, Juan Miguel
- Physical Review Research, Vol. 2, Issue 2
BosonSampling with lost photons
journal, January 2016
- Aaronson, Scott; Brod, Daniel J.
- Physical Review A, Vol. 93, Issue 1
Direct dialling of Haar random unitary matrices
journal, March 2017
- Russell, Nicholas J.; Chakhmakhchyan, Levon; O’Brien, Jeremy L.
- New Journal of Physics, Vol. 19, Issue 3
Complexity of simulating constant-depth BosonSampling
journal, April 2015
- Brod, Daniel J.
- Physical Review A, Vol. 91, Issue 4
BosonSampling is robust against small errors in the network matrix
journal, December 2015
- Arkhipov, Alex
- Physical Review A, Vol. 92, Issue 6
Simulating boson sampling in lossy architectures
journal, August 2019
- García-Patrón, Raúl; Renema, Jelmer J.; Shchesnovich, Valery
- Quantum, Vol. 3
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
journal, July 2010
- Bremner, Michael J.; Jozsa, Richard; Shepherd, Dan J.
- Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, Vol. 467, Issue 2126
Classically simulating near-term partially-distinguishable and lossy boson sampling
journal, November 2019
- Moylett, Alexandra E.; García-Patrón, Raúl; Renema, Jelmer J.
- Quantum Science and Technology, Vol. 5, Issue 1
An efficient tree decomposition method for permanents and mixed discriminants
journal, March 2016
- Cifuentes, Diego; Parrilo, Pablo A.
- Linear Algebra and its Applications, Vol. 493
Symmetric Gauge Functions and Unitarily Invariant Norms
journal, January 1960
- Mirsky, L.
- The Quarterly Journal of Mathematics, Vol. 11, Issue 1