Classical benchmarking of Gaussian Boson Sampling on the Titan supercomputer

Abstract

Gaussian Boson Sampling is a model of photonic quantum computing where single-mode squeezed states are sent through linear-optical interferometers and measured using single-photon detectors. In this work, we employ a recent exact sampling algorithm for GBS with threshold detectors to perform classical simulations on the Titan supercomputer. We determine the time and memory resources as well as the amount of computational nodes required to produce samples for different numbers of modes and detector clicks. It is possible to simulate a system with 800 optical modes postselected on outputs with 20 detector clicks, producing a single sample in roughly two hours using $40\%$ of the available nodes of Titan. Additionally, we benchmark the performance of GBS when applied to dense subgraph identification, even in the presence of photon loss. We perform sampling for several graphs containing as many as 200 vertices. Our findings indicate 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.

arXiv comment9 pages, 5 figures. Source code available at: https://github.com/XanaduAI/torontonian-sampling

References in corpus (18)

• Quantum Computing in the NISQ era and beyond
• Boson Sampling on a Photonic Chip
• Quantum Computational Supremacy
• Experimental Boson Sampling
• Photonic Boson Sampling in a Tunable Circuit
• Gaussian Boson Sampling
• Boson Sampling for Molecular Vibronic Spectra
• Boson Sampling from Gaussian States
• Experimental Scattershot Boson Sampling
• A detailed study of Gaussian Boson Sampling
• No imminent quantum supremacy by boson sampling
• Using Gaussian Boson Sampling to Find Dense Subgraphs
• 64-Qubit Quantum Circuit Simulation
• Gaussian Boson Sampling using threshold detectors
• Gaussian Boson Sampling for perfect matchings of arbitrary graphs
• Classical Simulation of Intermediate-Size Quantum Circuits
• Quantum approximate optimization with Gaussian boson sampling
• Towards Quantum Supremacy with Lossy Scattershot Boson Sampling

Cited by in corpus (14)

• Strawberry Fields: A Software Platform for Photonic Quantum Computing
• Computational advantage of quantum random sampling
• The Boundary for Quantum Advantage in Gaussian Boson Sampling
• Fast simulation of bosonic qubits via Gaussian functions in phase space
• Simulating complex networks in phase space: Gaussian boson sampling
• Degenerate Squeezing in Waveguides: A Unified Theoretical Approach
• Non-linear Boson Sampling
• Classical models may be a better explanation of the Jiuzhang 1.0 Gaussian Boson Sampler than its targeted squeezed light model
• Simulating macroscopic quantum correlations in linear networks
• Benchmarking 50-Photon Gaussian Boson Sampling on the Sunway TaihuLight
• Linear multiport photonic interferometers: loss analysis of temporally-encoded architectures
• Efficient approximation of experimental Gaussian boson sampling
• Speedup in Classical Simulation of Gaussian Boson Sampling
• Variational Tensor Network Simulation of Gaussian Boson Sampling and Beyond