Related papers: Statistical Analysis on Random Quantum Sampling by…
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…
Quantum sensing promises measurement precision beyond classical limits, but its practical realization is often hindered by decoherence and the challenges of generating and stabilizing entanglement in large-scale systems. Here, we…
We will try to explore, primarily from the complexity-theoretic point of view, limitations of error-correction and fault-tolerant quantum computation. We consider stochastic models of quantum computation on $n$ qubits subject to noise…
Due to the unreliability and limited capacity of existing quantum computer prototypes, quantum circuit simulation continues to be a vital tool for validating next generation quantum computers and for studying variational quantum algorithms,…
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…
As a fundamental phenomenon in nature, randomness has a wide range of applications in the fields of science and engineering. Among different types of random number generators (RNG), quantum random number generator (QRNG) is a kind of…
There has been tremendous progress in the physical realization of quantum computing hardware in recent times, bringing us closer than ever before to realizing the promise of quantum computing. However, noise continues to pose a crucial…
Quantum random sampling is the leading proposal for demonstrating a computational advantage of quantum computers over classical computers. Recently, first large-scale implementations of quantum random sampling have arguably surpassed the…
We describe a methodology and standard of proof for experimental claims of quantum random number generation (QRNG), analogous to well-established methods from precision measurement. For appropriately constructed physical implementations,…
Neutral atom quantum processors provide a viable route to scalable quantum computing, with recent demonstrations of high-fidelity and parallel gate operations and initial implementation of quantum algorithms using both physical and logical…
We discuss the current state of the art of Quantum Random Number Generators (QRNG) and their possible applications in the search for quantum advantages. To this aim, we first discuss a possible way of benchmarking QRNG by applying them to…
Near term quantum computers with a high quantity (around 50) and quality (around 0.995 fidelity for two-qubit gates) of qubits will approximately sample from certain probability distributions beyond the capabilities of known classical…
It is believed that random quantum circuits are difficult to simulate classically. These have been used to demonstrate quantum supremacy: the execution of a computational task on a quantum computer that is infeasible for any classical…
Quantum error correcting (QEC) stabilizer codes enable protection of quantum information against errors during storage and processing. Simulation of noisy QEC codes is used to identify the noise parameters necessary for advantageous…
Quantum random number generators (QRNGs) use the inherent unpredictability of quantum mechanics to generate true randomness, as opposed to classical random number generators. However, ensuring the authenticity of this randomness still…
Realistic simulation of quantum materials is a central goal of quantum computation. Although quantum processors have advanced rapidly in scale and fidelity, it has remained unclear whether pre-fault-tolerant devices can perform…
Quantum computers promise to enhance machine learning for practical applications. Quantum machine learning for real-world data has to handle extensive amounts of high-dimensional data. However, conventional methods for measuring quantum…
A novel family of Cosine series Quantum Sampling (QCoSamp) operators appropriate for quantum computing is described. The development of quantum algorithms, analogous to classical algorithms, we apply to the harmonic analysis of signals. We…
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 information processors promise fast algorithms for problems inaccessible to classical computers. But since qubits are noisy and error-prone, they will depend on fault-tolerant quantum error correction (FTQEC) to compute reliably.…