Related papers: Stability Verification of Quantum non-i.i.d. sourc…
Algorithmic stability is a concept from learning theory that expresses the degree to which changes to the input data (e.g., removal of a single data point) may affect the outputs of a regression algorithm. Knowing an algorithm's stability…
Under multiplicative drift and other regularity conditions, it is established that the asymptotic variance associated with a particle filter approximation of the prediction filter is bounded uniformly in time, and the nonasymptotic,…
A central problem in quantum information is to determine the minimal physical resources that are required for quantum computational speedup and, in particular, for fault-tolerant quantum computation. We establish a remarkable connection…
The presence of noise is the primary challenge in realizing fault-tolerant quantum computers. In this work, we introduce and experimentally validate a novel strategy to circumvent noise by exploiting the phenomenon of metastability, where a…
Measurement-device-independent quantum key distribution (MDI-QKD), which is immune to all detector side-channel attacks, is the most promising solution to the security issues in practical quantum key distribution systems. Though several…
Quantum state purification is the functionality that, given multiple copies of an unknown state, outputs a state with increased purity. This will be an essential building block for near- and middle-term quantum ecosystems before the…
To prove the security of quantum key distribution (QKD) protocols, several assumptions have to be imposed on users' devices. From an experimental point of view, it is preferable that such theoretical requirements are feasible and the number…
The quantum variables that can be accessed directly by experiments are described by observables. Therefore, physical parameters can only be evaluated indirectly, via estimations based on experimental measurement results. I show that the…
Quantum state purification is the task of recovering a nearly pure copy of an unknown pure quantum state using multiple noisy copies of the state. This basic task has applications to quantum communication over noisy channels and quantum…
Entanglement lies at the heart of quantum information science, serving as a key resource for quantum communication, computation, and metrology. Consequently, high-precision entangled state preparation and efficient verification are…
We study a two-state quantum system with a non linearity intended to describe interactions with a complex environment, arising through a non local coupling term. We study the stability of particular solutions, obtained as constrained…
We introduce a stability criterion for quantum statistical ensembles describing macroscopic systems. An ensemble is called "stable" when a small number of local measurements cannot significantly modify the probability distribution of the…
Quantum computation has been growing rapidly in both theory and experiments. In particular, quantum computing devices with a large number of qubits have been developed by IBM, Google, IonQ, and others. The current quantum computing devices…
Suppose you receive a sequence of qubits where each qubit is guaranteed to be in one of two pure states, but you do not know what those states are. Your task is to determine the states. This can be viewed as a kind of quantum state learning…
We investigate the stability of continuous-time quantum walks (CTQW) across cycle, complete, star, Erd\H{o}s-R\'enyi, small-world, and scale-free topologies under energy-based intrinsic decoherence, node-based Haken-Strobl noise, and…
The hopes for scalable quantum computing rely on the "threshold theorem": once the error per qubit per gate is below a certain value, the methods of quantum error correction allow indefinitely long quantum computations. The proof is based…
Randomness is intrinsic to quantum mechanics; the outcome of a measurement on a quantum state is a random variable. This feature has been applied to randomness certification, where one party must decide whether the data they receive is…
State-of-the-art noisy intermediate-scale quantum computers require low-complexity techniques for the mitigation of computational errors inflicted by quantum decoherence. Symmetry verification constitutes a class of quantum error mitigation…
Measuring quantum states provides means to generate genuine random numbers. It has been shown that genuine randomness can be obtained even with an uncharacterized quantum source. In this work, we propose a framework that formalizes the idea…
We consider the problem of discriminating two different quantum states in the setting of asymptotically many copies, and determine the optimal strategy that minimizes the total probability of error. This leads to the identification of the…