Efficient error characterization in Quantum Information Processing

Abstract

We describe how to use the fidelity decay as a tool to characterize the errors affecting a quantum information processor through a noise generator $G_{\tau }$. For weak noise, the initial decay rate of the fidelity proves to be a simple way to measure the magnitude of the different terms in $G_{\tau }$. When the generator has only terms associated with few-body couplings, our proposal is scalable. We present the explicit protocol for estimating the magnitude of the noise generators when the noise consists of only one and two-body terms, and describe a method for measuring the parameters of more general noise models. The protocol focuses on obtaining the magnitude with which these terms affect the system during a time step of length $\tau$; measurement of this information has critical implications for assesing the scalability of fault-tolerant quantum computation in any physical setup.

11 pages, 9 figures

References in corpus (2)

• Quantum chaos and random matrix theoryfor fidelity decay in quantum computationswith static imperfections
• A quantitative model for the effective decoherence of a quantum computer with imperfect unitary operations

Cited by in corpus (46)

• Randomized Benchmarking of Quantum Gates
• Robust randomized benchmarking of quantum processes
• Characterizing Quantum Gates via Randomized Benchmarking
• Efficient measurement of quantum gate error by interleaved randomized benchmarking
• Quantum certification and benchmarking
• Symmetrised Characterisation of Noisy Quantum Processes
• Gate Set Tomography
• Quantum Computing with NMR
• Theory of quantum system certification: a tutorial
• A general framework for randomized benchmarking
• Detection of quantum critical points by a probe qubit
• Randomized benchmarking of single and multi-qubit control in liquid-state NMR quantum information processing
• Randomized benchmarking with gate-dependent noise
• The effect of noise correlations on randomized benchmarking
• Efficient estimation of nearly sparse many-body quantum Hamiltonians
• Recovering quantum gates from few average gate fidelities
• Real Randomized Benchmarking
• Parameters of Pseudo-Random Quantum Circuits
• Readout Of Singlet-Triplet Qubits At Large Magnetic Field Gradients
• From randomized benchmarking experiments to gateset circuit fidelity: how to interpret randomized benchmarking decay parameters
• Approximate Randomized Benchmarking for Finite Groups
• Randomized benchmarking for non-Markovian noise
• Efficient verification of quantum processes
• Progress toward scalable tomography of quantum maps using twirling-based methods and information hierarchies
• Estimating gate-set properties from random sequences
• Equation of motion for process matrix: Hamiltonian identification and dynamical control of open quantum systems
• Quantum pseudo-randomness from cluster-state quantum computation
• Randomized Benchmarking under Different Gatesets
• Qibolab: an open-source hybrid quantum operating system
• Randomized Benchmarking as Convolution: Fourier Analysis of Gate Dependent Errors
• Selective and Efficient Quantum State Tomography and its Application to Quantum Process Tomography
• Randomized Benchmarking of Clifford Operators
• Error characterization in Quantum Information Processing: a protocol for analyzing spatial correlations and its experimental implementation
• Towards a general framework of Randomized Benchmarking incorporating non-Markovian Noise
• Linear Cross Entropy Benchmarking with Clifford Circuits
• Randomised benchmarking for characterizing and forecasting correlated processes
• Quantum circuit for three-qubit random states
• Coherent randomized benchmarking
• A framework for randomized benchmarking over compact groups
• Pseudo-Random Circuits from Clifford Plus T-Gates
• Combining $T_1$ and $T_2$ estimation with randomized benchmarking and bounding the diamond distance
• Measurement-based interleaved randomised benchmarking using IBM processors
• Classical certification of quantum gates under the dimension assumption
• Practical Quantum Computing: The value of local computation
• Bosonic randomized benchmarking with passive transformations
• The Vector representation of the Standard Quantum Process Tomography