A Benchmark Test of Boson Sampling on Tianhe-2 Supercomputer

Abstract

Boson sampling, thought to be intractable classically, can be solved by a quantum machine composed of merely generation, linear evolution and detection of single photons. Such an analog quantum computer for this specific problem provides a shortcut to boost the absolute computing power of quantum computers to beat classical ones. However, the capacity bound of classical computers for simulating boson sampling has not yet been identified. Here we simulate boson sampling on the Tianhe-2 supercomputer which occupied the first place in the world ranking six times from 2013 to 2016. We computed the permanent of the largest matrix using up to 312,000 CPU cores of Tianhe-2, and inferred from the current most efficient permanent-computing algorithms that an upper bound on the performance of Tianhe-2 is one 50-photon sample per ~100 min. In addition, we found a precision issue with one of two permanent-computing algorithms.

arXiv comment7 pages, 5 figures

References in corpus (26)

• Surface codes: Towards practical large-scale quantum computation
• Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
• Universal Linear Optics
• Boson Sampling on a Photonic Chip
• Experimental Boson Sampling
• Experimental boson sampling in arbitrary integrated photonic circuits
• Photonic Boson Sampling in a Tunable Circuit
• Realization of a scalable Shor algorithm
• Shor's quantum factoring algorithm on a photonic chip
• Experimental realisation of Shor's quantum factoring algorithm using qubit recycling
• Experimental demonstration of Shor's algorithm with quantum entanglement
• Efficient experimental validation of photonic boson sampling against the uniform distribution
• Boson Sampling from Gaussian States
• Demonstration of Shor's quantum factoring algorithm using photonic qubits
• Experimental Scattershot Boson Sampling
• Two-photon quantum walk in a multimode fiber
• Scalable boson-sampling with time-bin encoding using a loop-based architecture
• Efficient factorization with a single pure qubit and $logN$ mixed qubits
• A chip-based array of near-identical, pure, heralded single photon sources
• Error tolerance of the BosonSampling model for linear optics quantum computing
• Sampling arbitrary photon-added or photon-subtracted squeezed states is in the same complexity class as boson sampling
• Boson sampling with displaced single-photon Fock states versus single-photon-added coherent states---The quantum-classical divide and computational-complexity transitions in linear optics
• Spontaneous parametric down-conversion photon sources are scalable in the asymptotic limit for boson-sampling
• Sampling generalized cat states with linear optics is probably hard
• Optical quantum computing with photons of arbitrarily low fidelity and purity
• Implementing Scalable Boson Sampling with Time-Bin Encoding: Analysis of Loss, Mode Mismatch, and Time Jitter

Cited by in corpus (30)

• Boson sampling with 20 input photons in 60-mode interferometers at $10^{14}$ state spaces
• Computational advantage of quantum random sampling
• Quantum Computational Advantage via High-Dimensional Gaussian Boson Sampling
• Classical simulation of photonic linear optics with lost particles
• General-purpose quantum circuit simulator with Projected Entangled-Pair States and the quantum supremacy frontier
• Nanomechanical single-photon routing
• Classical simulation of linear optics subject to nonuniform losses
• Simulability of Imperfect Gaussian and Superposition Boson Sampling
• Classically simulating near-term partially-distinguishable and lossy boson sampling
• Generating Haar-uniform Randomness using Stochastic Quantum Walks on a Photonic Chip
• Non-linear Boson Sampling
• Efficient computation of permanents, with applications to boson sampling and random matrices
• Simulating the Dynamics of Single Photons in BosonSampling Devices with Matrix Product States
• Proof-of-work consensus by quantum sampling
• Simulation of Quantum Computing on Classical Supercomputers
• Timestamp Boson Sampling
• Robustness of quantum Fourier transform interferometry
• Quantum supremacy of the many-body fluctuations in the occupations of the excited particle states in a Bose-Einstein-condensed gas
• Simulating macroscopic quantum correlations in linear networks
• Sample-efficient benchmarking of multi-photon interference on a boson sampler in the sparse regime
• Sample caching Markov chain Monte Carlo approach to boson sampling simulation
• General Quantum Bernoulli Factory: Framework Analysis and Experiments
• Rényi entanglement entropy after a quantum quench starting from insulating states in a free boson system
• Order-invariant two-photon quantum correlations in PT-symmetric interferometers
• High performance Boson Sampling simulation via data-flow engines
• SUperman: Efficient Permanent Computation on GPUs
• Boson sampling with ultracold atoms in a programmable optical lattice
• Analysis of heralded higher-fidelity two-qubit entangling gates with self-correction
• Entanglement entropy dynamics of non-Gaussian states in free boson systems: Random sampling approach
• Validating multi-photon quantum interference with finite data