Gaussian boson sampling with click-counting detectors

• URL: http://arxiv.org/abs/2305.00853v2
• Date: Tue, 13 Feb 2024 09:55:24 GMT
• Title: Gaussian boson sampling with click-counting detectors
• Authors: Gabriele Bressanini, Hyukjoon Kwon, M. S. Kim
• Abstract summary: We investigate the problem of sampling from a general multi-mode Gaussian state using click-counting detectors. We show that the probability of obtaining a given outcome is related to a new matrix function dubbed as the Kensingtonian.
• Score: 4.437382576172235
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Gaussian boson sampling constitutes a prime candidate for an experimental demonstration of quantum advantage within reach with current technological capabilities. The original proposal employs photon-number-resolving detectors, however the latter are not widely available. On the other hand, inexpensive threshold detectors can be combined into a single click-counting detector to achieve approximate photon number resolution. We investigate the problem of sampling from a general multi-mode Gaussian state using click-counting detectors and show that the probability of obtaining a given outcome is related to a new matrix function which is dubbed as the Kensingtonian. We show how the latter relates to the Torontonian and the Hafnian, thus bridging the gap between known Gaussian boson sampling variants. We then prove that, under standard complexity-theoretical conjectures, the model can not be simulated efficiently.

Related papers

• Realistic photon-number resolution in Gaussian boson sampling [0.0]
  Gaussian boson sampling (GBS) is a model of nonuniversal quantum computation that claims to demonstrate quantum supremacy with current technologies. We derive a the photocounting probability distribution in GBS schemes which is applicable for use with general detectors and photocounting techniques.
  arXiv  Detail & Related papers  (2024-03-05T18:20:59Z)
• 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)
• Gaussian Boson Sampling with Pseudo-Photon-Number Resolving Detectors and Quantum Computational Advantage [28.449634706456898]
  We report new Gaussian boson sampling experiments with pseudo-photon-number-resolving detection. We develop a more complete model for the characterization of the noisy Gaussian boson sampling.
  arXiv  Detail & Related papers  (2023-04-24T16:29:25Z)
• 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)
• Testing randomness of series generated in Bell's experiment [62.997667081978825]
  We use a toy fiber optic based setup to generate binary series, and evaluate their level of randomness according to Ville principle. Series are tested with a battery of standard statistical indicators, Hurst, Kolmogorov complexity, minimum entropy, Takensarity dimension of embedding, and Augmented Dickey Fuller and Kwiatkowski Phillips Schmidt Shin to check station exponent. The level of randomness of series obtained by applying Toeplitz extractor to rejected series is found to be indistinguishable from the level of non-rejected raw ones.
  arXiv  Detail & Related papers  (2022-08-31T17:39:29Z)
• Certification of Gaussian Boson Sampling via graph theory [4.063872661554895]
  We exploit a connection between photon counting of a genuine Gaussian Boson Sampling device and the number of perfect matchings in a graph. Within this framework, two approaches that exploit the distributions of graph feature vectors and graph kernels are presented.
  arXiv  Detail & Related papers  (2022-02-15T20:22:28Z)
• 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)
• Gaussian boson sampling with partial distinguishability [0.0]
  We investigate GBS with partial distinguishability using an approach based on virtual modes and indistinguishability efficiency. We show how the boundary of quantum supremacy in GBS can be pushed further by partial distinguishability.
  arXiv  Detail & Related papers  (2021-05-20T08:17:51Z)
• Conditional preparation of non-Gaussian quantum optical states by mesoscopic measurement [62.997667081978825]
  Non-Gaussian states of an optical field are important as a proposed resource in quantum information applications. We propose a novel approach involving displacement of the ancilla field into the regime where mesoscopic detectors can be used. We conclude that states with strong Wigner negativity can be prepared at high rates by this technique under experimentally attainable conditions.
  arXiv  Detail & Related papers  (2021-03-29T16:59:18Z)
• Sample Complexity Bounds for 1-bit Compressive Sensing and Binary Stable Embeddings with Generative Priors [52.06292503723978]
  Motivated by advances in compressive sensing with generative models, we study the problem of 1-bit compressive sensing with generative models. We first consider noiseless 1-bit measurements, and provide sample complexity bounds for approximate recovery under i.i.d.Gaussian measurements. We demonstrate that the Binary $epsilon$-Stable Embedding property, which characterizes the robustness of the reconstruction to measurement errors and noise, also holds for 1-bit compressive sensing with Lipschitz continuous generative models.
  arXiv  Detail & Related papers  (2020-02-05T09:44:10Z)

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.