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.

arXiv commentPRL 2023 to appear

References in corpus (30)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum computational advantage using photons
• Characterizing Quantum Supremacy in Near-Term Devices
• Strong quantum computational advantage using a superconducting quantum processor
• Quantum Computational Supremacy
• Gaussian Boson Sampling
• Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
• Measuring measurement
• Probing multimode squeezing with correlation functions
• Quantum Sampling Problems, BosonSampling and Quantum Supremacy
• Scalable boson sampling with a single-photon device
• Computational advantage of quantum random sampling
• Sufficient Conditions for Efficient Classical Simulation of Quantum Optics
• Gaussian Boson Sampling using threshold detectors
• The Boundary for Quantum Advantage in Gaussian Boson Sampling
• Regimes of classical simulability for noisy Gaussian boson sampling
• Resources for bosonic quantum computational advantage
• Nonlinearity in Single Photon Detection: Modeling and Quantum Tomography
• Dynamical phase transitions in sampling complexity
• The Complexity of Bipartite Gaussian Boson Sampling
• Classical simulation of boson sampling based on graph structure
• Simulating complex networks in phase space: Gaussian boson sampling
• Simulability of Imperfect Gaussian and Superposition Boson Sampling
• Spoofing cross entropy measure in boson sampling
• Distinguishing noisy boson sampling from classical simulations
• Classical models may be a better explanation of the Jiuzhang 1.0 Gaussian Boson Sampler than its targeted squeezed light model
• Page curves and typical entanglement in linear optics
• Certification of Gaussian Boson Sampling via graph theory
• Simulating macroscopic quantum correlations in linear networks
• Entanglement in the full state vector of boson sampling

Cited by in corpus (58)

• 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
• Simulating lossy Gaussian boson sampling with matrix product operators
• Enhanced Detection Rate and High Photon-Number Efficiencies with a Scalable Parallel SNSPD
• 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
• Classical simulability of constant-depth linear-optical circuits with noise
• 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
• Approximating outcome probabilities of linear optical circuits
• Simulation of open quantum systems on universal quantum computers
• Towards efficient and secure quantum-classical communication networks
• High performance Boson Sampling simulation via data-flow engines
• Multiqubit coherence of mixed states near event horizon
• Transition of Anticoncentration in Gaussian Boson Sampling
• Boson sampling enhanced quantum chemistry
• Realistic vulnerabilities of decoy-state quantum key distribution
• QSteed: A Resource-Virtualized and Hardware-Aware Quantum Compilation Framework for Real Quantum Computing Processors
• Boson sampling with ultracold atoms in a programmable optical lattice
• Validation of a noisy Gaussian boson sampler via graph theory
• Gaussian boson sampling with click-counting detectors
• Practical implementation of arbitrary nonlocal controlled-unitary gate via indefinite causal order
• Isoenergetic model for optical downconversion and error-specific limits of the parametric approximation
• Efficient Classical Sampling from Gaussian Boson Sampling Distributions on Unweighted Graphs
• Observation of Lie algebraic invariants in Quantum Linear Optics
• Quantum computational advantage of noisy boson sampling with partially distinguishable photons
• Classical simulation of circuits with realistic odd-dimensional Gottesman-Kitaev-Preskill states
• Symmetry-Checking in Band Structure Calculations on a Noisy Quantum Computer
• Variational simulation of higher-spin systems on qubit-based quantum simulators
• On computational complexity and average-case hardness of shallow-depth boson sampling
• Configurable photonic simulator for quantum field dynamics
• Scalable quantum detector tomography by high-performance computing
• Optical Quantum Computing
• Matrix Product State on a Quantum Computer
• Practical considerations for assignment of photon numbers with SNSPDs
• On the Fundamental Resource for Exponential Advantage in Quantum Channel Learning
• Mitigating quantum operation infidelity through engineering the distribution of photon losses
• Classical algorithms for measurement-adaptive Gaussian circuits
• Quantum-optical reset with classical memory
• Realistic photon-number resolution in Gaussian boson sampling
• Boosting Gaussian Boson Sampling using Optical Parametric Amplification Networks
• Training continuously-coupled reconfigurable photonic chips with quantum machine learning
• Linear optical fan-out gates using fewer ancillary single photons with enhanced success probability