Related papers: Magic State Distillation at Intermediate Size

Quantum key distribution (QKD) achieves information-theoretic security, without relying on computational assumptions, by distributing quantum states. To establish secret bits, two honest parties exploit key distillation protocols over…

We present optimized distillation schemes for preparing Greenberger-Horne-Zeilinger (GHZ) states. Our approach relies on training variational quantum circuits with white noise affected GHZ states as inputs. Optimizing for a single iteration…

We present a new asymptotic bipartite entanglement distillation protocol that outperforms all existing asymptotic schemes. This protocol is based on the breeding protocol with the incorporation of two-way classical communication. Like…

For certain quantum architectures and algorithms, most of the required resources are consumed during the distillation of one-qubit magic states for use in performing Toffoli gates. I show that the overhead for magic-state distillation can…

Intermediate states are known from intercept/resend eavesdropping in the BB84 quantum cryptographic protocol. But they also play fundamental roles in the optimal eavesdropping strategy on BB84 and in the CHSH inequality. We generalize the…

Near-term and early fault-tolerant quantum computing architectures are expected to exhibit highly non-uniform error rates. In particular, local operations within a chip can be substantially more reliable than operations connecting different…

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 experimentally demonstrate optimal entanglement distillation from two forms of two-qubit mixed states under local filtering operations according to the constructive method intruduced by F. Verstraete et al. [Phys. Rev. A 64, 010101(R)…

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…

Identifying necessary and sufficient conditions for universal quantum computing is a long-standing open problem for which contextuality is, perhaps, the only promising solution [Howard et al., Nature 510, 351 (2014)]. To justify this…

Magic is a non-classical resource whose efficient manipulation is fundamental to advancing efficient and scalable fault-tolerant quantum computing. Quantum advantage is possible only if both magic and entanglement are present. Of particular…

The security of finite-length keys is essential for the implementation of device-independent quantum key distribution (DIQKD). Presently, there are several finite-size DIQKD security proofs, but they are mostly focused on standard DIQKD…

Universal source coding at short blocklengths is considered for an exponential family of distributions. The \emph{Type Size} code has previously been shown to be optimal up to the third-order rate for universal compression of all memoryless…

We investigate the issue of assisted coherence distillation in the asymptotic limit (considering infinite copies of the resource states), by coordinately performing the identical local operations on the auxiliary systems of each copy. When…

Some of the asymmetric three qubit $W$ states are used for perfect teleportation, superdense coding and quantum information splitting. We present the protocols for the optimal distillation of the asymmetric as well as the symmetric $W$…

We propose a wide class of distillation schemes for multi-partite entangled states that are CSS-states. Our proposal provides not only superior efficiency, but also new insights on the connection between CSS-states and bipartite graph…

With the successful demonstration of transversal CNOTs in many recent experiments, it is the right moment to examine its implications on one of the most critical parts of fault-tolerant computation -- magic state preparation. Using an…

In many architectures for fault tolerant quantum computing universality is achieved by a combination of Clifford group unitary operators and preparation of suitable nonstabilizer states, the so-called magic states. Universality is possible…

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…

Mitigating errors in quantum information processing devices is especially important in the absence of fault tolerance. An effective method in suppressing state-preparation errors is using multiple copies to distill the ideal component from…