Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Spoofing Cross-Entropy Measure in Boson Sampling

Journal Article · · Physical Review Letters

Cross-entropy (XE) measure is a widely used benchmark to demonstrate quantum computational advantage from sampling problems, such as random circuit sampling using superconducting qubits and boson sampling (BS). We present a heuristic classical algorithm that attains a better XE than the current BS experiments in a verifiable regime and is likely to attain a better XE score than the near-future BS experiments in a reasonable running time. The key idea behind the algorithm is that there exist distributions that correlate with the ideal BS probability distribution and that can be efficiently computed. The correlation and the computability of the distribution enable us to postselect heavy outcomes of the ideal probability distribution without computing the ideal probability, which essentially leads to a large XE. Our method scores a better XE than the recent Gaussian BS experiments when implemented at intermediate, verifiable system sizes. Much like current state-of-the-art experiments, we cannot verify that our spoofer works for quantum-advantage-size systems. However, we demonstrate that our approach works for much larger system sizes in fermion sampling, where we can efficiently compute output probabilities. Finally, we provide analytic evidence that the classical algorithm is likely to spoof noisy BS efficiently.

Research Organization:
Univ. of Pennsylvania, Philadelphia, PA (United States)
Sponsoring Organization:
USDOE Office of Science (SC); US Army Research Office (ARO); US Air Force Office of Scientific Research (AFOSR); National Science Foundation (NSF); Packard Foundation
Grant/Contract Number:
SC0020360; W911NF-16-1-0349; W911NF-21-1-0325; A9550-19-1-0399, FA9550-21-1-0209; ERC-1941583; OMA-2137642; 2020-71479
OSTI ID:
2421580
Journal Information:
Physical Review Letters, Vol. 131, Issue 1; ISSN 0031-9007
Publisher:
American Physical Society (APS)Copyright Statement
Country of Publication:
United States
Language:
English

References (30)

Stringent and Efficient Assessment of Boson-Sampling Devices journal July 2014
Quantum computational advantage using photons journal December 2020
Regimes of Classical Simulability for Noisy Gaussian Boson Sampling journal March 2020
Classical Simulation of Boson Sampling Based on Graph Structure journal May 2022
On the complexity and verification of quantum random circuit sampling journal October 2018
Characterizing quantum supremacy in near-term devices journal April 2018
Classical simulation of photonic linear optics with lost particles journal September 2018
Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light journal October 2021
Strong Quantum Computational Advantage Using a Superconducting Quantum Processor journal October 2021
Quantum computational advantage with a programmable photonic processor journal June 2022
Simulating complex networks in phase space: Gaussian boson sampling journal January 2022
Classical simulation of lossy boson sampling using matrix product operators journal August 2021
Quantum Continuous Variables: A Primer of Theoretical Methods book October 2017
Efficient Classical Algorithm for Boson Sampling with Partially Distinguishable Photons journal May 2018
Sampling of partially distinguishable bosons and the relation to the multidimensional permanent journal February 2015
Classically simulating quantum circuits with local depolarizing noise journal November 2021
Solving the Sampling Problem of the Sycamore Quantum Circuits journal August 2022
Quantum supremacy using a programmable superconducting processor journal October 2019
A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling conference June 2023
Quantum computational advantage via high-dimensional Gaussian boson sampling journal January 2022
Universal Quantum Simulators journal August 1996
Complexity of full counting statistics of free quantum particles in product states journal January 2020
Fermion Sampling: A Robust Quantum Computational Advantage Scheme Using Fermionic Linear Optics and Magic Input States journal May 2022
Gaussian Boson Sampling journal October 2017
Achieving quantum supremacy with sparse and noisy commuting quantum computations journal April 2017
Noise in boson sampling and the threshold of efficient classical simulatability journal July 2019
Simulating boson sampling in lossy architectures journal August 2019
Benchmarking of Gaussian boson sampling using two-point correlators journal February 2019
Efficient classical simulation of noisy random quantum circuits in one dimension journal September 2020
Quantum supremacy using a programmable superconducting processor dataset January 2019

Similar Records

Shadow Distillation: Quantum Error Mitigation with Classical Shadows for Near-Term Quantum Processors
Journal Article · Mon Jan 09 00:00:00 EST 2023 · PRX Quantum · OSTI ID:2423793

Estimating the randomness of quantum circuit ensembles up to 50 qubits
Journal Article · Thu Nov 24 00:00:00 EST 2022 · npj Quantum Information · OSTI ID:1969350

Autonomous quantum error correction and fault-tolerant quantum computation with squeezed cat qubits
Journal Article · Thu Aug 03 00:00:00 EDT 2023 · npj Quantum Information · OSTI ID:2423785