English
Related papers

Related papers: Will boson-sampling ever disprove the Extended Chu…

200 papers

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

Boson sampling can simulate physical problems for which classical simulations are inefficient. However, not all problems simulated by boson sampling are classically intractable. We consider a situation in which it is known that the outcome…

Quantum Physics · Physics 2021-05-03 Wojciech Roga , Masahiro Takeoka

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…

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

Boson sampling is a problem for which quantum devices could prove to go beyond classical computing using only linear optics and photon preparation and counting. While theoretically important, there is a lack of practical applications for…

Quantum Physics · Physics 2019-12-09 Juan Carlos Garcia-Escartin

Boson Sampling represents a promising witness of the supremacy of quantum systems as a resource for the solution of computational problems. The classical hardness of Boson Sampling has been related to the so called Permanent-of-Gaussians…

Quantum Physics · Physics 2015-12-01 Ludovico Latmiral

We study the hardness of classically simulating Gaussian boson sampling at nonzero photon distinguishability. We find that similar to regular boson sampling, distinguishability causes exponential attenuation of the many-photon interference…

Quantum Physics · Physics 2020-07-08 Jelmer J. Renema

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 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

BosonSampling is a problem where a quantum computer offers a provable speedup over classical computers. Its main feature is that it can be solved with current linear optics technology, without the need for a full quantum computer. In this…

Quantum Physics · Physics 2015-03-06 Anthony Leverrier , Raúl García-Patrón

Boson Sampling represents a promising approach to obtain an evidence of the supremacy of quantum systems as a resource for the solution of computational problems. The classical hardness of Boson Sampling has been related to the so called…

Quantum Physics · Physics 2016-11-09 Ludovico Latmiral , Nicolò Spagnolo , Fabio Sciarrino

We pose a generalized Boson Sampling problem. Strong evidence exists that such a problem becomes intractable on a classical computer as a function of the number of Bosons. We describe a quantum optical processor that can solve this problem…

Quantum Physics · Physics 2014-09-10 A. P. Lund , A. Laing , S. Rahimi-Keshari , T. Rudolph , J. L O'Brien , T. C. Ralph

Boson sampling solves a classically intractable problem by sampling from a probability distribution given by matrix permanents. We propose a scalable implementation of Boson sampling using local transverse phonon modes of trapped ions to…

Quantum Physics · Physics 2014-03-24 Chao Shen , Zhen Zhang , Luming Duan

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

While universal quantum computers ideally solve problems such as factoring integers exponentially more efficiently than classical machines, the formidable challenges in building such devices motivate the demonstration of simpler,…

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 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

This thesis is intended in part to summarize and also to contribute to the newest developments in passive linear optics that have resulted, directly or indirectly, from the somewhat shocking discovery in 2010 that the BosonSampling problem…

Quantum Physics · Physics 2016-07-12 Jonathan Olson

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

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