English
Related papers

Related papers: Quantum Supremacy through Fock State $q$ boson Sam…

200 papers

Boson Sampling is a task that is conjectured to be computationally hard for a classical computer, but which can be efficiently solved by linear-optical interferometers with Fock state inputs. Significant advances have been reported in the…

Quantum Physics · Physics 2023-04-14 Nicolò Spagnolo , Daniel J. Brod , Ernesto F. Galvão , Fabio Sciarrino

In the near future, there will likely be special-purpose quantum computers with 40-50 high-quality qubits. This paper lays general theoretical foundations for how to use such devices to demonstrate "quantum supremacy": that is, a clear…

Quantum Physics · Physics 2016-12-28 Scott Aaronson , Lijie Chen

Quantum computer, harnessing quantum superposition to boost a parallel computational power, promises to outperform its classical counterparts and offer an exponentially increased scaling. The term "quantum advantage" was proposed to mark…

The boson sampling problem has brought a lot of attention in the quantum information field because it is not efficiently solvable with a classical computer; nonetheless it can be implemented with linear optical interferometers with…

Quantum Physics · Physics 2015-06-17 Vincenzo Tamma

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…

Repeated quantum non-demolition measurement is a cornerstone of quantum error correction protocols. In superconducting qubits, the speed of dispersive state readout can be enhanced by increasing the power of the readout tone. However, such…

Boson sampling is a specific quantum computation, which is likely hard to implement efficiently on a classical computer. The task is to sample the output photon number distribution of a linear optical interferometric network, which is fed…

Like a quantum computer designed for a particular class of problems, a quantum simulator enables quantitative modeling of quantum systems that is computationally intractable with a classical computer. Quantum simulations of quantum…

Quantum Physics · Physics 2013-07-16 William E. Shanks , Devin L. Underwood , Andrew A. Houck

Boson sampling is a mathematical problem that is strongly believed to be intractable for classical computers, whereas passive linear interferometers can produce samples efficiently. So far, the problem remains a computational curiosity, and…

Quantum Physics · Physics 2019-07-04 Georgios M. Nikolopoulos , Thomas Brougham

The first post-classical computation will most probably be performed not on a universal quantum computer, but rather on a dedicated quantum hardware. A strong candidate for achieving this is represented by the task of sampling from the…

Quantum Physics · Physics 2016-10-06 Borja Peropadre , Gian Giacomo Guerreschi , Joonsuk Huh , Alán Aspuru-Guzik

Demonstrating the ability of existing quantum platforms to perform certain computational tasks intractable to classical computers represents a cornerstone in quantum computing. Despite the growing number of such proposed "quantum supreme"…

Quantum mechanics promises computational powers beyond the reach of classical computers. Current technology is on the brink of an experimental demonstration of the superior power of quantum computation compared to classical devices. For…

Quantum Physics · Physics 2019-04-02 Jelmer Renema , Valery Shchesnovich , Raul Garcia-Patron

Boson sampling is a sampling task proven to be hard to simulate efficiently using classical computers under plausible assumptions, which makes it an appealing candidate for quantum supremacy. However, due to a large noise rate for near-term…

Quantum Physics · Physics 2024-05-09 Byeongseon Go , Changhun Oh , Liang Jiang , 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

Boson sampling is a key candidate for demonstrating quantum advantage, and has already yielded significant advances in quantum simulation, machine learning, and graph theory. In this work, a unification and extension of distinct forms of…

Quantum Physics · Physics 2025-12-29 Luca Bianchi , Carlo Marconi , Laura Ares , Davide Bacco , Jan Sperling

Gaussian boson sampling exploits squeezed states to provide a highly efficient way to demonstrate quantum computational advantage. We perform experiments with 50 input single-mode squeezed states with high indistinguishability and squeezing…

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

Boson sampling is a leading candidate for demonstrating quantum advantage in photonic systems. Despite significant experimental and theoretical progress, a characterization of its output statistics remains incomplete. This is especially…

Quantum Physics · Physics 2026-04-17 Hela Mhiri , Hugo Thomas , Léo Monbroussou , Ulysse Chabaud , Zoë Holmes , Elham Kashefi

Boson Sampling is the problem of sampling from the same output probability distribution as a collection of indistinguishable single photons input into a linear interferometer. It has been shown that, subject to certain computational…

Quantum Physics · Physics 2018-06-21 Alexandra E. Moylett , Peter S. Turner

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