English
Related papers

Related papers: Experimental Scattershot Boson Sampling

200 papers

BosonSampling is the leading candidate for demonstrating quantum computational advantage in photonic systems. While we have recently seen many impressive experimental demonstrations, there is still a formidable distance between the…

Gaussian boson sampling, a computational model that is widely believed to admit quantum supremacy, has already been experimentally demonstrated and is claimed to surpass the classical simulation capabilities of even the most powerful…

Quantum Physics · Physics 2023-11-17 Minzhao Liu , Changhun Oh , Junyu Liu , Liang Jiang , Yuri Alexeev

Due to the advances in the manufacturing of quantum hardware in the recent years, significant research efforts have been directed towards employing quantum methods to solving problems in various areas of interest. Thus a plethora of novel…

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

Quantum generative modeling has emerged as a promising application of quantum computers, aiming to model complex probability distributions beyond the reach of classical methods. In practice, however, training such models often requires…

Quantum Physics · Physics 2026-03-13 Zoltán Kolarovszki , Bence Bakó , Michał Oszmaniec , Changhun Oh , Zoltán Zimborás

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

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

The parameters of a quantum system grow exponentially with the number of involved quantum particles. Hence, the associated memory requirement goes well beyond the limit of best classic computers for quantum systems composed of a few dozen…

Quantum Physics · Physics 2021-08-31 Jakob S. Kottmann , Mario Krenn , Thi Ha Kyaw , Sumner Alperin-Lea , Alán Aspuru-Guzik

We introduce an algorithm for the classical simulation of Gaussian boson sampling that is quadratically faster than previously known methods. The complexity of the algorithm is exponential in the number of photon pairs detected, not the…

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

Photonics is a promising platform for demonstrating a quantum computational advantage (QCA) by outperforming the most powerful classical supercomputers on a well-defined computational task. Despite this promise, existing proposals and…

A growing cohort of experimental linear photonic networks implementing Gaussian boson sampling (GBS) have now claimed quantum advantage. However, many open questions remain on how to effectively verify these experimental results, as…

Quantum Physics · Physics 2023-08-03 Alexander S. Dellios , Margaret D. Reid , Peter D. Drummond

Sampling from probability distributions of quantum circuits is a fundamentally and practically important task which can be used to demonstrate quantum supremacy using noisy intermediate-scale quantum devices. In the present work, we examine…

Quantum Physics · Physics 2022-08-29 Changhun Oh , Youngrong Lim , Bill Fefferman , Liang Jiang

Multi-particle interference is a key resource for quantum information processing, as exemplified by Boson Sampling. Hence, given its fragile nature, an essential desideratum is a solid and reliable framework for its validation. However,…

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

Loop-based boson samplers interfere photons in the time degree of freedom using a sequence of delay lines. Since they require few hardware components while also allowing for long-range entanglement, they are strong candidates for…

The creation of large-scale, high-fidelity quantum computers is not only a fundamental scientific endeavour in itself, but also provides increasingly robust proofs of quantum computational advantage (QCA) in the presence of unavoidable…

Computational physics is an important tool for analysing, verifying, and -- at times -- replacing physical experiments. Nevertheless, simulating quantum systems and analysing quantum data has so far resisted an efficient classical treatment…

Quantum Physics · Physics 2021-07-07 Sam McArdle

Verification of a quantum advantage in the presence of noise is a key open problem in the study of near-term quantum devices. In this work, we show how to assess the quality of photonic interference in a linear optical quantum device (boson…

Quantum Physics · Physics 2021-03-03 Jelmer J. Renema , Hui Wang , Jian Qin , Xiang You , Chaoyang Lu , Jianwei Pan

Boson-sampling is a highly simplified, but non-universal, approach to implementing optical quantum computation. It was shown by Aaronson and Arkhipov that this protocol cannot be efficiently classically simulated unless the polynomial…

Quantum Physics · Physics 2014-05-27 Peter P. Rohde , Keith R. Motes , Paul A. Knott , William J. Munro