Gaussian Boson Sampling with Pseudo-Photon-Number Resolving Detectors and Quantum Computational Advantage

Abstract

We report new Gaussian boson sampling experiments with pseudo-photon-number-resolving detection, which register up to 255 photon-click events. We consider partial photon distinguishability and develop a more complete model for the characterization of the noisy Gaussian boson sampling. In the quantum computational advantage regime, we use Bayesian tests and correlation function analysis to validate the samples against all current classical mockups. Estimating with the best classical algorithms to date, generating a single ideal sample from the same distribution on the supercomputer Frontier would take ~ 600 years using exact methods, whereas our quantum computer, Jiuzhang 3.0, takes only 1.27 us to produce a sample. Generating the hardest sample from the experiment using an exact algorithm would take Frontier ~ 3.1*10^10 years.

PRL 2023 to appear

References in corpus (10)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum computational advantage using photons
• Strong quantum computational advantage using a superconducting quantum processor
• Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
• Measuring measurement
• Probing multimode squeezing with correlation functions
• Spoofing cross entropy measure in boson sampling
• Page curves and typical entanglement in linear optics
• Simulating macroscopic quantum correlations in linear networks
• Entanglement in the full state vector of boson sampling

Cited by in corpus (57)

• NISQ Computers: A Path to Quantum Supremacy
• Classical algorithm for simulating experimental Gaussian boson sampling
• An atomic boson sampler
• Two quantum algorithms for solving the one-dimensional advection-diffusion equation
• Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
• Enhanced Detection Rate and High Photon-Number Efficiencies with a Scalable Parallel SNSPD
• Simulating lossy Gaussian boson sampling with matrix product operators
• Information processing at the speed of light
• Tensor networks for quantum computing
• Entanglement-enabled advantage for learning a bosonic random displacement channel
• Proof-of-work consensus by quantum sampling
• Atomic-scale on-demand photon polarization manipulation with high-efficiency for integrated photonic chips
• On-chip quantum interference between independent lithium niobate-on-insulator photon-pair sources
• Leveraging Analog Quantum Computing with Neutral Atoms for Solvent Configuration Prediction in Drug Discovery
• Quantum-inspired classical algorithm for graph problems by Gaussian boson sampling
• Nonseparability of multipartite systems in dilaton black hole
• Semi-device independent characterization of multiphoton indistinguishability
• Exploring Shallow-Depth Boson Sampling: Towards Scalable Quantum Supremacy
• Benchmarking a boson sampler with Hamming nets
• Photon-number moments and cumulants of Gaussian states
• Boosting Photon-Number-Resolved Detection Rates of Transition-Edge Sensors by Machine Learning
• Fast reconstruction of programmable interferometers with intensity-only measurements
• BosonSampling.jl: A Julia package for quantum multi-photon interferometry
• Classical simulability of constant-depth linear-optical circuits with noise
• Approximating outcome probabilities of linear optical circuits
• Realistic vulnerabilities of decoy-state quantum key distribution
• Towards efficient and secure quantum-classical communication networks
• Transition of Anticoncentration in Gaussian Boson Sampling
• High performance Boson Sampling simulation via data-flow engines
• Multiqubit coherence of mixed states near event horizon
• Simulation of open quantum systems on universal quantum computers
• Boson sampling enhanced quantum chemistry
• Gaussian boson sampling with click-counting detectors
• Practical implementation of arbitrary nonlocal controlled-unitary gate via indefinite causal order
• Validation of a noisy Gaussian boson sampler via graph theory
• QSteed: A Resource-Virtualized and Hardware-Aware Quantum Compilation Framework for Real Quantum Computing Processors
• Isoenergetic model for optical downconversion and error-specific limits of the parametric approximation
• Efficient Classical Sampling from Gaussian Boson Sampling Distributions on Unweighted Graphs
• Quantum computational advantage of noisy boson sampling with partially distinguishable photons
• Classical simulation of circuits with realistic odd-dimensional Gottesman-Kitaev-Preskill states
• Observation of Lie algebraic invariants in Quantum Linear Optics
• Configurable photonic simulator for quantum field dynamics
• Variational simulation of higher-spin systems on qubit-based quantum simulators
• On computational complexity and average-case hardness of shallow-depth boson sampling
• Symmetry-Checking in Band Structure Calculations on a Noisy Quantum Computer
• Scalable quantum detector tomography by high-performance computing
• Practical considerations for assignment of photon numbers with SNSPDs
• Boosting Gaussian Boson Sampling using Optical Parametric Amplification Networks
• Training continuously-coupled reconfigurable photonic chips with quantum machine learning
• Quantum-optical reset with classical memory
• Linear optical fan-out gates using fewer ancillary single photons with enhanced success probability
• Classical algorithms for measurement-adaptive Gaussian circuits
• Mitigating quantum operation infidelity through engineering the distribution of photon losses
• On the Fundamental Resource for Exponential Advantage in Quantum Channel Learning
• Realistic photon-number resolution in Gaussian boson sampling
• Matrix Product State on a Quantum Computer
• Optical Quantum Computing