Statistical benchmark for bosonsampling
From MaRDI portal
Abstract: Computing the state of a quantum mechanical many-body system composed of indistinguishable particles distributed over a multitude of modes is one of the paradigmatic test cases of computational complexity theory: Beyond well-understood quantum statistical effects, the coherent superposition of many-particle amplitudes rapidly overburdens classical computing devices - essentially by creating extremely complicated interference patterns, which also challenge experimental resolution. With the advent of controlled many-particle interference experiments, optical set-ups that can efficiently probe many-boson wave functions - baptised BosonSamplers - have therefore been proposed as efficient quantum simulators which outperform any classical computing device, and thereby challenge the extended Church-Turing thesis, one of the fundamental dogmas of computer science. However, as in all experimental quantum simulations of truly complex systems, there remains one crucial problem: How to certify that a given experimental measurement record is an unambiguous result of sampling bosons rather than fermions or distinguishable particles, or of uncontrolled noise? In this contribution, we describe a statistical signature of many-body quantum interference, which can be used as an experimental (and classically computable) benchmark for BosonSampling.
Recommendations
Cites work
- Characterization of Chaotic Quantum Spectra and Universality of Level Fluctuation Laws
- Combinatorial theory of the semiclassical evaluation of transport moments. I: Equivalence with the random matrix approach
- Diagrammatic method of integration over the unitary group, with applications to quantum transport in mesoscopic systems
- How to generate random matrices from the classical compact groups
- scientific article; zbMATH DE number 46541 (Why is no real title available?)
- scientific article; zbMATH DE number 3621932 (Why is no real title available?)
- scientific article; zbMATH DE number 1164861 (Why is no real title available?)
- scientific article; zbMATH DE number 2174437 (Why is no real title available?)
- Quantum computation and quantum information. 10th anniversary edition
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Skewness and asymmetry: Measures and orderings
- The computational complexity of linear optics
- The nature of computation
- Universal linear optics
Cited in
(13)- Simulating macroscopic quantum correlations in linear networks
- Multi-boson correlation sampling
- Complex scattering as canonical transformation: A semiclassical approach in Fock space
- Quantum de Moivre–Laplace theorem for noninteracting indistinguishable particles in random networks
- On the classical complexity of sampling from quantum interference of indistinguishable bosons
- Analyzing Boltzmann Samplers for Bose–Einstein Condensates with Dirichlet Generating Functions
- Boson-sampling with non-interacting fermions
- Towards quantum supremacy with lossy scattershot boson sampling
- Immanants of blocks from random matrices in some unitary ensembles
- Strong simulation of linear optical processes
- Many-particle interference in a two-component bosonic Josephson junction: an all-optical simulation
- Entanglement in the full state vector of boson sampling
- Validation tests of GBS quantum computers give evidence for quantum advantage with a decoherent target
This page was built for publication: Statistical benchmark for bosonsampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5854979)
