Cracking the Quantum Advantage threshold for Gaussian Boson Sampling
- URL: http://arxiv.org/abs/2106.01445v3
- Date: Thu, 7 Jul 2022 16:17:38 GMT
- Title: Cracking the Quantum Advantage threshold for Gaussian Boson Sampling
- Authors: A. S. Popova and A.N. Rubtsov
- Abstract summary: We propose the approximate algorithm to obtain the probability of any specific measurement outcome.
For a 70-mode device on a laptop, our approximation achieves accuracy competitive with the experimental one.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Scientists in quantum technology aspire to quantum advantage: a computational
result unattainable with classical computers. Gaussian boson sampling
experiment has been already claimed to achieve this goal. In this setup
squeezed light states interfere in a mid-sized linear optical network, where
multi-photon collisions take place. The exact simulation of the counting
statistics of $n$ threshold detectors is far beyond the possibilities of modern
supercomputers once $n$ exceeds $100$. Here we challenge quantum advantage for
a mid-sized Gaussian boson sampling setup and propose the approximate algorithm
to obtain the probability of any specific measurement outcome. For an 70-mode
device on a laptop, our approximation achieves accuracy competitive with the
experimental one.
Related papers
- On verifiable quantum advantage with peaked circuit sampling [9.551919087634522]
We show that getting $1/textpoly(n)$ peakedness from such circuits requires $tau_p = Omega(tau_r/n)0.19)$ with overwhelming probability.
We also give numerical evidence that nontrivial peakedness is possible in this model.
arXiv Detail & Related papers (2024-04-22T18:00:06Z) - Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$.
We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
arXiv Detail & Related papers (2024-01-17T18:59:38Z) - Simulation of IBM's kicked Ising experiment with Projected Entangled
Pair Operator [71.10376783074766]
We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation.
Our approach is based on the projected entangled pair operator (PEPO) in the Heisenberg picture.
We develop a Clifford expansion theory to compute exact expectation values and use them to evaluate algorithms.
arXiv Detail & Related papers (2023-08-06T10:24:23Z) - 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) - Iterative Qubits Management for Quantum Index Searching in a Hybrid
System [56.39703478198019]
IQuCS aims at index searching and counting in a quantum-classical hybrid system.
We implement IQuCS with Qiskit and conduct intensive experiments.
Results demonstrate that it reduces qubits consumption by up to 66.2%.
arXiv Detail & Related papers (2022-09-22T21:54:28Z) - Boson sampling with ultracold atoms in a programmable optical lattice [0.0]
We propose a scheme to implement a boson sampling machine with ultracold atoms in a polarization-synthesized optical lattice.
We experimentally demonstrate the basic building block of such a machine by revealing the Hong-Ou-Mandel interference of two bosonic atoms in a four-mode interferometer.
Our results show that atomic samplers have the potential to achieve quantum advantage over today's best supercomputers with $N gtrsim 40$.
arXiv Detail & Related papers (2022-08-25T17:57:31Z) - 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) - Solving the sampling problem of the Sycamore quantum circuits [6.0604034858265345]
We study the problem of generating independent samples from the output distribution of Google's Sycamore quantum circuits with a target fidelity.
We propose a new method to classically solve this problem by contracting the corresponding tensor network just once.
For the Sycamore quantum supremacy circuit with $53$ qubits and $20$ cycles, we have generated one million uncorrelated bitstrings.
arXiv Detail & Related papers (2021-11-04T17:13:09Z)
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.