English
Related papers

Related papers: Classical algorithms for measurement-adaptive Gaus…

200 papers

Gaussian boson sampling is a promising model for demonstrating quantum computational supremacy, which eases the experimental challenge of the standard boson-sampling proposal. Here by analyzing the computational costs of classical…

Quantum Physics · Physics 2019-08-28 Bujiao Wu , Bin Cheng , Jialin Zhang , Man-Hong Yung , Xiaoming Sun

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…

The required set of operations for universal continuous-variable quantum computation can be divided into two primary categories: Gaussian and non-Gaussian operations. Furthermore, any Gaussian operation can be decomposed as a sequence of…

Quantum Physics · Physics 2020-02-12 Kunal Sharma , Mark M. Wilde

Uncertainty quantification based on generalized polynomial chaos has been used in many applications. It has also achieved great success in variation-aware design automation. However, almost all existing techniques assume that the parameters…

Numerical Analysis · Mathematics 2019-06-21 Chunfeng Cui , Zheng Zhang

Gaussian Boson Sampling (GBS), which can be realized with a photonic quantum computing model, perform some special kind of sampling tasks. In [4], we introduced algorithms that use GBS samples to approximate Gaussian expectation problems.…

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

We consider the task of estimating the expectation value of an $n$-qubit tensor product observable $O_1\otimes O_2\otimes \cdots \otimes O_n$ in the output state of a shallow quantum circuit. This task is a cornerstone of variational…

Quantum Physics · Physics 2021-03-11 Sergey Bravyi , David Gosset , Ramis Movassagh

Gaussian Boson Sampling (GBS) generate random samples of photon-click patterns from a class of probability distributions that are hard for a classical computer to sample from. Despite heroic demonstrations for quantum supremacy using GBS,…

Quantum Physics · Physics 2024-02-07 Mushkan Sureka , Saikat Guha

Demonstrating quantum advantage has been a pressing challenge in the field. Most claimed quantum speedups rely on a subroutine in which classical information can be accessed in a coherent quantum manner, which imposes a crucial constraint…

Quantum Physics · Physics 2025-11-04 Nhat A. Nghiem

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

Classical learning of the expectation values of observables for quantum states is a natural variant of learning quantum states or channels. While learning-theoretic frameworks establish the sample complexity and the number of measurement…

Quantum Physics · Physics 2024-08-12 Beng Yee Gan , Po-Wei Huang , Elies Gil-Fuster , Patrick Rebentrost

Gaussian processes are the gold standard for many real-world modeling problems, especially in cases where a model's success hinges upon its ability to faithfully represent predictive uncertainty. These problems typically exist as parts of…

We present a new adaptive method for electronic structure calculations based on novel fast algorithms for reduction of multivariate mixtures. In our calculations, spatial orbitals are maintained as Gaussian mixtures whose terms are selected…

Numerical Analysis · Mathematics 2019-06-19 Gregory Beylkin , Lucas Monzon , Xinshuo Yang

Quantum sensing is an important application of emerging quantum technologies. We explore whether a hybrid system of quantum sensors and quantum circuits can surpass the classical limit of sensing. In particular, we use optimization…

We report an alternative scheme for implementing generalized quantum measurements that does not require the usage of auxiliary system. Our method utilizes solely: (a) classical randomness and post-processing, (b) projective measurements on…

Quantum Physics · Physics 2019-08-30 Michał Oszmaniec , Filip B. Maciejewski , Zbigniew Puchała

We provide a polynomial-time classical algorithm for noisy quantum circuits. The algorithm computes the expectation value of any observable for any circuit, with a small average error over input states drawn from an ensemble (e.g. the…

Quantum Physics · Physics 2024-10-15 Thomas Schuster , Chao Yin , Xun Gao , Norman Y. Yao

Projective measurements with high quantum efficiency is often assumed to be required for efficient circuit based quantum computing. We argue that this is not the case and show that this fact has actually be known previously though not…

Quantum Physics · Physics 2015-03-17 A. P. Lund

Photonic quantum computing has gained significant interest in recent years due to its potential for scaling to large numbers of qubits. A critical requirement for fault-tolerant quantum computation is the reliable generation of non-Gaussian…

Quantum Physics · Physics 2026-03-20 S. Ismailzadeh , B. Abedi Ravan

Quantum computing, with its potential to enhance various machine learning tasks, allows significant advancements in kernel calculation and model precision. Utilizing the one-class Support Vector Machine alongside a quantum kernel, known for…

Quantum instruments describe both the classical outcome and the updated state associated with a quantum measurement. We ask whether these processes can be simulated using only a natural subset of resources, namely projective measurements on…

Quantum Physics · Physics 2025-07-24 Shishir Khandelwal , Armin Tavakoli

We address the use of a single qubit as a quantum probe to characterize the properties of classical noise. In particular, we focus on the characterization of classical noise arising from the interaction with a stochastic field described by…

Quantum Physics · Physics 2015-10-07 Claudia Benedetti , Matteo G. A. Paris