4.7 Article

Randomized Compiling for Scalable Quantum Computing on a Noisy Superconducting Quantum Processor

Journal

PHYSICAL REVIEW X
Volume 11, Issue 4, Pages -

Publisher

AMER PHYSICAL SOC
DOI: 10.1103/PhysRevX.11.041039

Keywords

-

Funding

  1. U.S. Department of Energy, Office of Science, Office of Advanced Scientific Computing Research Quantum Testbed Program [DE-AC02-05CH11231]
  2. U.S. Army Small Business Technology Transfer Program Office
  3. Army Research Office [W911NF-19P-0007]
  4. National Defense Science & Engineering Graduate (NDSEG) Fellowship

Ask authors/readers for more resources

The successful implementation of algorithms on quantum processors requires accurate control of quantum bits, but coherent errors can severely limit performance. Randomized compiling can convert coherent errors into stochastic noise, reducing unpredictable errors and enabling accurate prediction of algorithmic performance. This approach demonstrates significant performance gains and accurately predicts algorithm performance on modern-day noisy quantum processors, paving the way for scalable quantum computing.
The successful implementation of algorithms on quantum processors relies on the accurate control of quantum bits (qubits) to perform logic gate operations. In this era of noisy intermediate-scale quantum (NISQ) computing, systematic miscalibrations, drift, and crosstalk in the control of qubits can lead to a coherent form of error that has no classical analog. Coherent errors severely limit the performance of quantum algorithms in an unpredictable manner, and mitigating their impact is necessary for realizing reliable quantum computations. Moreover, the average error rates measured by randomized benchmarking and related protocols are not sensitive to the full impact of coherent errors and therefore do not reliably predict the global performance of quantum algorithms, leaving us unprepared to validate the accuracy of future large-scale quantum computations. Randomized compiling is a protocol designed to overcome these performance limitations by converting coherent errors into stochastic noise, dramatically reducing unpredictable errors in quantum algorithms and enabling accurate predictions of algorithmic performance from error rates measured via cycle benchmarking. In this work, we demonstrate significant performance gains under randomized compiling for the four-qubit quantum Fourier transform algorithm and for random circuits of variable depth on a superconducting quantum processor. Additionally, we accurately predict algorithm performance using experimentally measured error rates. Our results demonstrate that randomized compiling can be utilized to leverage and predict the capabilities of modern-day noisy quantum processors, paving the way forward for scalable quantum computing.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available