English
Related papers

Related papers: Classical simulability of noisy boson sampling

200 papers

Boson sampling stands out as a promising approach toward experimental demonstration of quantum computational advantage. However, the presence of physical noise in near-term experiments hinders the realization of the quantum computational…

Quantum Physics · Physics 2025-09-30 Byeongseon Go , Changhun Oh , Hyunseok Jeong

Gaussian boson sampling is a promising candidate for showing experimental quantum advantage. While there is evidence that noiseless Gaussian boson sampling is hard to efficiently simulate using a classical computer, the current Gaussian…

Quantum Physics · Physics 2024-09-24 Changhun Oh , Minzhao Liu , Yuri Alexeev , Bill Fefferman , Liang Jiang

Giving a convincing experimental evidence of the quantum supremacy over classical simulations is a challenging goal. Noise is considered to be the main problem in such a demonstration, hence it is urgent to understand the effect of noise.…

Quantum Physics · Physics 2022-03-08 Valery Shchesnovich

Understanding the energetic efficiency of quantum computers is essential for assessing their scalability and for determining whether quantum technologies can outperform classical computation beyond runtime alone. In this work, we analyze…

Boson sampling is one of the leading protocols for demonstrating a quantum advantage, but the theory of how this protocol responds to noise is still incomplete. We extend the theory of classical simulation of boson sampling with partial…

Quantum Physics · Physics 2025-03-07 S. N. van den Hoven , E. Kanis , J. J. Renema

To simulate noisy boson sampling approximating it by only the lower-order multi-boson interferences (e.g., by a smaller number of interfering bosons and classical particles) is very popular idea. I show that the output data from any such…

Quantum Physics · Physics 2022-04-19 Valery Shchesnovich

Boson sampling, a computational problem conjectured to be hard to simulate on a classical machine, is a promising candidate for an experimental demonstration of quantum advantage using bosons. However, inevitable experimental noise and…

Quantum Physics · Physics 2022-10-12 Gabriele Bressanini , Hyukjoon Kwon , M. S. Kim

Boson sampling, a computational task believed to be classically hard to simulate, is expected to hold promise for demonstrating quantum computational advantage using near-term quantum devices. However, noise in experimental implementations…

Quantum Physics · Physics 2026-03-17 Byeongseon Go , Changhun Oh , Hyunseok Jeong

Quantum random sampling is the leading proposal for demonstrating a computational advantage of quantum computers over classical computers. Recently, first large-scale implementations of quantum random sampling have arguably surpassed the…

Quantum Physics · Physics 2023-07-21 Dominik Hangleiter , Jens Eisert

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…

Quantum Physics · Physics 2022-07-08 A. S. Popova , A. N. Rubtsov

Quantum computers solve intractable problems which classically require an exponentially long time to compute. With the development of large-scale experiments that claim quantum advantage, a vital issue has now emerged. What are the errors,…

Quantum Physics · Physics 2026-04-15 Ned Goodman , Alexander S. Dellios , Margaret D. Reid , Peter D. Drummond

Quantum advantage, benchmarking the computational power of quantum machines outperforming all classical computers in a specific task, represents a crucial milestone in developing quantum computers and has been driving different physical…

Gaussian boson sampling (GBS) is a promising candidate for an experimental demonstration of quantum advantage using photons. However, sufficiently large noise might hinder a GBS implementation from entering the regime where quantum speedup…

Quantum Physics · Physics 2024-01-24 Gabriele Bressanini , Hyukjoon Kwon , M. S. Kim

There is a large body of evidence for the potential of greater computational power using information carriers that are quantum mechanical over those governed by the laws of classical mechanics. But the question of the exact nature of the…

Quantum Physics · Physics 2017-08-23 A. P. Lund , Michael J. Bremner , T. C. Ralph

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

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…

Identifying the boundary beyond which quantum machines provide a computational advantage over their classical counterparts is a crucial step in charting their usefulness. Gaussian Boson Sampling (GBS), in which photons are measured from a…

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…

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

The search for new, application-specific quantum computers designed to outperform any classical computer is driven by the ending of Moore's law and the quantum advantages potentially obtainable. Photonic networks are promising examples,…

Quantum Physics · Physics 2018-04-10 Bogdan Opanchuk , Laura Rosales-Zarate , Margaret D Reid , Peter D Drummond
‹ Prev 1 2 3 10 Next ›