English
Related papers

Related papers: Statistical Aspects of the Quantum Supremacy Demon…

200 papers

Quantum computers are now on the brink of outperforming their classical counterparts. One way to demonstrate the advantage of quantum computation is through quantum random sampling performed on quantum computing devices. However, existing…

Several important models of machine learning algorithms have been successfully generalized to the quantum world, with potential speedup to training classical classifiers and applications to data analytics in quantum physics that can be…

Quantum Physics · Physics 2021-10-01 Ji Guan , Wang Fang , Mingsheng Ying

Nowadays, quantum computing has reached the engineering phase, with fully-functional quantum processors integrating hundred of noisy qubits available. Yet -- to fully unveil the potential of quantum computing out of the labs and into…

A cloud quantum computer is similar to a random number generator in that its physical mechanism is inaccessible to its users. In this respect, a cloud quantum computer is a black box. In both devices, its users decide the device condition…

Quantum Physics · Physics 2021-03-23 Kentaro Tamura , Yutaka Shikano

Quantum machine learning models have the potential to offer speedups and better predictive accuracy compared to their classical counterparts. However, these quantum algorithms, like their classical counterparts, have been shown to also be…

Quantum Physics · Physics 2021-05-27 Maurice Weber , Nana Liu , Bo Li , Ce Zhang , Zhikuan Zhao

A longstanding goal in quantum information science is to demonstrate quantum computations that cannot be feasibly reproduced on a classical computer. Such demonstrations mark major milestones: they showcase fine control over quantum systems…

While quantum speed-up in solving certain decision problems by a fault-tolerant universal quantum computer has been promised, a timely research interest includes how far one can reduce the resource requirement to demonstrate a provable…

Quantum Physics · Physics 2018-01-01 Jacob Miller , Stephen Sanders , Akimasa Miyake

Motivated by the recent experimental demonstrations of quantum supremacy, proving the hardness of the output of random quantum circuits is an imperative near term goal. We prove under the complexity theoretical assumption of the…

Quantum Physics · Physics 2021-12-13 Yasuhiro Kondo , Ryuhei Mori , Ramis Movassagh

Quantum computation and quantum information are of great current interest in computer science, mathematics, physical sciences and engineering. They will likely lead to a new wave of technological innovations in communication, computation…

Methodology · Statistics 2012-10-03 Yazhen Wang

Sharing correlated random variables is a resource for a number of information theoretic tasks such as privacy amplification, simultaneous message passing, secret sharing and many more. In this article, we show that to establish such a…

Quantum Physics · Physics 2021-11-03 Tamal Guha , Mir Alimuddin , Sumit Rout , Amit Mukherjee , Some Sankar Bhattacharya , Manik Banik

Noisy, intermediate-scale quantum computers come with intrinsic limitations in terms of the number of qubits (circuit "width") and decoherence time (circuit "depth") they can have. Here, for the first time, we demonstrate a recently…

Quantum Physics · Physics 2020-09-02 Thomas Ayral , François-Marie Le Régent , Zain Saleem , Yuri Alexeev , Martin Suchara

Quantum computing comes with the potential to push computational boundaries in various domains including, e.g., cryptography, simulation, optimization, and machine learning. Exploiting the principles of quantum mechanics, new algorithms can…

Systems and Control · Electrical Eng. & Systems 2025-12-23 Julian Berberich , Robert L. Kosut , Thomas Schulte-Herbrüggen

Quantum computers have now appeared in our society and are utilized for the investigation of science and engineering. At present, they have been built as intermediate-size computers containing about fifty qubits and are weak against noise…

Quantum Physics · Physics 2020-12-07 Yusuke Hama

The fundamental principles of quantum mechanics, such as its probabilistic nature, allow for the theoretical ability of quantum computers to generate statistically random numbers, as opposed to classical computers which are only able to…

Quantum Physics · Physics 2024-01-24 Owen Root , Maria Becker

Boson Sampling represents a promising approach to obtain an evidence 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…

Quantum Physics · Physics 2016-11-09 Ludovico Latmiral , Nicolò Spagnolo , Fabio Sciarrino

In the last few years, theoretical study of quantum systems serving as computational devices has achieved tremendous progress. We now have strong theoretical evidence that quantum computers, if built, might be used as a dramatically…

Quantum Physics · Physics 2016-11-03 Dorit Aharonov

Quantum computation offers a promising new kind of information processing, where the non-classical features of quantum mechanics can be harnessed and exploited. A number of models of quantum computation exist, including the now well-studied…

Quantum Physics · Physics 2011-08-03 H. J. Briegel , D. E. Browne , W. Dür , R. Raussendorf , M. Van den Nest

In theory, quantum computers can efficiently simulate quantum physics, factor large numbers and estimate integrals, thus solving otherwise intractable computational problems. In practice, quantum computers must operate with noisy devices…

Quantum Physics · Physics 2009-11-10 E. Knill

Quantum mechanics promises computational powers beyond the reach of classical computers. Current technology is on the brink of an experimental demonstration of the superior power of quantum computation compared to classical devices. For…

Quantum Physics · Physics 2019-04-02 Jelmer Renema , Valery Shchesnovich , Raul Garcia-Patron

As we approach the era of quantum advantage, when quantum computers (QCs) can outperform any classical computer on particular tasks, there remains the difficult challenge of how to validate their performance. While algorithmic success can…