Open AccessPosted Content
Randomized compiling for scalable quantum computing on a noisy superconducting quantum processor
Akel Hashim,Akel Hashim,Ravi Naik,Ravi Naik,Alexis Morvan,Alexis Morvan,Jean-Loup Ville,Bradley Mitchell,Bradley Mitchell,John Mark Kreikebaum,John Mark Kreikebaum,Marc Davis,Ethan Smith,Costin Iancu,Kevin O'Brien,Ian Hincks,Joel J. Wallman,Joseph Emerson,Irfan Siddiqi,Irfan Siddiqi +19 more
TL;DR: This work demonstrates 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, and accurately predicts algorithm performance using experimentally-measured error rates.
read more
Abstract: 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 which 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
The randomized measurement toolbox
Andreas Elben,Steven T. Flammia,Hsin-Yuan Huang,Richard Kueng,John Preskill,Benoît Vermersch,Peter Zoller +6 more
TL;DR: In this article , the authors present protocols for probing the properties of complex many-qubit systems using measurement schemes that are practical using today's quantum platforms, such as programmable quantum simulators and quantum computers.
272
SupermarQ: A Scalable Quantum Benchmark Suite
Teague Tomesh,Pranav Gokhale,V. Omole,Gokul Subramanian Ravi,Kaitlin Smith,Joshua Viszlai,Xin-Chuan Wu,Nikos Hardavellas,Margaret Martonosi,Frederic T. Chong +9 more
- 22 Feb 2022
TL;DR: SupermarQ is the first attempt to systematically apply techniques from classical benchmarking methodology to the quantum domain, and envision that quantum benchmarking will encompass a large cross-community effort built on open source, constantly evolving benchmark suites.
75
Orbital-optimized pair-correlated electron simulations on trapped-ion quantum computers
Luning Zhao,Joshua J. Goings,Kyujin Shin,Woomin Kyoung,Johanna I. Fuks,Young Min Rhee,Kenneth Wright,Jason H. V. Nguyen,Jungsang Kim,Sonika Johri +9 more
TL;DR: In this paper , an orbital-optimized pair-correlated approximation to the unitary coupled cluster with singles and doubles (uCCSD) ansatz was proposed for trapped-ion architectures.
Fast logic with slow qubits: microwave-activated controlled-Z gate on low-frequency fluxoniums
Quentin Ficheux,Long Nguyen,Aaron Somoroff,Haonan Xiong,Konstantin Nesterov,Maxim Vavilov,Vladimir Manucharyan +6 more
TL;DR: In this article, the authors demonstrate a controlled-Z gate between capacitively coupled fluxonium qubits with transition frequencies of $72.3~\textrm{MHz} and $136.3
52
Survey on Quantum Circuit Compilation for Noisy Intermediate-Scale Quantum Computers: Artificial Intelligence to Heuristics
Janusz Kusyk,Samah Mohamed Saeed,Muharrem Umit Uyar +2 more
- 23 Mar 2021
TL;DR: This article presents artificial intelligence (AI)-based and heuristic-based methods recently reported in the literature that attempt to address quantum circuit compilation challenges, and group them based on underlying techniques that they implement.
References
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
TL;DR: In this paper, the authors considered factoring integers and finding discrete logarithms, two problems that are generally thought to be hard on classical computers and that have been used as the basis of several proposed cryptosystems.
Quantum Computing in the NISQ era and beyond
TL;DR: Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future as mentioned in this paper, which will be useful tools for exploring many-body quantum physics, and may have other useful applications.
Charge-insensitive qubit design derived from the Cooper pair box
Jens Koch,Terri M. Yu,Jay M. Gambetta,Andrew Houck,David Schuster,Johannes Majer,Alexandre Blais,Michel Devoret,Steven Girvin,Robert Schoelkopf +9 more
TL;DR: In this paper, the transmon was proposed to operate in a regime of significantly increased ratio of Josephson energy and charging energy, while maintaining sufficient anharmonicity for selective qubit control.
3.8K
Quantum computations: algorithms and error correction
TL;DR: This book discusses classical models of computations, quantum formalism, symplecto-classical cases, and error correction in the computation process: general principles.
1.6K
Quantum computational advantage using photons
Han-Sen Zhong,Hui Wang,Yu-Hao Deng,Ming-Cheng Chen,Li-Chao Peng,Yi-Han Luo,Jian Qin,Dian Wu,Xing Ding,Yi Hu,Peng Hu,Xiaoyan Yang,Weijun Zhang,Hao Li,Yuxuan Li,Xiao Jiang,Lin Gan,Guangwen Yang,Lixing You,Zhen Wang,Li Li,Nai-Le Liu,Chao-Yang Lu,Jian-Wei Pan +23 more
TL;DR: In this paper, the authors proposed to use quantum computers to perform certain tasks that are believed to be intractable to classical computers, such as Boson sampling, which is considered a strong candidate to demonstrate the capabilities of quantum computers.