Related papers: Bound States for Magic State Distillation in Fault…
The standard approach to fault-tolerant quantum computation is to store information in a quantum error correction code, such as the surface code, and process information using a strategy that can be summarized as distill-then-synthesize. In…
We propose a scheme of multipartite entanglement distillation driven by a complementary pair of stabilizer measurements, to distill directly a wider range of states beyond the stabilizer code states (such as the Greenberger-Horne-Zeilinger…
We consider entanglement distillation from a single-copy of a multipartite state, and instead of rates we analyze the "quality" of the distilled entanglement. This "quality" is quantified by the fidelity with the GHZ-state. We show that…
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…
It is well known that any entangled mixed state in $2\otimes 2$ systems can be purified via infinite copies of the mixed state. But can one distill a pure maximally entangled state from finite copies of a mixed state in any bipartite system…
Magic state distillation plays a crucial role in fault-tolerant quantum computation and represents a major bottleneck. In contrast to traditional logical-level distillation, physical-level distillation offers significant overhead reduction…
Magic (non-stabilizerness) is a necessary but "expensive" kind of "fuel" to drive universal fault-tolerant quantum computation. To properly study and characterize the origin of quantum "complexity" in computation as well as physics, it is…
We study the process of assisted work distillation. This scenario arises when two parties share a bipartite quantum state $\rho_{AB}$ and their task is to locally distil the optimal amount of work when one party is restricted to thermal…
Methods for distilling maximally entangled tripartite (GHZ) states from arbitrary entangled tripartite pure states are described. These techniques work for virtually any input state. Each technique has two stages which we call primary and…
We present a set of Bell inequalities which are sufficient and necessary for separability of general pure multipartite quantum states in arbitrary dimensions. The relations between Bell inequalities and distillability are also studied. We…
No pure entangled state can be distilled from a $2\otimes 2$ or $2\otimes 3$ mixed state by separable operations. In $3\otimes 3$, pure entanglement can be distilled by separable operation but not by LOCC. In this letter, we proved the…
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…
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…
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…
We show that, in a multi-party setting, two non-distillable (bound-entangled) states tensored together can make a distillable state. This is an example of true superadditivity of distillable entanglement. We also show that unlockable…
Finding ways to quantify magic is an important problem in quantum information theory. Recently Leone, Oliviero and Hamma introduced a class of magic measures for qubits, the stabilizer entropies of order $\alpha$, to aid in studying…
Criteria for distillability, and the property of having a positive partial transpose, are introduced for states of general bipartite quantum systems. The framework is sufficiently general to include systems with an infinite number of…
The surface code family is a promising approach to implementing fault-tolerant quantum computations. Universal fault-tolerance requires error-corrected non-Clifford operations, in addition to Clifford gates, and for the former, it is…
We study the relation between distillability of multipartite states and violation of Bell's inequality. We prove that there exist multipartite bound entangled states (i.e. non-separable, non-distillable states) that violate a multipartite…
High-fidelity logical magic states are a critical resource for fault-tolerant quantum computation, enabling non-Clifford logical operations through state injection. However, benchmarking these states presents significant challenges: one…