Related papers: How Random Is Quantum Randomness? An Experimental …
It is often said that quantum and classical randomness are of different nature, the former being ontological and the latter epistemological. However, so far the question of "What is quantum in quantum randomness", i.e. what is the impact of…
A critical milestone on the path to useful quantum computers is quantum supremacy - a demonstration of a quantum computation that is prohibitively hard for classical computers. A leading near-term candidate, put forth by the Google/UCSB…
Random numbers are an important resource for applications such as numerical simulation and secure communication. However, it is difficult to certify whether a physical random number generator is truly unpredictable. Here, we exploit the…
Most of physical experiments are usually described as repeated measurements of some random variables. The experimental data registered by on-line computers form time series of outcomes. The frequencies of different outcomes are compared…
The certification of randomness is essential for both fundamental science and information technologies. Unlike traditional random number generators, randomness obtained from nonlocal correlations is fundamentally guaranteed to be…
There is a constraining relation between the reliability of a quantum measurement and the extent to which the measurement process is, in principle, reversible. The greater the information that is gained, the less reversible the measurement…
In this work, we aim at augmenting the decisions output by quantum models with "error bars" that provide finite-sample coverage guarantees. Quantum models implement implicit probabilistic predictors that produce multiple random decisions…
Verification of quantum circuits is essential for guaranteeing correctness of quantum algorithms and/or quantum descriptions across various levels of abstraction. In this work, we show that there are promising ways to check the correctness…
Randomness has attracted great interest in the field of music composition for quite some time. As early as 1962, Iannis Xenakis started exploring a stochastic approach to randomness by using computer-based interlinking probability functions…
Quantum entanglement is one of the core features of quantum theory. While it is typically revealed by measurements along carefully chosen directions, here we review different methods based on so-called random or randomized measurements.…
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a…
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…
Randomness is a fundamental feature in nature and a valuable resource for applications ranging from cryptography and gambling to numerical simulation of physical and biological systems. Random numbers, however, are difficult to characterize…
Quantum coherence is a fundamental property of quantum systems, separating quantum from classical physics. Recently, there has been significant interest in the characterization of quantum coherence as a resource, investigating how coherence…
Randomness is a critical resource of modern cryptosystems. Quantum mechanics offers the best properties of an entropy source in terms of unpredictability. However, these sources are often fragile and can fail silently. Therefore,…
Quantum computing is a new model of computation, based on quantum physics. Quantum computers can be exponentially faster than conventional computers for problems such as factoring. Besides full-scale quantum computers, more restricted…
This review is designed to introduce mathematicians and computational scientists to quantum computing (QC) through the lens of uncertainty quantification (UQ) by presenting a mathematically rigorous and accessible narrative for…
A quantum computer has now solved a specialized problem believed to be intractable for supercomputers, suggesting that quantum processors may soon outperform supercomputers on scientifically important problems. But flaws in each quantum…
Recent experiments completed by collaborating research groups from Google, NASA Ames, UC Santa Barbara, and others provided compelling evidence that quantum supremacy has finally been achieved on a superconducting quantum processor. The…
Quantum computation has made considerable progress in the last decade with multiple emerging technologies providing proof-of-principle experimental demonstrations of such calculations. However, these experimental demonstrations of quantum…