Noise tailoring for scalable quantum computation via randomized compiling

  title={Noise tailoring for scalable quantum computation via randomized compiling},
  author={Joel J. Wallman and Joseph Emerson},
  journal={Physical Review A},
Quantum computers are poised to radically outperform their classical counterparts by manipulating coherent quantum systems. A realistic quantum computer will experience errors due to the environment and imperfect control. When these errors are even partially coherent, they present a major obstacle to performing robust computations. Here, we propose a method for introducing independent random single-qubit gates into the logical circuit in such a way that the effective logical circuit remains… 

Figures from this paper

Noise tailoring for quantum circuits via unitary 2t-design
This work proposes a method whereby the twirled noise over a unitary 2t-design (a set of unitary matrices that approximate the entire unitary group) for quantum circuits can be tailored into stochastic noise, which is an important guarantee for achieving fault-tolerant quantum computation.
Efficiently improving the performance of noisy quantum computers
Using near-term quantum computers to achieve a quantum advantage requires efficient strategies to improve the performance of the noisy quantum devices presently available. We develop and experimentally
Scalable error mitigation for noisy quantum circuits produces competitive expectation values
Noise in existing quantum processors only enables an approximation to ideal quantum computation. However, these approximations can be vastly improved by error mitigation [1, 2], for the computation
Benchmarking near-term quantum computers via random circuit sampling
An algorithm is developed that can sample-efficiently estimate the total amount of noise induced by a layer of arbitrary non-Clifford gates, including all crosstalks, and experimentally demonstrate the method on IBM Quantum hardware.
Efficiently computing logical noise in quantum error-correcting codes
Quantum error correction protocols have been developed to offset the high sensitivity to noise inherent in quantum systems. However, much is still unknown about the behaviour of a quantum
Error mitigation extends the computational reach of a noisy quantum processor
This work applies the error mitigation protocol to mitigate errors in canonical single- and two-qubit experiments and extends its application to the variational optimization of Hamiltonians for quantum chemistry and magnetism.
Efficient learning of quantum noise
The results pave the way for noise metrology in next-generation quantum devices, calibration in the presence of crosstalk, bespoke quantum error-correcting codes 10 and customized fault-tolerance protocols 11 that can greatly reduce the overhead in a quantum computation.
Characterizing large-scale quantum computers via cycle benchmarking
Quantum computers promise to solve certain problems more efficiently than their digital counterparts. A major challenge towards practically useful quantum computing is characterizing and reducing the
Coherence in logical quantum channels
This work shows that for the toric code subject to such independent coherent noise, and for minimal-weight decoding, the logical channel after error correction becomes increasingly incoherent as the length of the code increases, provided the noise strength decays inversely with the code distance.
Establishing trust in quantum computations
The technique converts the algorithm’s quantum circuits into a set of closely related circuits whose success rates can be e ffi ciently measured and enables measuring thedelity of quantum algorithm executions both in the near-term, with algorithms run on hundreds or thousands of physical qubits, and into the future, with algorithm run on logical qubits protected by quantum error correction.


Randomized Benchmarking of Quantum Gates
A key requirement for scalable quantum computing is that elementary quantum gates can be implemented with sufficiently low error. One method for determining the error behavior of a gate
Quantum computing with realistically noisy devices
  • E. Knill
  • Computer Science, Physics
  • 2005
This work reports a simple architecture for fault-tolerant quantum computing, providing evidence that accurate quantum computing is possible for EPGs as high as three per cent, and shows that non-trivial quantum computations at EPG’s of as low as one per cent could be implemented.
Bounding quantum gate error rate based on reported average fidelity
Remarkable experimental advances in quantum computing are exemplified by recent announcements of impressive average gate fidelities exceeding 99.9% for single-qubit gates and 99% for two-qubit gates.
Universal quantum computation with ideal Clifford gates and noisy ancillas (14 pages)
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>, and qubit measurement in the computational basis.
Fault-Tolerant Quantum Computation with Constant Error Rate
This paper provides a self-contained and complete proof of universal fault-tolerant quantum computation in the presence of local noise, and shows that local noise is in principle not an obstacle for scalable quantum computation.
Scalable and robust randomized benchmarking of quantum processes.
It is proved that the protocol provides an efficient and reliable estimate of the average error-rate for a set operations (gates) under a very general noise model that allows for both time and gate-dependent errors.
Quantum error correction of coherent errors by randomization
This Pauli-Random-Error-Correction (PAREC)-method eliminates coherent errors produced by static imperfections and increases significantly the maximum time over which realistic quantum computations can be performed reliably.
Scalable noise estimation with random unitary operators
While the scalability of the stochastic protocol makes it most relevant in large Hilbert spaces (when quantum process tomography is infeasible), the method should be immediately useful for evaluating the degree of control that is achievable in any prototype quantum processing device.
Characterizing Quantum Gates via Randomized Benchmarking
This work describes and expands upon the scalable randomized benchmarking protocol proposed in Phys.
Restrictions on transversal encoded quantum gate sets.
It is shown that the ability of a quantum code to detect an arbitrary error on any single physical subsystem is incompatible with the existence of a universal, transversal encoded gate set for the code.