Papers
Topics
Authors
Recent
Search
2000 character limit reached

Gaussian boson sampling validation via detector binning

Published 27 Oct 2023 in quant-ph | (2310.18113v2)

Abstract: Gaussian boson sampling (GBS), a computational problem conjectured to be hard to simulate on a classical machine, has been at the forefront of recent years' experimental and theoretical efforts to demonstrate quantum advantage. The classical intractability of the sampling task makes validating these experiments a challenging and essential undertaking. In this paper, we propose binned-detector probability distributions as a suitable quantity to statistically validate GBS experiments employing photon-number-resolving detectors. We show how to compute such distributions by leveraging their connection with their respective characteristic function. The latter may be efficiently and analytically computed for squeezed input states as well as for relevant classical hypothesis like squashed states. Our scheme encompasses other validation methods based on marginal distributions and correlation functions. Additionally, it can accommodate various sources of noise, such as losses and partial distinguishability, a feature that have received limited attention within the GBS framework so far. We also illustrate how binned-detector probability distributions behave when Haar-averaged over all possible interferometric networks, extending known results for Fock boson sampling.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (46)
  1. Gaussian boson sampling. Phys. Rev. Lett., 119:170501, Oct 2017. doi: 10.1103/PhysRevLett.119.170501. URL https://link.aps.org/doi/10.1103/PhysRevLett.119.170501.
  2. The Complexity of Bipartite Gaussian Boson Sampling. Quantum, 6:863, November 2022. ISSN 2521-327X. doi: 10.22331/q-2022-11-28-863. URL https://doi.org/10.22331/q-2022-11-28-863.
  3. Quantum computational advantage via high-dimensional gaussian boson sampling. Science Advances, 8(1):eabi7894, 2022. doi: 10.1126/sciadv.abi7894. URL https://www.science.org/doi/abs/10.1126/sciadv.abi7894.
  4. Quantum computational advantage using photons. Science, 370(6523):1460–1463, 2020. doi: 10.1126/science.abe8770. URL https://www.science.org/doi/abs/10.1126/science.abe8770.
  5. Phase-programmable gaussian boson sampling using stimulated squeezed light. Phys. Rev. Lett., 127:180502, Oct 2021. doi: 10.1103/PhysRevLett.127.180502. URL https://link.aps.org/doi/10.1103/PhysRevLett.127.180502.
  6. Quantum computational advantage with a programmable photonic processor. Nature, 606(7912):75–81, 2022. doi: 10.1038/s41586-022-04725-x.
  7. Gaussian boson sampling with pseudo-photon-number-resolving detectors and quantum computational advantage. Phys. Rev. Lett., 131:150601, Oct 2023. doi: 10.1103/PhysRevLett.131.150601. URL https://link.aps.org/doi/10.1103/PhysRevLett.131.150601.
  8. Boson sampling for molecular vibronic spectra. Nature Photonics, 9(9):615–620, 2015. doi: 10.1038/nphoton.2015.153.
  9. Quantum-inspired classical algorithm for molecular vibronic spectra. arXiv preprint arXiv:2202.01861, 2022.
  10. Molecular docking with gaussian boson sampling. Science Advances, 6(23):eaax1950, 2020. doi: 10.1126/sciadv.aax1950. URL https://www.science.org/doi/abs/10.1126/sciadv.aax1950.
  11. Gaussian boson sampling for perfect matchings of arbitrary graphs. Phys. Rev. A, 98:032310, Sep 2018. doi: 10.1103/PhysRevA.98.032310. URL https://link.aps.org/doi/10.1103/PhysRevA.98.032310.
  12. Using gaussian boson sampling to find dense subgraphs. Phys. Rev. Lett., 121:030503, Jul 2018. doi: 10.1103/PhysRevLett.121.030503. URL https://link.aps.org/doi/10.1103/PhysRevLett.121.030503.
  13. The boundary for quantum advantage in gaussian boson sampling. Science Advances, 8(4):eabl9236, 2022. doi: 10.1126/sciadv.abl9236. URL https://www.science.org/doi/abs/10.1126/sciadv.abl9236.
  14. Quadratic speed-up for simulating gaussian boson sampling. PRX Quantum, 3:010306, Jan 2022. doi: 10.1103/PRXQuantum.3.010306. URL https://link.aps.org/doi/10.1103/PRXQuantum.3.010306.
  15. Exact simulation of gaussian boson sampling in polynomial space and exponential time. Phys. Rev. Res., 2:023005, Apr 2020. doi: 10.1103/PhysRevResearch.2.023005. URL https://link.aps.org/doi/10.1103/PhysRevResearch.2.023005.
  16. Classical benchmarking of gaussian boson sampling on the titan supercomputer. Quantum Information Processing, 19:1–14, 2020. doi: 10.1007/s11128-020-02713-6.
  17. Fast simulation of bosonic qubits via gaussian functions in phase space. PRX Quantum, 2:040315, Oct 2021. doi: 10.1103/PRXQuantum.2.040315. URL https://link.aps.org/doi/10.1103/PRXQuantum.2.040315.
  18. Resources for bosonic quantum computational advantage. Phys. Rev. Lett., 130:090602, Mar 2023. doi: 10.1103/PhysRevLett.130.090602. URL https://link.aps.org/doi/10.1103/PhysRevLett.130.090602.
  19. Classical simulation of boson sampling based on graph structure. Phys. Rev. Lett., 128:190501, May 2022. doi: 10.1103/PhysRevLett.128.190501. URL https://link.aps.org/doi/10.1103/PhysRevLett.128.190501.
  20. Sample complexity of device-independently certified “quantum supremacy”. Phys. Rev. Lett., 122:210502, May 2019. doi: 10.1103/PhysRevLett.122.210502. URL https://link.aps.org/doi/10.1103/PhysRevLett.122.210502.
  21. Mattia Walschaers. Signatures of many-particle interference. Journal of Physics B: Atomic, Molecular and Optical Physics, 53(4):043001, jan 2020. doi: 10.1088/1361-6455/ab5c30. URL https://dx.doi.org/10.1088/1361-6455/ab5c30.
  22. Validating multi-photon quantum interference with finite data. Quantum Science and Technology, 5(4):045005, jul 2020. doi: 10.1088/2058-9565/aba03a. URL https://dx.doi.org/10.1088/2058-9565/aba03a.
  23. Shchesnovich, Valery. Boson sampling cannot be faithfully simulated by only the lower-order multi-boson interferences. arXiv preprint arXiv:2204.07792, 2022.
  24. Jelmer J. Renema. Simulability of partially distinguishable superposition and gaussian boson sampling. Phys. Rev. A, 101:063840, Jun 2020. doi: 10.1103/PhysRevA.101.063840. URL https://link.aps.org/doi/10.1103/PhysRevA.101.063840.
  25. Valery Shchesnovich. Distinguishability in quantum interference with multimode squeezed states. Phys. Rev. A, 105:063703, Jun 2022. doi: 10.1103/PhysRevA.105.063703. URL https://link.aps.org/doi/10.1103/PhysRevA.105.063703.
  26. Effect of partial distinguishability on quantum supremacy in gaussian boson sampling. npj Quantum Information, 8(1):54, 2022. doi: 10.1038/s41534-022-00557-9.
  27. Benchmarking of gaussian boson sampling using two-point correlators. Phys. Rev. A, 99:023836, Feb 2019. doi: 10.1103/PhysRevA.99.023836. URL https://link.aps.org/doi/10.1103/PhysRevA.99.023836.
  28. Efficient approximation of experimental Gaussian boson sampling. arXiv:2109.11525, 2021. URL https://arxiv.org/abs/2109.11525.
  29. Computational advantage of quantum random sampling. Rev. Mod. Phys., 95:035001, Jul 2023. doi: 10.1103/RevModPhys.95.035001. URL https://link.aps.org/doi/10.1103/RevModPhys.95.035001.
  30. Spoofing cross-entropy measure in boson sampling. Phys. Rev. Lett., 131:010401, Jul 2023. doi: 10.1103/PhysRevLett.131.010401. URL https://link.aps.org/doi/10.1103/PhysRevLett.131.010401.
  31. Certification of gaussian boson sampling via graphs feature vectors and kernels. Quantum Science and Technology, 8(1):015005, 2022. doi: 10.1088/2058-9565/ac969b.
  32. V. S. Shchesnovich. Universality of generalized bunching and efficient assessment of boson sampling. Phys. Rev. Lett., 116:123601, Mar 2016. doi: 10.1103/PhysRevLett.116.123601. URL https://link.aps.org/doi/10.1103/PhysRevLett.116.123601.
  33. Valery Shchesnovich. Distinguishing noisy boson sampling from classical simulations. Quantum, 5:423, March 2021. ISSN 2521-327X. doi: 10.22331/q-2021-03-29-423. URL https://doi.org/10.22331/q-2021-03-29-423.
  34. Efficient validation of boson sampling from binned photon-number distributions. arXiv preprint arXiv:2212.09643, 2022.
  35. Simulating and assessing boson sampling experiments with phase-space representations. Phys. Rev. A, 97:042304, Apr 2018. doi: 10.1103/PhysRevA.97.042304. URL https://link.aps.org/doi/10.1103/PhysRevA.97.042304.
  36. Simulating complex networks in phase space: Gaussian boson sampling. Phys. Rev. A, 105:012427, Jan 2022. doi: 10.1103/PhysRevA.105.012427. URL https://link.aps.org/doi/10.1103/PhysRevA.105.012427.
  37. Validation tests for GBS quantum computers using grouped count probabilities. arXiv:2211.03480, 2022.
  38. Sufficient conditions for efficient classical simulation of quantum optics. Phys. Rev. X, 6:021039, Jun 2016. doi: 10.1103/PhysRevX.6.021039. URL https://link.aps.org/doi/10.1103/PhysRevX.6.021039.
  39. Regimes of classical simulability for noisy gaussian boson sampling. Phys. Rev. Lett., 124:100502, Mar 2020. doi: 10.1103/PhysRevLett.124.100502. URL https://link.aps.org/doi/10.1103/PhysRevLett.124.100502.
  40. Gaussian boson sampling at finite temperature. arXiv preprint arXiv:2308.13291, 2023.
  41. Proof-of-work consensus by quantum sampling, 2023.
  42. Shchesnovich, Valery S. Asymptotic Gaussian law for noninteracting indistinguishable particles in random networks. Scientific reports, 7(1):1–11, 2017. doi: 10.1038/s41598-017-00044-8.
  43. Anders Hald. A history of parametric statistical inference from Bernoulli to Fisher, 1713-1935. Springer Science & Business Media, 2008.
  44. Classical models may be a better explanation of the Jiuzhang 1.0 Gaussian Boson Sampler than its targeted squeezed light model. Quantum, 7:1076, August 2023. ISSN 2521-327X. doi: 10.22331/q-2023-08-08-1076. URL https://doi.org/10.22331/q-2023-08-08-1076.
  45. Concentration of measure for the analysis of randomized algorithms. Cambridge University Press, 2009.
  46. Noise thresholds for classical simulability of nonlinear boson sampling. Phys. Rev. A, 106:042413, Oct 2022. doi: 10.1103/PhysRevA.106.042413. URL https://link.aps.org/doi/10.1103/PhysRevA.106.042413.
Citations (2)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.