English
Related papers

Related papers: Stringent and efficient assessment of Boson-Sampli…

200 papers

It is predicted that quantum computers will dramatically outperform their conventional counterparts. However, large-scale universal quantum computers are yet to be built. Boson sampling is a rudimentary quantum algorithm tailored to the…

BosonSampling is a restricted model of quantum computation proposed recently, where a non-adaptive linear-optical network is used to solve a sampling problem that seems to be hard for classical computers. Here we show that, even if the…

Quantum Physics · Physics 2015-04-22 Daniel J. Brod

Multiphoton interference is at the very heart of quantum foundations and applications in quantum sensing and information processing. In particular, boson sampling experiments have the potential to demonstrate quantum computational supremacy…

Quantum Physics · Physics 2021-09-15 Vincenzo Tamma , Simon Laibacher

We demonstrate how boson sampling with photons of partial distinguishability can be expressed in terms of interference of fewer photons. We use this observation to propose a classical algorithm to simulate the output of a boson sampler fed…

We provide general sufficient conditions for the efficient classical simulation of quantum-optics experiments that involve inputting states to a quantum process and making measurements at the output. The first condition is based on the…

Quantum Physics · Physics 2016-06-23 Saleh Rahimi-Keshari , Timothy C. Ralph , Carlton M. Caves

As a promising candidate for exhibiting quantum computational supremacy, Gaussian Boson Sampling (GBS) is designed to exploit the ease of experimental preparation of Gaussian states. However, sufficiently large and inevitable experimental…

Quantum Physics · Physics 2020-03-18 Haoyu Qi , Daniel J. Brod , Nicolás Quesada , Raúl García-Patrón

The continuous variable quantum computing platform constitutes a promising candidate for realizing quantum advantage, as exemplified in Gaussian Boson Sampling. While noise in the experiments makes the computation attainable for classical…

Quantum Physics · Physics 2025-08-11 Jonas Vinther , Michael James Kastoryano

We prove the Extended Church-Turing Thesis: Every effective algorithm can be efficiently simulated by a Turing machine. This is accomplished by emulating an effective algorithm via an abstract state machine, and simulating such an abstract…

Logic in Computer Science · Computer Science 2012-08-01 Nachum Dershowitz , Evgenia Falkovich

Gaussian boson sampling (GBS) is a variety of boson sampling overcoming the stable single-photon preparation difficulty of the later. However, like those in the original version, noises in GBS will also result in the deviation of output…

Quantum Physics · Physics 2026-05-19 Yang Ji , Yongzheng Wu , Shi Wang , Jie Hou , Zijian Wang , Bo Jiang

Recently, Google announced the first demonstration of quantum computational supremacy with a programmable superconducting processor. Their demonstration is based on collecting samples from the output distribution of a noisy random quantum…

Quantum Physics · Physics 2020-02-07 Scott Aaronson , Sam Gunn

Modern quantum devices are highly susceptible to errors, making the verification of their correct operation a critical problem. Usual tomographic methods rapidly become intractable as these devices are scaled up. In this paper, we introduce…

Quantum Physics · Physics 2024-11-08 Varun Upreti , Ulysse Chabaud

If classical algorithms have been successful in reproducing the estimation of expectation values of observables of some quantum circuits using off-the-shelf computing resources, matching the performance of the most advanced quantum devices…

We show that a theory of complex scattering between many-body (Fock) states can be constructed such that its classical limit is a canonical transformation thus encoding quantum interference in the semiclassical form of the associated…

Quantum Physics · Physics 2015-10-05 Thomas Engl , Juan Diego Urbina , Quirin Hummel , Klaus Richter

BosonSampling, which we proposed three years ago, is a scheme for using linear-optical networks to solve sampling problems that appear to be intractable for a classical computer. In arXiv:1306.3995, Gogolin et al. claimed that even an ideal…

Quantum Physics · Physics 2013-10-02 Scott Aaronson , Alex Arkhipov

Boson sampling is one of the main quantum computation models to demonstrate the quantum computational advantage. However, this aim may be hard to realize considering two main kinds of noises, which are photon distinguishability and photon…

Quantum Physics · Physics 2024-08-20 Yang Ji , Yongzheng Wu , Shi Wang , Jie Hou , Meiling Chen , Ming Ni

Experimental demonstration of the quantum advantage over classical simulations with Boson Sampling is currently under intensive investigation. There seems to be a scalability issue to the necessary number of bosons on the linear optical…

Quantum Physics · Physics 2021-09-07 Valery Shchesnovich

Gaussian boson sampling (GBS) allows for a way to demonstrate quantum supremacy with the relatively modest experimental resources of squeezed light sources, linear optics, and photon detection. In a realistic experimental setting, numerous…

Quantum Physics · Physics 2022-03-09 Junheng Shi , Tim Byrnes

An important challenge with the current generation of noisy, large-scale quantum computers is the question of validation. Does the hardware generate correct answers? If not, what are the errors? This issue is often combined with questions…

Quantum Physics · Physics 2025-07-11 Alexander S. Dellios , Margaret D. Reid , Peter D. Drummond

Machine learning is widely applied in modern society, but has yet to capitalise on the unique benefits offered by quantum resources. Boson sampling -- a quantum-interference based sampling protocol -- is a resource that is classically hard…

Universal quantum computers promise a dramatic speed-up over classical computers but a full-size realization remains challenging. However, intermediate quantum computational models have been proposed that are not universal, but can solve…