Related papers: Magic state distillation with permutation-invarian…

The potential impact of future quantum networks hinges on high-quality quantum entanglement shared between network nodes. Unavoidable real-world imperfections necessitate means to improve remote entanglement by local quantum operations.…

We develop an efficient local operation and classical communication (LOCC) scheme for the distillation of Greenberger-Horne-Zeilinger (GHZ) states from tripartite systems subjected to both coherent and incoherent errors. The proposed method…

We propose a general method for preparing stabilizer states with reduced two-qubit gate count and depth compared to the state of the art. The method starts from a graph state representation of the stabilizer state and iteratively reduces…

We present a general algorithm to achieve local operators which can produce the GHZ state for an arbitrary given three-qubit state. Thus the distillation process of the state can be realized optimally. The algorithm is shown to be…

Entanglement is essential for quantum information processing, but is limited by noise. We address this by developing high-yield entanglement distillation protocols with several advancements. (1) We extend the 2-to-1 recurrence entanglement…

We provide a general formalism to characterize the cryptographic properties of quantum channels in the realistic scenario where the two honest parties employ prepare and measure protocols and the known two-way communication reconciliation…

Entanglement distillation is an essential building block in quantum communication protocols. Here, we study the class of near-term implementable distillation protocols that use bilocal Clifford operations followed by a single round of…

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…

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…

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…

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…

A fundamental problem of fault-tolerant quantum computation with quantum low-density parity-check (qLDPC) codes is the tradeoff between connectivity and universality. It is widely believed that in order to perform native logical…

Transversal gates on quantum error correction codes have been a promising approach for fault-tolerant quantum computing, but are limited by the Eastin-Knill no-go theorem. Existing solutions like gate teleportation and magic state…

The manipulation of quantum "resources" such as entanglement, coherence and magic states lies at the heart of quantum science and technology, empowering potential advantages over classical methods. In practice, a particularly important kind…

We present a fault-tolerant Bell-pair distillation scheme achieving constant overhead through high-rate quantum low-density parity-check (qLDPC) codes. Our approach maintains a constant distillation rate equal to the code rate while…

Importance sampling based on quasi-probability decomposition is the backbone of many widely used techniques, such as error mitigation, circuit knitting, and, more generally, virtual quantum resource distillation, as it allows one to…

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…

We introduce STAR-magic mutation, an efficient protocol for implementing logical rotation gates on early fault-tolerant quantum computers. This protocol judiciously combines two of the latest state preparation protocols: transversal…

There is an ongoing effort to quantify entanglement of quantum pure states for systems with more than two subsystems. We consider three approaches to this problem for three-qubit states: choosing a basis which puts the state into a standard…

Robust quantum computation requires encoding delicate quantum information into degrees of freedom that are hard for the environment to change. Quantum encodings have been demonstrated in many physical systems by observing and correcting…