Corpus ID: 237605462

Efficient approximation of experimental Gaussian boson sampling

  title={Efficient approximation of experimental Gaussian boson sampling},
  author={Benjamin Villalonga and Murphy Yuezhen Niu and Li Li and Hartmut Neven and John C. Platt and Vadim N. Smelyanskiy and Sergio Boixo},
Two recent landmark experiments have performed Gaussian boson sampling (GBS) with a nonprogrammable linear interferometer and threshold detectors on up to 144 output modes (see Refs. 1 and 2). Here we give classical sampling algorithms with better total variation distance than these experiments and a computational cost quadratic in the number of modes. Our method samples from a distribution that approximates the single-mode and two-mode ideal marginals of the given Gaussian boson sampler, which… Expand

Figures and Tables from this paper

Holomorphic Quantum Computing
We introduce a model of computing on holomorphic functions, which captures bosonic quantum computing through the Segal–Bargmann representation of quantum states. We argue that this holomorphicExpand


Experimental Gaussian Boson sampling
Gaussian Boson sampling (GBS) provides a highly efficient approach to make use of squeezed states from parametric down-conversion to solve a classically hard-to-solve sampling problem. The GBSExpand
Classical benchmarking of Gaussian Boson Sampling on the Titan supercomputer
This work employs a recent exact sampling algorithm for GBS with threshold detectors to perform classical simulations on the Titan supercomputer and indicates that large losses can be tolerated and that the use of threshold detectors is preferable over using photon-number-resolving detectors postselected on collision-free outputs. Expand
Benchmarking of Gaussian boson sampling using two-point correlators
Gaussian boson sampling is a promising scheme for demonstrating a quantum computational advantage using photonic states that are accessible in a laboratory and, thus, offer scalable sources ofExpand
The Boundary for Quantum Advantage in Gaussian Boson Sampling
A distribution is introduced that is efficient to sample from classically and that passes a variety of GBS validation methods, providing an important adversary for future experiments to test against, and reduces the run-time of classically simulating state-of-the-art GBS experiments to several months. Expand
Speedup in classical simulation of Gaussian boson sampling
Gaussian boson sampling is a promising model for demonstrating quantum computational supremacy, which eases the experimental challenge of the standard boson-sampling proposal. Here by analyzing theExpand
Regimes of Classical Simulability for Noisy Gaussian Boson Sampling.
It is shown that, for most linear-optical architectures, where photon loss increases exponentially with the circuit depth, noisy GBS loses its quantum advantage in the asymptotic limit, and delineate intermediate-sized regimes where GBS devices might considerably outperform classical computers for modest noise levels. Expand
Detailed study of Gaussian boson sampling
Since the development of Boson sampling, there has been a quest to construct more efficient and experimentally feasible protocols to test the computational complexity of sampling from photonicExpand
Cracking the Quantum Advantage threshold for Gaussian Boson Sampling
Quantum advantage, defined as a computational result unattainable with classical computers, is a major goal of scientists currently developing quantum technologies. Recently, quantum advantage wasExpand
Gaussian boson sampling using threshold detectors
We study what is arguably the most experimentally appealing Boson Sampling architecture: Gaussian states sampled with threshold detectors. We show that in this setting, the probability of observing aExpand
Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light.
We report phase-programmable Gaussian boson sampling (GBS) which produces up to 113 photon detection events out of a 144-mode photonic circuit. A new high-brightness and scalable quantum light sourceExpand