Unbiased observable estimation with approximate channels in fault-tolerant quantum computation

Abstract

Unitary errors, such as those arising from fault-tolerant compilation of quantum algorithms, systematically bias observable estimates. Correcting this bias typically requires additional resources, such as an increased number of non-Clifford gates. In this work, we present an alternative method for correcting bias in the expectation values of observables. The method leverages a decomposition of the ideal quantum channel into a probabilistic mixture of noisy quantum channels. Using this decomposition, we construct unbiased estimators as weighted sums of expectation values obtained from the noisy channels. We provide a detailed analysis of the method, identify the conditions under which it is effective, and validate its performance through numerical simulations. In particular, we demonstrate unbiased observable estimation in the presence of unitary errors by simulating the time dynamics of the Ising Hamiltonian. Our strategy offers a resource-efficient way to reduce the impact of unitary errors, improving methods for estimating observables in noisy near-term quantum devices and fault-tolerant implementation of quantum algorithms.

References in corpus (47)

• Mixed State Entanglement and Quantum Error Correction
• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Good Quantum Error-Correcting Codes Exist
• Noisy intermediate-scale quantum (NISQ) algorithms
• Error mitigation for short-depth quantum circuits
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Logical quantum processor based on reconfigurable atom arrays
• Evaluating analytic gradients on quantum hardware
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Reliable Quantum Computers
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Quantum Error Mitigation
• Maintaining coherence in Quantum Computers
• Quantum Natural Gradient
• qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
• A Race Track Trapped-Ion Quantum Processor
• Resilient Quantum Computation: Error Models and Thresholds
• Quantum Low-Density Parity-Check Codes
• Single ion-qubit exceeding one hour coherence time
• Symmetrised Characterisation of Noisy Quantum Processes
• Efficient and Noise Resilient Measurements for Quantum Chemistry on Near-Term Quantum Computers
• Arbitrarily accurate composite pulses
• Stochastic gradient descent for hybrid quantum-classical optimization
• Efficient fault-tolerant quantum computing
• Correcting coherent errors with surface codes
• Comparing Experiments to the Fault-Tolerance Threshold
• Measurement reduction in variational quantum algorithms
• Early Fault-Tolerant Quantum Computing
• Performance of quantum error correction with coherent errors
• Coherence in quantum error-correcting codes
• A Feasible Approach for Automatically Differentiable Unitary Coupled-Cluster on Quantum Computers
• Modeling coherent errors in quantum error correction
• Mitigating Coherent Noise Using Pauli Conjugation
• Analytic gradients in variational quantum algorithms: Algebraic extensions of the parameter-shift rule to general unitary transformations
• Quantum Analytic Descent
• Comparison of a quantum error correction threshold for exact and approximate errors
• Natural Evolutionary Strategies for Variational Quantum Computation
• Optimal arbitrarily accurate composite pulse sequences
• Hidden Inverses: Coherent Error Cancellation at the Circuit Level
• Shorter quantum circuits via single-qubit gate approximation
• Probabilistic Interpolation of Quantum Rotation Angles
• Information flow in parameterized quantum circuits
• Hamiltonian-based graph-state ansatz for variational quantum algorithms
• Leveraging commuting groups for an efficient variational Hamiltonian ansatz
• Stabilizer configuration interaction: Finding molecular subspaces with error detection properties