Variational Tensor Network Simulation of Gaussian Boson Sampling and Beyond

Abstract

The continuous variable quantum computing platform constitutes a promising candidate for realizing quantum advantage, as exemplified in Gaussian Boson Sampling. While noise in the experiments makes the computation attainable for classical simulations, it has been suggested that the addition of non-linear elements to the experiment will help retain the quantum advantage. We propose a classical simulation tool for general continuous variable sampling problems, including Gaussian Boson Sampling and beyond. We reformulate the sampling problem as that of finding the ground state of a simple few-body Hamiltonian. This allows us to employ powerful variational methods based on tensor networks and to read off the simulation error directly from the expectation value of the Hamiltonian. We validate our method by simulating Gaussian Boson Sampling, where we achieve results comparable to the state of the art. We also consider a non-Gaussian sampling problem, for which we develop novel local basis optimization techniques based on a non-linear parameterization of the implicit basis, resulting in high effective cutoffs with diminished computational overhead.

References in corpus (45)

• The density-matrix renormalization group in the age of matrix product states
• Quantum information with continuous variables
• Efficient classical simulation of slightly entangled quantum computations
• Matrix product states represent ground states faithfully
• Time-evolution methods for matrix-product states
• Gaussian Boson Sampling
• From density-matrix renormalization group to matrix product states
• Entropy scaling and simulability by Matrix Product States
• Hand-waving and Interpretive Dance: An Introductory Course on Tensor Networks
• Quantum Computing with Continuous-Variable Clusters
• Strawberry Fields: A Software Platform for Photonic Quantum Computing
• Boson Sampling from Gaussian States
• Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
• Alternating minimal energy methods for linear systems in higher dimensions. Part II: Faster algorithm and application to nonsymmetric systems
• Alternating minimal energy methods for linear systems in higher dimensions. Part I: SPD systems
• A detailed study of Gaussian Boson Sampling
• No imminent quantum supremacy by boson sampling
• A Strictly Single-Site DMRG Algorithm with Subspace Expansion
• Hamiltonian Truncation Study of the Phi^4 Theory in Two Dimensions
• Efficient tensor network simulation of IBM's Eagle kicked Ising experiment
• Finite automata for caching in matrix product algorithms
• Tensor Network Algorithms: a Route Map
• Critical and strong-coupling phases in one- and two-bath spin-boson models
• Gaussian Boson Sampling using threshold detectors
• Applications of Near-Term Photonic Quantum Computers: Software and Algorithms
• Quantum Computational Advantage via High-Dimensional Gaussian Boson Sampling
• Sparse polynomial space approach to dissipative quantum systems: Application to the sub-ohmic spin-boson model
• The Boundary for Quantum Advantage in Gaussian Boson Sampling
• Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance
• Experimental Gaussian Boson Sampling
• Matrix-product-state method with a dynamical local basis optimization for bosonic systems out of equilibrium
• Resources for bosonic quantum computational advantage
• Extending the range of real time density matrix renormalization group simulations
• Exact simulation of Gaussian Boson Sampling in polynomial space and exponential time
• Classical algorithm for simulating experimental Gaussian boson sampling
• Matrix decompositions in Quantum Optics: Takagi/Autonne, Bloch-Messiah/Euler, Iwasawa, and Williamson
• Classical simulation of Gaussian quantum circuits with non-Gaussian input states
• Automated construction of $U(1)$-invariant matrix-product operators from graph representations
• Simulating lossy Gaussian boson sampling with matrix product operators
• Variational Schrieffer-Wolff Transformations for Quantum Many-Body Dynamics
• Classical benchmarking of Gaussian Boson Sampling on the Titan supercomputer
• Non-linear Boson Sampling
• Low-rank Riemannian eigensolver for high-dimensional Hamiltonians
• Noise thresholds for classical simulability of non-linear Boson sampling
• Non-producibility of arbitrary non-Gaussian states using zero-mean Gaussian states and partial photon number resolving detection