English
Related papers

Related papers: Classical simulability of noisy boson sampling

200 papers

Quantum computers are expected to be more efficient in performing certain computations than any classical machine. Unfortunately, the technological challenges associated with building a full-scale quantum computer have not yet allowed the…

Quantum computing promises the ability to compute properties of quantum systems exponentially faster than classical computers. Quantum advantage is achieved when a practical problem is solved more efficiently on a quantum computer than on a…

Quantum Physics · Physics 2025-12-03 William A. Simon , Peter J. Love

Multiphoton interference is at the very heart of quantum foundations and applications in quantum sensing and information processing. In particular, boson sampling experiments have the potential to demonstrate quantum computational supremacy…

Quantum Physics · Physics 2021-09-15 Vincenzo Tamma , Simon Laibacher

Boson Sampling represents a promising witness of the supremacy of quantum systems as a resource for the solution of computational problems. The classical hardness of Boson Sampling has been related to the so called Permanent-of-Gaussians…

Quantum Physics · Physics 2015-12-01 Ludovico Latmiral

Quantum computer, harnessing quantum superposition to boost a parallel computational power, promises to outperform its classical counterparts and offer an exponentially increased scaling. The term "quantum advantage" was proposed to mark…

Quantum photonic processors are emerging as promising platforms to prove preliminary evidence of quantum computational advantage towards the realization of universal quantum computers. In the context of non-universal noisy intermediate…

Quantum Physics · Physics 2025-01-14 Denis Stanev , Taira Giordani , Nicolò Spagnolo , Fabio Sciarrino

We study supervised learning algorithms in which a quantum device is used to perform a computational subroutine - either for prediction via probability estimation, or to compute a kernel via estimation of quantum states overlap. We design…

Quantum Physics · Physics 2021-07-07 Ulysse Chabaud , Damian Markham , Adel Sohbi

Demonstration of quantum advantage for classical machine learning tasks remains a central goal for quantum technologies and artificial intelligence. Two major bottlenecks to this goal are the high dimensionality of practical datasets and…

Quantum Physics · Physics 2025-10-16 Mohammad Sharifian , Abolfazl Bayat

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

Classical verification of quantum learning allows classical clients to reliably leverage quantum computing advantages by interacting with untrusted quantum servers. Yet, current quantum devices available in practice suffers from a variety…

Quantum Physics · Physics 2024-11-15 Yinghao Ma , Jiaxi Su , Dong-Ling Deng

Gaussian boson sampling is originally proposed to show quantum advantage with quantum linear optical elements. Recently, several experimental breakthroughs based on Gaussian boson sampling pointing to quantum computing supremacy have been…

Quantum Physics · Physics 2023-01-02 Tian-Yu Yang , Yi-Xin Shen , Zhou-Kai Cao , Xiang-Bin Wang

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

Magic states are essential for universal quantum computation and are widely viewed as a key source of quantum advantage, yet in realistic devices they are inevitably noisy. In this work, we characterize how noise on injected magic resources…

Quantum Physics · Physics 2026-01-21 Jiwon Heo , Sojeong Park , Changhun Oh

Boson sampling is considered as a strong candidate to demonstrate the quantum computational supremacy over classical computers. However, previous proof-of-principle experiments suffered from small photon number and low sampling rates owing…

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

While universal quantum computers ideally solve problems such as factoring integers exponentially more efficiently than classical machines, the formidable challenges in building such devices motivate the demonstration of simpler,…

Quantum technology has the potential to revolutionize how we acquire and process experimental data to learn about the physical world. An experimental setup that transduces data from a physical system to a stable quantum memory, and…

Although the emergence of a fully-functional quantum computer may still be far away from today, in the near future, it is possible to have medium-size, special-purpose, quantum devices that can perform computational tasks not efficiently…

Quantum Physics · Physics 2017-06-28 Man-Hong Yung , Xun Gao

Quantum simulation is a potentially powerful application of quantum computing, holding the promise to be able to emulate interesting quantum systems beyond the reach of classical computing methods. Despite such promising applications, and…

Quantum Physics · Physics 2022-10-07 Kaelyn J. Ferris , A. J. Rasmusson , Nicholas T. Bronn , Olivia Lanes

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…