Related papers: Certified randomness amplification by dynamically …
Self-testing and Semi-Device Independent protocols are becoming the preferred choice for quantum technologies, being able to certify their quantum nature with few assumptions and simple experimental implementations. In particular for…
Quantum mechanics provides means of generating genuine randomness that is impossible with deterministic classical processes. Remarkably, the unpredictability of randomness can be certified in a self-testing manner that is independent of…
Quantum mechanics predicts the existence of intrinsically random processes. Contrary to classical randomness, this lack of predictability can not be attributed to ignorance or lack of control. Here we find the optimal method to quantify the…
We introduce probability estimation, a broadly applicable framework to certify randomness in a finite sequence of measurement results without assuming that these results are independent and identically distributed. Probability estimation…
Quantum entanglement represents an ideal resource to guarantee the security of random numbers employed in many scientific and cryptographic applications. However, entanglement-based certified random number generators are particularly…
Quantum random number generators (QRNGs) promise perfectly unpredictable random numbers. However, the security certification of the random numbers in form of a stochastic model often introduces assumptions that are either hardly justified…
Overcoming the influence of noise and imperfections in quantum devices is one of the main challenges for viable quantum applications. In this article, we present different protocols, which we denote as "superposed quantum error mitigation",…
We introduce a single-number metric, quantum volume, that can be measured using a concrete protocol on near-term quantum computers of modest size ($n\lesssim 50$), and measure it on several state-of-the-art transmon devices, finding values…
The success of quantum circuits in providing reliable outcomes for a given problem depends on the gate count and depth in near-term noisy quantum computers. Quantum circuit compilers that decompose high-level gates to native gates of the…
We employ quantum state discrimination theory to establish the ultimate limit for spoofing detection in electromagnetic signals encoded with random quantum states. Our analysis yields an analytical expression for the optimal bound, which we…
We investigate sampling procedures that certify that an arbitrary quantum state on $n$ subsystems is close to an ideal mixed state $\varphi^{\otimes n}$ for a given reference state $\varphi$, up to errors on a few positions. This task makes…
The accurate implementation of quantum gates is essential for the realisation of quantum algorithms and digital quantum simulations. This accuracy may be increased on noisy hardware through the variational optimisation of gates, however the…
Quantum communication with systems of dimension larger than two provides advantages in information processing tasks. Examples include higher rates of key distribution and random number generation. The main disadvantage of using such…
One of the main challenges in building a quantum processor is to characterize the environmental noise. Noise characterization can be achieved by exploiting different techniques, such as randomization where several sequences of random…
Randomness is a central feature of quantum mechanics and an invaluable resource for both classical and quantum technologies. Commonly, in Device-Independent and Semi-Device-Independent scenarios, randomness is certified using projective…
Randomness amplification is the task of transforming a source of somewhat random bits into a source of fully random bits. Although it is impossible to amplify randomness from a single source by classical means, the situation is different…
It is imperative that useful quantum computers be very difficult to simulate classically; otherwise classical computers could be used for the applications envisioned for the quantum ones. Perfect quantum computers are unarguably…
The unpredictability of random numbers is fundamental to both digital security and applications that fairly distribute resources. However, existing random number generators have limitations-the generation processes cannot be fully traced,…
Ultrafast physical random bit generation at hundreds of Gb/s rates, with verified randomness, is a crucial ingredient in secure communication and have recently emerged using optics based physical systems. Here we examine the inverse problem…
Randomness is a very important resource for cryptography, algorithms, and scientific simulations. Since all classical processes are considered to be intrinsically deterministic, we must build quantum random number generators which utilize…