Related papers: Magic state parity-checker with pre-distilled comp…
Fault-tolerant quantum computing requires a universal gate set, but the necessary non-Clifford gates represent a significant resource cost for most quantum error correction architectures. Magic state cultivation offers an efficient…
We establish lower-bounds on the number of resource states, also known as magic states, needed to perform various quantum computing tasks, treating stabilizer operations as free. Our bounds apply to adaptive computations using measurements…
We consider distillation of entanglement from two qubit states which are mixtures of three mutually orthogonal states: two pure entangled states and one pure product state. We distill entanglement from such states by projecting n copies of…
The relation between Bell inequalities with two two-outcome measurements per site and distillability is analyzed in systems of an arbitrary number of quantum bits. We observe that the violation of any of these inequalities by a quantum…
We complete the task of optimal probabilistic coherence distillation protocol, whose aim is to transform a general state into a set of n-level maximally coherent states via strictly incoherent operations (SIO). Specifically, we present the…
Quantum error mitigation is essential for computing on the noisy quantum computer with a limited number of qubits. In this paper, we propose a practical protocol of error mitigation by virtually purifying the quantum state without qubit…
Measuring the state of quantum computers is a highly non-trivial task, with implications for virtually all quantum algorithms. We propose a novel scheme where identical copies of a quantum state are measured jointly so that all Pauli…
We describe an optimized, self-correcting procedure for the Bayesian inference of pure quantum states. By analyzing the history of measurement outcomes at each step, the procedure returns the most likely pure state, as well as the optimal…
Erasure qubits constitute a promising approach for tackling the daunting resources required for fault-tolerant quantum computing. By heralding erasure errors, both the error-correction threshold and the sub-threshold scaling of the logical…
Fault-tolerant quantum computing requires high-fidelity logical magic states for implementing non-Clifford operations. Magic-state cultivation provides a lower-overhead route to logical magic-state preparation, but its efficiency is limited…
We present the convergence study of a recurrence entanglement purification protocol using arbitrary two-qubit initial states. The protocol is based on a rank two projector in the Bell basis which serves as a two-qubit operation replacing…
Magic state distillation (MSD) is an essential element for universal fault-tolerant quantum computing, which distills a high-fidelity magic state from noisy magic states using ideal (error-corrected) Clifford operations. For ideal Clifford…
We study the task of agnostic tomography: given copies of an unknown $n$-qubit state $\rho$ which has fidelity $\tau$ with some state in a given class $C$, find a state which has fidelity $\ge \tau - \epsilon$ with $\rho$. We give a new…
Quantum magic, quantified by nonstabilizerness, measures departures from stabilizer structure and underlies potential quantum speedups. We introduce an efficient classical framework for computing stabilizer R\'enyi entropies and stabilizer…
We discuss sequential unambiguous state-discrimination measurements performed on the same qubit. Alice prepares a qubit in one of two possible states. The qubit is first sent to Bob, who measures it, and then on to Charlie, who also…
We consider the task of distilling local purity from a noisy quantum state $\rho^{ABC}$, wherein we provide a protocol for three parties, Alice, Bob and Charlie, to distill local purity (at a rate $P$) from many independent copies of a…
We prove that magic states from the Clifford hierarchy give optimal solutions for tasks involving nonlocality and entropic uncertainty with respect to Pauli measurements. For both the nonlocality and uncertainty tasks, stabilizer states are…
We show that using qutrits rather than qubits leads to a substantial reduction in the overhead cost associated with an approach to fault-tolerant quantum computing known as magic state distillation. We construct a family of $[[9m-k, k,…
Magic describes the distance of a quantum state to its closest stabilizer state. It is -- like entanglement -- a necessary resource for a potential quantum advantage over classical computing. We study magic, quantified by stabilizer…
The stabilization of a quantum computer by repeated error correction can be reduced almost entirely to repeated preparation of blocks of qubits in quantum codeword states. These are multi-particle entangled states with a high degree of…