Related papers: MagicPool: Dealing with Magic State Distillation F…
Magic can be distributed non-locally in many-body entangled states, such as the low energy states of condensed matter systems. Using the Bravyi-Kitaev magic state distillation protocol, we find that non-local magic is distillable and can…
Production of quantum states exhibiting a high degree of entanglement out of noisy conditions is one of the main goals of quantum information science. Here, we provide a conditional yet efficient entanglement distillation method which…
We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state $|0\rangle$ computational basis. In addition, we allow the creation of a one-qubit ancilla in a…
Minimizing the time required for quantum state preparation is crucial to mitigate decoherence and enable practical quantum algorithms on near-term hardware. In this work, we introduce a technique for quantum state preparation in…
As quantum computers continue to improve and support larger, more complex computations, smart control hardware and compilers are needed to efficiently leverage the capabilities of these systems. This paper introduces a novel approach to…
In a model of fault-tolerant quantum computation with quick and noiseless polyloglog-time auxiliary classical computation, we construct a fault tolerance protocol with constant-space and $\widetilde{O}(\log N)$-time overhead, where…
Quantum computing promises to solve problems previously deemed infeasible. However, high error rates necessitate quantum error correction for practical applications. Seminal experiments with zoned neutral atom architectures have shown…
Coherence distillation is one of the central problems in the resource theory of coherence. In this Letter, we complete the deterministic distillation of quantum coherence for a finite number of coherent states under strictly incoherent…
Increasing quantum circuit fidelity requires an efficient instruction set to avoid errors from decoherence. The choice of a two-qubit (2Q) hardware basis gate depends on a quantum modulator's native Hamiltonian interactions and applied…
Quantum error mitigation is essential for computing on the noisy quantum computer with a limited number of qubits. In this paper, we propose a practical protocol of error mitigation by virtually purifying the quantum state without qubit…
The remarkable phenomenon of catalyst tells us that adding a catalyst could help state transformation. In this paper, we consider the problem of catalyst-assisted probabilistic coherence distillation for mixed states under strictly…
We evaluate strategies for reducing the run time of fault-tolerant quantum computations, targeting practical utility in scientific or industrial workflows. Delivering a technology with broad impact requires scaling devices, while also…
Fault-tolerant quantum computation relies on the assumption of time-invariant, sufficiently low physical error rates. However, current superconducting quantum computers suffer from frequent disruptive noise events, including cosmic ray…
The dependence of quantum algorithms on state fidelity is difficult to characterize analytically and is best explored experimentally as hardware scales and noisy simulations become intractable. While low fidelity states are often…
Dephasing is a ubiquitous phenomenon that leads to the loss of coherence in quantum systems and the corruption of quantum information. We present a universal dynamical control approach to combat dephasing during all stages of quantum…
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…
Classical optimization algorithms in machine learning often take a long time to compute when applied to a multi-dimensional problem and require a huge amount of CPU and GPU resource. Quantum parallelism has a potential to speed up machine…
Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers and certain physics simulations. Practical…
The degradation of entanglement in quantum memories due to decoherence is a critical challenge for scalable quantum networks. We present an entanglement distillation protocol based on the [[4,2,2]] quantum error-detecting code, deriving…
Magic states are key ingredients in schemes to realize universal fault-tolerant quantum computation. Theories of magic states attempt to quantify this computational element via monotones and determine how these states may be efficiently…