English
Related papers

Related papers: Gaussian Boson Sampling with Pseudo-Photon-Number …

200 papers

The implementation of large-scale universal quantum computation represents a challenging and ambitious task on the road to quantum processing of information. In recent years, an intermediate approach has been pursued to demonstrate quantum…

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

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…

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

We show that counting the number of collisions (re-sampled bitstrings) when measuring a random quantum circuit provides a practical benchmark for the quality of a quantum computer and a quantitative noise characterization method. We…

Quantum Physics · Physics 2024-12-05 Andrea Mari

In order to substantiate claims of quantum computational advantage, it is crucial to develop efficient methods for validating the experimental data. We propose a test of the correct functioning of a boson sampler with single-photon inputs…

Quantum Physics · Physics 2024-09-25 Benoit Seron , Leonardo Novo , Alex Arkhipov , Nicolas J. Cerf

A famously hard graph problem with a broad range of applications is computing the number of perfect matchings, that is the number of unique and complete pairings of the vertices of a graph. We propose a method to estimate the number of…

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…

We present a quantum-inspired classical algorithm that can be used for graph-theoretical problems, such as finding the densest $k$-subgraph and finding the maximum weight clique, which are proposed as applications of a Gaussian boson…

Quantum Physics · Physics 2024-06-10 Changhun Oh , Bill Fefferman , Liang Jiang , Nicolás Quesada

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…

Working from a model of Gaussian pixel noise, we present and unify over twenty-five years of developments in the statistical analysis of the photon transfer conversion gain measurement. We then study a two-sample estimator of the conversion…

Optics · Physics 2023-01-24 Aaron Hendrickson , David P. Haefner , Bradley L. Preece

A device called a 'Gaussian Boson Sampler' has initially been proposed as a near-term demonstration of classically intractable quantum computation. As recently shown, it can also be used to decide whether two graphs are isomorphic. Based on…

Quantum Physics · Physics 2020-03-18 Maria Schuld , Kamil Brádler , Robert Israel , Daiqin Su , Brajesh Gupt

Proofs of the quantum advantage available in imaging or detecting objects under quantum illumination can rely on optimal measurements without specifying what they are. We use the continuous-variable Gaussian quantum information formalism to…

Quantum Physics · Physics 2021-03-04 Hao Yang , Wojciech Roga , Jonathan D. Pritchard , John Jeffers

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

Photon losses are among the strongest imperfections affecting multi-photon interference. Despite their importance, little is known about their effect on boson sampling experiments. In this work we show that using classical computers, one…

Quantum Physics · Physics 2019-08-07 Raúl García-Patrón , Jelmer J. Renema , Valery Shchesnovich

Macroscopic quantum phenomena, such as observed in superfluids and superconductors, have led to promising technological advancements and some of the most important tests of fundamental physics. At present, quantum detection of light is…

In this paper, secure, remote estimation of a linear Gaussian process via observations at multiple sensors is considered. Such a framework is relevant to many cyber-physical systems and internet-of-things applications. Sensors make…

Cryptography and Security · Computer Science 2018-08-01 Arpan Chattopadhyay , Urbashi Mitra

Gaussian boson sampling (GBS) is a prominent candidate for the experimental demonstration of quantum advantage. However, while the current implementations of GBS are unavoidably subject to noise, the robustness of the classical…

Quantum Physics · Physics 2025-11-12 Byeongseon Go , Changhun Oh , Hyunseok Jeong

Integrated quantum photonics has emerged as one of the leading platforms for scaling quantum information processing, offering compact, stable, and low-loss hardware with precise phase and mode control. Advances in integrated photonics…

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…