Sample space filling analysis for boson sampling validation

• URL: http://arxiv.org/abs/2411.14076v1
• Date: Thu, 21 Nov 2024 12:39:37 GMT
• Title: Sample space filling analysis for boson sampling validation
• Authors: A. A. Mazanik, A. N. Rubtsov,
• Abstract summary: We show that due to the intrinsic nature of the boson sampling wave function, its filling behavior can be computationally efficiently distinguished from classically simulated cases. We propose a new validation protocol based on the sample space filling analysis and test it for problems of up to $20$ photons injected into a $400$-mode interferometer.
• Score: 0.0
• License:
• Abstract: Achieving a quantum computational advantage regime, and thus providing evidence against the extended Church-Turing thesis, remains one of the key challenges of modern science. Boson sampling seems to be a very promising platform in this regard, but to be confident of attaining the advantage regime, one must provide evidence of operating with a correct boson sampling distribution, rather than with a pathological classically simulatable one. This problem is often called the validation problem, and it poses a major challenge to demonstrating unambiguous quantum advantage. In this work, using the recently proposed wave function network approach, we study the sample space filling behavior with increasing the number of collected samples. We show that due to the intrinsic nature of the boson sampling wave function, its filling behavior can be computationally efficiently distinguished from classically simulated cases. Therefore, we propose a new validation protocol based on the sample space filling analysis and test it for problems of up to $20$ photons injected into a $400$-mode interferometer. Due to its simplicity and computational efficiency, it can be used among other protocols to validate future experiments to provide more convincing results.

Related papers

• Entanglement-enabled advantage for learning a bosonic random displacement channel [6.354564715928202]
  We show that quantum entanglement can provide an exponential advantage in learning properties of a bosonic continuous-variable system. We present a simple entanglement-assisted scheme that only requires a number of samples independent of $n$, given a sufficient amount of squeezing. Our work illuminates the role of entanglement in learning continuous-variable systems and points toward experimentally feasible demonstrations of provable entanglement-enabled advantage.
  arXiv  Detail & Related papers  (2024-02-29T02:30:39Z)
• Iterated Denoising Energy Matching for Sampling from Boltzmann Densities [109.23137009609519]
  Iterated Denoising Energy Matching (iDEM) iDEM alternates between (I) sampling regions of high model density from a diffusion-based sampler and (II) using these samples in our matching objective. We show that the proposed approach achieves state-of-the-art performance on all metrics and trains $2-5times$ faster.
  arXiv  Detail & Related papers  (2024-02-09T01:11:23Z)
• Gaussian boson sampling validation via detector binning [0.0]
  We propose binned-detector probability distributions as a suitable quantity to statistically validate GBS experiments. We show how to compute such distributions by leveraging their connection with their respective characteristic function. We also illustrate how binned-detector probability distributions behave when Haar-averaged over all possible interferometric networks.
  arXiv  Detail & Related papers  (2023-10-27T12:55:52Z)
• Simulating Gaussian boson sampling quantum computers [68.8204255655161]
  We briefly review recent theoretical methods to simulate experimental Gaussian boson sampling networks. We focus mostly on methods that use phase-space representations of quantum mechanics. A brief overview of the theory of GBS, recent experiments and other types of methods are also presented.
  arXiv  Detail & Related papers  (2023-08-02T02:03:31Z)
• Testing of on-cloud Gaussian Boson Sampler "Borealis'' via graph theory [0.0]
  photonic-based sampling machines solving the Gaussian Boson Sampling problem play a central role in the experimental demonstration of a quantum computational advantage. In this work, we test the performances of the recently developed photonic machine Borealis as a sampling machine and its possible use cases in graph theory.
  arXiv  Detail & Related papers  (2023-06-21T09:02:55Z)
• 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)
• Validation tests of GBS quantum computers give evidence for quantum advantage with a decoherent target [62.997667081978825]
  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.
  arXiv  Detail & Related papers  (2022-11-07T12:00:45Z)
• Noise thresholds for classical simulability of non-linear Boson sampling [4.812718493682455]
  We introduce higher order non-linearities as a mean to enhance the computational complexity of the problem and the protocol's robustness against noise. Our results indicate that the addition of single-mode Kerr non-linearity at the input state preparation level, while retaining a linear-optical evolution, makes the Boson sampling protocol more robust against noise.
  arXiv  Detail & Related papers  (2022-02-24T12:17:28Z)
• Flow-based sampling in the lattice Schwinger model at criticality [54.48885403692739]
  Flow-based algorithms may provide efficient sampling of field distributions for lattice field theory applications. We provide a numerical demonstration of robust flow-based sampling in the Schwinger model at the critical value of the fermion mass.
  arXiv  Detail & Related papers  (2022-02-23T19:00:00Z)
• 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)

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.