Experimentally scalable protocol for identification of correctable codes

Abstract

The task of finding a correctable encoding that protects against some physical quantum process is in general hard. Two main obstacles are that an exponential number of experiments are needed to gain complete information about the quantum process, and known algorithmic methods for finding correctable encodings involve operations on exponentially large matrices. However, we show that in some cases it is possible to find such encodings with only partial information about the quantum process. Such useful partial information can be systematically extracted by averaging the channel under the action of a set of unitaries in a process known as "twirling". In this paper we prove that correctable encodings for a twirled channel are also correctable for the original channel. We investigate the particular case of twirling over the set of Pauli operators and qubit permutations, and show that the resulting quantum operation can be characterized experimentally in a scalable manner. We also provide a postprocessing scheme for finding unitarily correctable codes for these twirled channels which does not involve exponentially large matrices.

4 pages, no figures. Submitted version

References in corpus (6)

• Symmetrised Characterisation of Noisy Quantum Processes
• Optimum Quantum Error Recovery using Semidefinite Programming
• Robust Quantum Error Correction via Convex Optimization
• Direct Characterization of Quantum Dynamics: General Theory
• Quantum Error Correcting Subsystems are Unitarily Recoverable Subsystems
• Approximate quantum error correction, random codes, and quantum channel capacity

Cited by in corpus (48)

• Error mitigation for short-depth quantum circuits
• Robust randomized benchmarking of quantum processes
• Characterizing Quantum Gates via Randomized Benchmarking
• Efficient measurement of quantum gate error by interleaved randomized benchmarking
• Low-distance Surface Codes under Realistic Quantum Noise
• Exponential Error Suppression for Near-Term Quantum Devices
• Correcting coherent errors with surface codes
• Robust Extraction of Tomographic Information via Randomized Benchmarking
• Surface code with decoherence: An analysis of three superconducting architectures
• Gate fidelity fluctuations and quantum process invariants
• Modeling quantum noise for efficient testing of fault-tolerant circuits
• Decoding algorithms for surface codes
• Error-Mitigated Simulation of Quantum Many-Body Scars on Quantum Computers with Pulse-Level Control
• qTorch: The Quantum Tensor Contraction Handler
• Selective and Efficient Quantum Process Tomography
• Tractable Simulation of Error Correction with Honest Approximations to Realistic Fault Models
• Progress toward scalable tomography of quantum maps using twirling-based methods and information hierarchies
• Strategies for practical advantage of fault-tolerant circuit design in noisy trapped-ion quantum computers
• Characterization of quantum dynamics using quantum error correction
• The multiplicative domain in quantum error correction
• Surface codes, quantum circuits, and entanglement phases
• Performance of surface codes in realistic quantum hardware
• Single-Shot Quantum Process Tomography
• Optimized measurement-free and fault-tolerant quantum error correction for neutral atoms
• Quantum code for quantum error characterization
• Generalized Multiplicative Domains and Quantum Error Correction
• Parallel quantum trajectories via forking for sampling without redundancy
• Algorithmic Shadow Spectroscopy
• Machine-learning based three-qubit gate for realization of a Toffoli gate with cQED-based transmon systems
• Can shallow quantum circuits scramble local noise into global white noise?
• Non-Pauli errors can be efficiently sampled in qudit surface codes
• Comparing randomized benchmarking figure with average infidelity of quantum gate-set
• What determines the ultimate precision of a quantum computer?
• Robust gates with spin-locked superconducting qubits
• Robust Finite-Temperature Many-Body Scarring on a Quantum Computer
• Experimental demonstration of Pauli-frame randomization on a superconducting qubit
• Recovery With Incomplete Knowledge: Fundamental Bounds on Real-Time Quantum Memories
• Experimentally efficient methods for estimating the performance of quantum measurements
• Statistical mechanical mapping and maximum-likelihood thresholds for the surface code under generic single-qubit coherent errors
• Decoherence and Quantum Error Correction for Quantum Computing and Communications
• Accurate and Honest Approximation of Correlated Qubit Noise
• The two-qubit amplitude damping channel: characterization using quantum stabilizer codes
• Error Correction for Reliable Quantum Computing
• Space-time tradeoff in networked virtual distillation
• The superadditivity effects of quantum capacity decrease with the dimension for qudit depolarizing channels
• Error metric for non-trace-preserving quantum operations
• Phase Estimation with Compressed Controlled Time Evolution
• The Vector representation of the Standard Quantum Process Tomography