Simulating lossy Gaussian boson sampling with matrix product operators

Abstract

Gaussian boson sampling, a computational model that is widely believed to admit quantum supremacy, has already been experimentally demonstrated and is claimed to surpass the classical simulation capabilities of even the most powerful supercomputers today. However, whether the current approach limited by photon loss and noise in such experiments prescribes a scalable path to quantum advantage is an open question. To understand the effect of photon loss on the scalability of Gaussian boson sampling, we analytically derive the asymptotic operator entanglement entropy scaling, which relates to the simulation complexity. As a result, we observe that efficient tensor network simulations are likely possible under the $N_{\text{out}}\propto \sqrt{N}$ scaling of the number of surviving photons orange$N_{\text{out}}$ in the number of input photons $N$. We numerically verify this result using a tensor network algorithm with $U(1)$ symmetry, and overcome previous challenges due to the large local Hilbert space dimensions in Gaussian boson sampling with hardware acceleration. Additionally, we observe that increasing the photon number through larger squeezing does not increase the entanglement entropy significantly. Finally, we numerically find the bond dimension necessary for fixed accuracy simulations, providing more direct evidence for the complexity of tensor networks.

arXiv comment16 pages, 11 figures. To appear in PRA. This article supersedes arXiv:2303.11409

References in corpus (53)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum algorithm for solving linear systems of equations
• Quantum computational advantage using photons
• Universal Linear Optics
• Boson Sampling on a Photonic Chip
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Experimental Boson Sampling
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Experimental boson sampling in arbitrary integrated photonic circuits
• Photonic Boson Sampling in a Tunable Circuit
• Exploring Topological Phases With Quantum Walks
• Boson sampling with 20 input photons in 60-mode interferometers at $10^{14}$ state spaces
• Gaussian Boson Sampling
• Universal computation by multi-particle quantum walk
• Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
• A 2D Quantum Walk Simulation of Two-Particle Dynamics
• On the relationship between continuous- and discrete-time quantum walk
• 12-photon entanglement and scalable scattershot boson sampling with optimal entangled-photon pairs from parametric down-conversion
• Efficient experimental validation of photonic boson sampling against the uniform distribution
• Boson Sampling from Gaussian States
• Tensor network states and algorithms in the presence of a global U(1) symmetry
• Experimental Scattershot Boson Sampling
• Quantum Computer Systems for Scientific Discovery
• Generation and sampling of quantum states of light in a silicon chip
• On the experimental verification of quantum complexity in linear optics
• BosonSampling with single-photon Fock states from a bright solid-state source
• A detailed study of Gaussian Boson Sampling
• Scalable boson sampling with a single-photon device
• Entanglement and charge-sharpening transitions in U(1) symmetric monitored quantum circuits
• Gaussian Boson Sampling with Pseudo-Photon-Number Resolving Detectors and Quantum Computational Advantage
• Sampling of partially distinguishable bosons and the relation to the multidimensional permanent
• Toward Scalable Boson Sampling with Photon Loss
• Quantum Computational Advantage via High-Dimensional Gaussian Boson Sampling
• Efficient algorithm for boson sampling with partially distinguishable photons
• Efficient classical simulation of noisy random quantum circuits in one dimension
• Simulating boson sampling in lossy architectures
• The Boundary for Quantum Advantage in Gaussian Boson Sampling
• Bose-Einstein Quantum Phase Transition in an Optical Lattice Model
• Regimes of classical simulability for noisy Gaussian boson sampling
• Classical simulation of photonic linear optics with lost particles
• Direct dialling of Haar random unitary matrices
• Experimental Gaussian Boson Sampling
• Exact simulation of Gaussian Boson Sampling in polynomial space and exponential time
• Boson sampling with Gaussian measurements
• Classical simulation of lossy boson sampling using matrix product operators
• Classically simulating near-term partially-distinguishable and lossy boson sampling
• Noise in BosonSampling and the threshold of efficient classical simulatability
• Driven Boson Sampling
• Multi-particle quantum walks and Fisher information in one-dimensional lattices
• Classical models may be a better explanation of the Jiuzhang 1.0 Gaussian Boson Sampler than its targeted squeezed light model
• Simulating the Dynamics of Single Photons in BosonSampling Devices with Matrix Product States
• Entanglement entropy scaling of noisy random quantum circuits in two dimensions
• Matrix Product States with adaptive global symmetries

Cited by in corpus (16)

• Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
• Classical algorithm for simulating experimental Gaussian boson sampling
• Dequantizing quantum machine learning models using tensor networks
• Tensor networks for quantum computing
• Hybrid Tree Tensor Networks for quantum simulation
• Classical simulability of constant-depth linear-optical circuits with noise
• Gaussian boson sampling at finite temperature
• Validation of a noisy Gaussian boson sampler via graph theory
• Towards Symmetry-Aware Efficient Simulation of Quantum Systems and Beyond
• Classical simulation of circuits with realistic odd-dimensional Gottesman-Kitaev-Preskill states
• On computational complexity and average-case hardness of shallow-depth boson sampling
• Realistic photon-number resolution in Gaussian boson sampling
• Variational Tensor Network Simulation of Gaussian Boson Sampling and Beyond
• Optical Quantum Computing
• Classical algorithms for measurement-adaptive Gaussian circuits
• Boosting Gaussian Boson Sampling using Optical Parametric Amplification Networks