English
Related papers

Related papers: Simulability of Imperfect Gaussian and Superpositi…

200 papers

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-13 B. Opanchuk , L. Rosales-Zárate , M. D. Reid , P. D. Drummond

Gaussian process emulators of computationally expensive computer codes provide fast statistical approximations to model physical processes. The training of these surrogates depends on the set of design points chosen to run the simulator.…

Computation · Statistics 2016-08-16 A. Garbuno-Inigo , F. A. DiazDelaO , K. M. Zuev

Boson sampling is the problem of generating a quantum bit stream whose average is the permanent of a $n\times n$ matrix. The bitstream is created as the output of a prototype quantum computing device with $n$ input photons. It is a…

A BosonSampling device is a quantum machine expected to perform tasks intractable for a classical computer, yet requiring minimal non-classical resources as compared to full-scale quantum computers. Photonic implementations to date employed…

We introduce a computational problem of distinguishing between the output of an ideal coarse-grained boson sampler and the output of a true random number generator, as a resource for cryptographic schemes, which are secure against…

Quantum Physics · Physics 2022-11-29 Georgios M. Nikolopoulos

In a Boson Sampling quantum optical experiment we send $n$ individual photons into an $m$-mode interferometer and we measure the occupation pattern on the output. The statistics of this process depending on the permanent of a matrix…

Quantum Physics · Physics 2026-03-18 Samo Novák , Raúl García-Patrón

Optical losses are the main obstacle to demonstrating a quantum advantage via boson sampling without leaving open the possibility of classical spoofing. We propose a method for generating low-depth optical circuits suitable for boson…

Quantum Physics · Physics 2021-10-12 R. van der Meer , S. Huber , P. W. H. Pinkse , R. García-Patrón , J. J. Renema

Quantum computing experiments are moving into a new realm of increasing size and complexity, with the short-term goal of demonstrating an advantage over classical computers. Boson sampling is a promising platform for such a goal, however,…

Machine learning is widely applied in modern society, but has yet to capitalise on the unique benefits offered by quantum resources. Boson sampling -- a quantum-interference based sampling protocol -- is a resource that is classically hard…

Photon distinguishability is a fundamental property manifested in multiphoton interference and one of the main sources of noise in any photonic quantum information processing. In this work, rather than relying on first-quantization methods,…

Quantum Physics · Physics 2026-02-03 Matheus Eiji Ohno Bezerra , Valery Shchesnovich

Gaussian Boson Sampling (GBS) have shown advantages over classical methods for performing some specific sampling tasks. To fully harness the computational power of GBS, there has been great interest in identifying their practical…

Quantum Physics · Physics 2025-02-28 Jørgen Ellegaard Andersen , Shan Shan

Photonic Quantum Computers provides several benefits over the discrete qubit-based paradigm of quantum computing. By using the power of continuous-variable computing we build an anomaly detection model to use on searches for New Physics.…

High Energy Physics - Phenomenology · Physics 2021-12-01 Andrew Blance , Michael Spannowsky

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

Quantum coherence is a useful resource that is consumed to accomplish several tasks that classical devices are hard to fulfill. Especially, it is considered to be the origin of quantum speedup for many computational algorithms. In this…

Quantum Physics · Physics 2019-12-10 Seungbeom Chin , Joonsuk Huh

We introduce a new family of quantum circuits in Continuous Variables and we show that, relying on the widely accepted conjecture that the polynomial hierarchy of complexity classes does not collapse, their output probability distribution…

Quantum Physics · Physics 2017-12-13 Ulysse Chabaud , Tom Douce , Damian Markham , Peter van Loock , Elham Kashefi , Giulia Ferrini

We propose boson sampling from a system of coupled photons and Bose-Einstein condensed atoms placed inside a multi-mode cavity as a simulation process testing quantum advantage of quantum systems over classical computers. Consider a…

Quantum Physics · Physics 2024-09-16 V. V. Kocharovsky

Image noise can often be accurately fitted to a Poisson-Gaussian distribution. However, estimating the distribution parameters from a noisy image only is a challenging task. Here, we study the case when paired noisy and noise-free samples…

Computer Vision and Pattern Recognition · Computer Science 2022-12-29 Nicolas Bähler , Majed El Helou , Étienne Objois , Kaan Okumuş , Sabine Süsstrunk

Photon loss is destructive to the performance of quantum photonic devices and therefore suppressing the effects of photon loss is paramount to photonic quantum technologies. We present two schemes to mitigate the effects of photon loss for…

Quantum Physics · Physics 2021-05-05 Daiqin Su , Robert Israel , Kunal Sharma , Haoyu Qi , Ish Dhand , Kamil Brádler

Non-Gaussian bosonic states are ubiquitous in interacting light--matter systems, many-body platforms, and relativistic quantum field settings, but their quantitative characterization is hindered by the infinite-dimensional Hilbert space and…

Quantum Physics · Physics 2026-03-17 Federico Centrone , Juan Pablo Paz , Augusto Roncaglia

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…