Related papers: Bounding experimental quantum error rates relative…
The success probability of a quantum algorithm constructed from noisy quantum gates cannot be accurately predicted from single parameter metrics that compare noisy and ideal gates. We illustrate this concept by examining a system with…
To exploit a given physical system for quantum information processing, it is critical to understand the different types of noise affecting quantum control. Distinguishing coherent and incoherent errors is extremely useful as they can be…
I discuss a variety of issues relating to near-future experiments demonstrating fault-tolerant quantum computation. I describe a family of fault-tolerant quantum circuits that can be performed with 5 qubits arranged on a ring with…
Proving threshold theorems for fault-tolerant quantum computation is a burdensome endeavor with many moving parts that come together in relatively formulaic but lengthy ways. It is difficult and rare to combine elements from multiple papers…
Correcting errors is a vital but expensive component of fault tolerant quantum computation. Standard fault tolerant protocol assumes the implementation of error correction, via syndrome measurements and possible recovery operations, after…
Quantum readout error mitigation is essential for noisy intermediate-scale quantum devices to achieve reliable data. The conventional approaches, conflating initialization errors with measurement errors, not only suppress the influence of…
The hopes for scalable quantum computing rely on the "threshold theorem": once the error per qubit per gate is below a certain value, the methods of quantum error correction allow indefinitely long quantum computations. The proof is based…
In the distributed quantum computing paradigm, well-controlled few-qubit `nodes' are networked together by connections which are relatively noisy and failure prone. A practical scheme must offer high tolerance to errors while requiring only…
We analyse a model for fault-tolerant quantum computation with low overhead suitable for situations where the noise is biased. The basis for this scheme is a gadget for the fault-tolerant preparation of magic states that enable universal…
A Quantum Computer is a new type of computer which can solve problems such as factoring and database search very efficiently. The usefulness of a quantum computer is limited by the effect of two different types of errors, decoherence and…
We analyze the average fidelity (say, F) and the fidelity deviation (say, D) in noisy-channel quantum teleportation. Here, F represents how well teleportation is performed on average and D quantifies whether the teleportation is performed…
Quantum computation is a topic of significant recent interest, with practical advances coming from both research and industry. A major challenge in quantum programming is dealing with errors (quantum noise) during execution. Because quantum…
Quantum gates and measurements on quantum hardware are inevitably subject to hardware imperfections that lead to quantum errors. Mitigating such unavoidable errors is crucial to explore the power of quantum hardware better. In this paper,…
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…
Surface codes are promising for practical quantum error correction due to their high threshold and experimental feasibility. However, their performance under realistic noise conditions, particularly those involving correlated errors,…
Quantum fluctuations yield inevitable noises in quantum detection. We derive an upper bound of signal to noise ratio for arbitrary quantum detection described by trace-class operators with discrete spectra. The bound is independent of…
Benchmarking of noise that is induced during the implementation of quantum gates is the main concern for practical quantum computers. Several protocols have been proposed that empirically calculate various metrics that quantify the error…
The constituent parts of a quantum computer are inherently vulnerable to errors. To this end we have developed quantum error-correcting codes to protect quantum information from noise. However, discovering codes that are capable of a…
The fidelity of quantum operations is often limited by incoherent errors, which typically can be modeled by fundamental Markovian noise processes such as amplitude damping and dephasing. In Phys. Rev. Lett. 129, 150504 (2022;…
Qubit loss and gate failure are significant obstacles for the implementation of scalable quantum computation. Recently there have been several proposals for overcoming these problems, including schemes based on parity and cluster states.…