Validation tests of GBS quantum computers give evidence for quantum advantage with a decoherent target

• URL: http://arxiv.org/abs/2211.03480v5
• Date: Tue, 1 Aug 2023 11:17:54 GMT
• Title: Validation tests of GBS quantum computers give evidence for quantum advantage with a decoherent target
• Authors: Alexander S. Dellios, Bogdan Opanchuk, Margaret D. Reid and Peter D. Drummond
• Abstract summary: We use positive-P phase-space simulations of grouped count probabilities as a fingerprint for verifying multi-mode data. We show how one can disprove faked data, and apply this to a classical count algorithm.
• Score: 62.997667081978825
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Computational validation is vital for all large-scale quantum computers. One needs computers that are both fast and accurate. Here we apply precise, scalable, high order statistical tests to data from large Gaussian boson sampling (GBS) quantum computers that claim quantum computational advantage. These tests can be used to validate the output results for such technologies. Our method allows investigation of accuracy as well as quantum advantage. Such issues have not been investigated in detail before. Our highly scalable technique is also applicable to other applications of linear bosonic networks. We utilize positive-P phase-space simulations of grouped count probabilities (GCP) as a fingerprint for verifying multi-mode data. This is exponentially more efficient than other phase-space methods, due to much lower sampling errors. We randomly generate tests from exponentially many high-order, grouped count tests. Each of these can be efficiently measured and simulated, providing a quantum verification method that is hard to replicate classically. We give a detailed comparison of theory with a 144-channel GBS experiment, including grouped correlations up to the largest order measured. We show how one can disprove faked data, and apply this to a classical count algorithm. There are multiple distance measures for evaluating the fidelity and computational complexity of a distribution. We compute these and explain them. The best fit to the data is a partly thermalized Gaussian model, which is neither the ideal case, nor the model that gives classically computable counts. Even with this model, discrepancies of $Z>100$ were observed from some $\chi^2$ tests, indicating likely parameter estimation errors. Total count distributions were much closer to a thermalized quantum model than the classical model, giving evidence consistent with quantum computational advantage for a modified target problem.

Related papers

• Validation tests of Gaussian boson samplers with photon-number resolving detectors [44.99833362998488]
  We apply phase-space simulation methods to partially verify recent experiments on Gaussian boson sampling (GBS) implementing photon-number resolving (PNR) detectors. We show that the data as a whole shows discrepancies with theoretical predictions for perfect squeezing. We suggest that such validation tests could form the basis of feedback methods to improve GBS quantum computer experiments.
  arXiv  Detail & Related papers  (2024-11-18T01:41:22Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Incoherent Approximation of Leakage in Quantum Error Correction [0.03922370499388702]
  Quantum error correcting codes typically do not account for quantum state transitions - leakage - out of the computational subspace. We introduce a Random Phase Approximation (RPA) on quantum channels that preserves the incoherence between the computational and leakage subspaces. We show that RPA yields accurate error correction statistics in the repetition and surface codes with physical error parameters.
  arXiv  Detail & Related papers  (2023-12-16T00:52:23Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• A single $T$-gate makes distribution learning hard [56.045224655472865]
  This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits. We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
  arXiv  Detail & Related papers  (2022-07-07T08:04:15Z)
• Re-examining the quantum volume test: Ideal distributions, compiler optimizations, confidence intervals, and scalable resource estimations [0.20999222360659606]
  We explore the quantum volume test to better understand its design aspects, sensitivity to errors, passing criteria, and what passing implies about a quantum computer. We present an efficient algorithm for estimating the expected heavy output probability under different error models and compiler optimization options. We discuss what the quantum volume test implies about a quantum computer's practical or operational abilities especially in terms of quantum error correction.
  arXiv  Detail & Related papers  (2021-10-27T23:05:26Z)
• Bosonic field digitization for quantum computers [62.997667081978825]
  We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
  arXiv  Detail & Related papers  (2021-08-24T15:30:04Z)
• Simpler Proofs of Quantumness [16.12500804569801]
  A proof of quantumness is a method for provably demonstrating that a quantum device can perform computational tasks that a classical device cannot. There are currently three approaches for exhibiting proofs of quantumness. We give a two-message (challenge-response) proof of quantumness based on any trapdoor claw-free function.
  arXiv  Detail & Related papers  (2020-05-11T01:31:18Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.