Related papers: Near-term $n$ to $k$ distillation protocols using …

We show that the analysis of entanglement distillation protocols for qudits of arbitrary dimension $D$ benefits from applying basic concepts from number theory, since the set $\zdn$ associated to Bell diagonal states is a module rather than…

Accurate ground-state calculations on noisy quantum computers are fundamentally limited by restricted ansatz expressivity and unavoidable hardware errors. We introduce a hybrid-quantum classical framework that simultaneously addresses these…

Modeling and simulation is essential for predicting and verifying the behavior of fabricated quantum circuits, but existing simulation methods are either impractically costly or require an unrealistic simplification of error processes. We…

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…

Via nonlocality distillation, a number of copies of a given nonlocal correlation can be turned into a new correlation displaying a higher degree of nonlocality. Apart from its clear relevance in situations where nonlocality is a resource,…

Entanglement distillation, a fundamental building block of quantum networks, enables the purification of noisy entangled states shared among distant nodes by local operations and classical communication. Its practical realization presents…

Fault-tolerant quantum computing hinges on efficient logical compilation, in particular, translating high-level circuits into code-compatible implementations. Gate-by-gate compilation often yields deep circuits, requiring significant…

Current quantum computing hardware is restricted by the availability of only few, noisy qubits which limits the investigation of larger, more complex molecules in quantum chemistry calculations on quantum computers in the near-term. In this…

To implement quantum algorithms on a quantum computer, we must overcome the twin problems of fault-tolerance -- how can we realize a relatively noiseless computation by cleverly combining noisy components? -- and compilation -- how can we…

We show -- both theoretically and experimentally -- that Einstein-Podolsky-Rosen steering can be distilled. We present a distillation protocol that outputs a perfectly correlated system -- the singlet assemblage -- in the asymptotic…

Implementing algorithms on a fault-tolerant quantum computer will require fast decoding throughput and latency times to prevent an exponential increase in buffer times between the applications of gates. In this work we begin by quantifying…

We provide a purely quantum version of polar codes, achieving the symmetric coherent information of any qubit-input quantum channel. Our scheme relies on a recursive channel combining and splitting construction, where a two-qubit gate…

The Pauli-based Circuit Optimization, Analysis and Synthesis Toolchain (PCOAST) was recently introduced as a framework for optimizing quantum circuits. It converts a quantum circuit to a Pauli-based graph representation and provides a set…

The design and optimization of a large-scale fault-tolerant quantum computer architecture relies extensively on numerical simulations to assess the performance of each component of the architecture. The simulation of fault-tolerant gadgets,…

Realizing secure communication between distant parties is one of quantum technology's main goals. Although quantum key distribution promises information-theoretic security for sharing a secret key, the key rate heavily depends on the level…

With the advent of practical quantum communication networks drawing closer, there is a growing need for reliable estimation protocols that can efficiently characterize quantum resources with minimum resource overhead requirement. A novel…

Fourier states are multi-qubit registers that facilitate phase rotations in fault-tolerant quantum computing. We propose distillation protocols for constructing the fundamental, $n$-qubit Fourier state with error $O(2^{-n})$ at a cost of…

We consider the possibility of adding noise to a quantum circuit to make it efficiently simulatable classically. In previous works this approach has been used to derive upper bounds to fault tolerance thresholds - usually by identifying a…

Noise and errors are unavoidable in any realistic quantum process, including processes designed to reduce noise and errors in the first place. In particular, quantum thermodynamical protocols for cooling can be significantly affected,…

Scalable realisation of quantum computing is reliant on the development of fault tolerant devices. Analysis of quantum error correction protocols typically considers incoherent noise models or noise-free syndrome measurements. While this is…