Related papers: Qutrit Magic State Distillation Tight in Some Dire…
In quantum computing, non-stabilizerness -- the magic -- refers to the computational advantage of certain quantum states over classical computers and is an essential ingredient for universal quantum computation. Employing the second order…
Distilling highly entangled quantum states from weaker ones is a process that is crucial for efficient and long-distance quantum communication, and has implications for several other quantum information protocols. We introduce the notion of…
The overhead exponent -- characterizing the scaling of the number of noisy magic states with respect to the target distillation error -- has been a central quantity to benchmark magic state distillation protocols. On the other hand, a…
Recently it was discovered that non-Gaussian decoherence processes, such as phase-diffusion, can be counteracted by purification and distillation protocols that are solely built on Gaussian operations. Here, we make use of this…
A mixed quantum state shared between two parties is said to be distillable if, by means of a protocol involving only local quantum operations and classical communication, the two parties can transform some number of copies of that state…
It is known that he bipartite quantum states, with rank strictly smaller than the maximum of the ranks of its two reduced states, are distillable by local operations and classical communication. Our first main result is that this is also…
Notions of nonstabilizerness, or "magic", quantify how non-classical quantum states are in a precise sense: states exhibiting low nonstabilizerness preclude quantum advantage. We introduce 'pseudomagic' ensembles of quantum states that,…
It has been conjectured [1] that for any distillation protocol for magic states for the $T$ gate, the number of noisy input magic states required per output magic state at output error rate $\epsilon$ is $\Omega(\log(1/\epsilon))$. We show…
Quantum network states are multipartite states built from distributing pairwise entanglement among parties and underpin the paradigm of quantum networks for quantum information processing. In this work we introduce the problem of partial…
We provide generalizations of known two-qubit entanglement distillation protocols for arbitrary Hilbert space dimensions. The protocols, which are analogues of the hashing and breeding procedures, are adapted to bipartite quantum states…
Entanglement distillation, an essential quantum information processing task, refers to the conversion from multiple copies of noisy entangled states to a smaller number of highly entangled states. In this work, we study the non-asymptotic…
Distillation of entanglement using only Gaussian operations is an important primitive in quantum communication, quantum repeater architectures, and distributed quantum computing. Existing distillation protocols for continuous degrees of…
Quantum coherence in a qubit is vulnerable to environmental noise. When long quantum calculation is run on a quantum processor without error correction, the noise often causes fatal errors and messes up the calculation. Here, we propose…
Distributed quantum computing allows the modular construction of large-scale quantum computers and enables new protocols for blind quantum computation. However, such applications in the large-scale, fault-tolerant regime place stringent…
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 state discrimination plays a central role in defining the possible and impossible operations through a restricted class of quantum operations. A seminal result by Bennett et al. [Phys. Rev. A 59, 1070 (1999)] demonstrates the…
Magic states are essential yet resource-intensive components for realizing universal fault-tolerant quantum computation. Preparing magic states within emerging quantum low-density parity-check (qLDPC) codes poses additional challenges, due…
Fault-tolerant protocols enable large and precise quantum algorithms. Many such protocols rely on a feed-forward processing of data, enabled by a hybrid of quantum and classical logic. Representing the control structure of such programs can…
In the realm of fault-tolerant quantum computing, stabilizer operations play a pivotal role, characterized by their remarkable efficiency in classical simulation. This efficiency sets them apart from non-stabilizer operations within the…
One of the remarkable features of quantum mechanics is the ability to ensure secrecy. Private states embody this effect, as they are precisely those multipartite quantum states from which two parties can produce a shared secret that cannot…