English
Related papers

Related papers: Sample space filling analysis for boson sampling v…

200 papers

It has been proven that Boson sampling is a much promising model of optical quantum computation, which has been applied to designing quantum computer successfully, such as "Jiuzhang". However, the meaningful randomness of Boson sampling…

Quantum Physics · Physics 2022-06-07 Jinjing Shi , Tongge Zhao , Yizhi Wang , Chunlin Yu , Yuhu Lu , Ronghua Shi , Shichao Zhang , Junjie Wu

The boson sampler proposed by Aaronson and Arkhipov is a non-universal quantum computer, which can serve as evidence against the extended Church-Turing thesis. It samples the probability distribution at the output of linear unitary optical…

Quantum Physics · Physics 2014-12-03 Valery Shchesnovich

Gaussian boson sampling (GBS) is considered a candidate problem for demonstrating quantum advantage. We propose an algorithm for approximate classical simulation of a lossy GBS instance. The algorithm relies on the Taylor series expansion,…

Quantum Physics · Physics 2024-04-02 M. V. Umanskii , A. N. Rubtsov

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

Quantum technologies have become a powerful paradigm for quantum information and simulation, while quantum chaos plays a key role in understanding complex quantum dynamics. Integrated photonics offers unique advantages for quantum…

BosonSampling is a quantum mechanical task involving Fock basis state preparation and detection and evolution using only linear interactions. A classical algorithm for producing samples from this quantum task cannot be efficient unless the…

Quantum Physics · Physics 2017-08-09 A. P. Lund , S. Rahimi-Keshari , T. C. Ralph

To simulate bosons on a qubit- or qudit-based quantum computer, one has to regularize the theory by truncating infinite-dimensional local Hilbert spaces to finite dimensions. In the search for practical quantum applications, it is important…

Quantum Physics · Physics 2024-04-03 Masanori Hanada , Junyu Liu , Enrico Rinaldi , Masaki Tezuka

We review the recent quantum advantage experiments by IBM, D-Wave, and Google, focusing on cases where efficient classical simulations of the experiment were demonstrated or attempted using tensor network methods. We assess the strengths…

Quantum Physics · Physics 2026-03-27 Augustine Kshetrimayum , Saeed S. Jahromi , Sukhbinder Singh , Román Orús

It is known that, by accounting for the multiboson interferences up to a finite order, the output distribution of noisy Boson Sampling, with distinguishability of bosons serving as noise, can be approximately sampled from in a time…

Quantum Physics · Physics 2023-07-12 Valery Shchesnovich

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

Quantum computers are unnecessary for exponentially-efficient computation or simulation if the Extended Church-Turing thesis---a foundational tenet of computer science---is correct. The thesis would be directly contradicted by a physical…

Sampling experiments provide a viable route to show quantum advantages of quantum devices over classical computers in well-defined computational tasks. However, quantum devices such as boson samplers are susceptible to various errors,…

Quantum Physics · Physics 2025-05-02 Deepesh Singh , Ryan J. Marshman , Nathan Walk , Jens Eisert , Timothy C. Ralph , Austin P. Lund

Gaussian Boson Sampling (GBS) is a recently developed paradigm of quantum computing consisting of sending a Gaussian state through a linear interferometer and then counting the number of photons in each output mode. When the system encodes…

We develop an alternative boson sampling model operating on single-photon states followed by linear interferometry and Gaussian measurements. The hardness proof for simulating such continuous-variable measurements is established in two main…

Quantum Physics · Physics 2017-09-19 Levon Chakhmakhchyan , Nicolas J. Cerf

Since the development of Boson sampling, there has been a quest to construct more efficient and experimentally feasible protocols to test the computational complexity of sampling from photonic states. In this paper we interpret and extend…

The determination of the computational complexity of the boson sampling problem with single boson sources has opened a novel research direction in the quantum computing field. Some research effort has also been devoted towards the use of…

Quantum Physics · Physics 2015-06-11 Vincenzo Tamma , Simon Laibacher

Boson-sampling has attracted much interest as a simplified approach to implementing a subset of optical quantum computing. Boson-sampling requires indistinguishable photons, but far fewer of them than universal optical quantum computing…

Quantum Physics · Physics 2015-01-14 Peter P. Rohde

Randomness is an intrinsic feature of quantum theory. The outcome of any quantum measurement will be random, sampled from a probability distribution that is defined by the measured quantum state. The task of sampling from a prescribed…

Quantum Physics · Physics 2021-01-19 Dominik Hangleiter

Gaussian Boson Sampling is a promising method for experimental demonstrations of quantum advantage because it is easier to implement than other comparable schemes. While most of the properties of Gaussian Boson Sampling are understood to…

Tensor network formalisms have emerged as powerful tools for simulating quantum state evolution. While widely applied in the study of optical quantum circuits, such as Boson Sampling, existing tensor network approaches fail to address the…

Quantum Physics · Physics 2026-05-18 Dario Cilluffo , Matthias Kost , Nicola Lorenzoni , Martin B. Plenio