Probabilistic Interpolation of Quantum Rotation Angles

Abstract

Quantum computing requires a universal set of gate operations; regarding gates as rotations, any rotation angle must be possible. However a real device may only be capable of $B$ bits of resolution, i.e. it might support only $2^B$ possible variants of a given physical gate. Naive discretization of an algorithm's gates to the nearest available options causes coherent errors, while decomposing an impermissible gate into several allowed operations increases circuit depth. Conversely, demanding higher $B$ can greatly complexify hardware. Here we explore an alternative: Probabilistic Angle Interpolation (PAI). This effectively implements any desired, continuously parametrised rotation by randomly choosing one of three discretised gate settings and postprocessing individual circuit outputs. The approach is particularly relevant for near-term applications where one would in any case average over many runs of circuit executions to estimate expected values. While PAI increases that sampling cost, we prove that a) the approach is optimal in the sense that PAI achieves the least possible overhead and c) the overhead is remarkably modest even with thousands of parametrised gates and only $7$ bits of resolution available. This is a profound relaxation of engineering requirements for first generation quantum computers where even $5-6$ bits of resolution may suffice and, as we demonstrate, the approach is many orders of magnitude more efficient than prior techniques. Moreover we conclude that, even for more mature late-NISQ hardware, no more than $9$ bits will be necessary.

arXiv comment15 pages, 5 figures -- includes proof of optimality of protocol, generalisation to non-uniform settings etc

References in corpus (36)

• Variational Quantum Algorithms
• Many body localization and thermalization in quantum statistical mechanics
• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum computational chemistry
• Quantum Chemistry in the Age of Quantum Computing
• Error mitigation for short-depth quantum circuits
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Suppressing quantum errors by scaling a surface code logical qubit
• Many-body localization edge in the random-field Heisenberg chain
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Toward the first quantum simulation with quantum speedup
• Practical Quantum Error Mitigation for Near-Future Applications
• Hybrid quantum-classical algorithms and quantum error mitigation
• Universal control of a six-qubit quantum processor in silicon
• A random compiler for fast Hamiltonian simulation
• CMOS-based cryogenic control of silicon quantum circuits
• Probabilistic error cancellation with sparse Pauli-Lindblad models on noisy quantum processors
• Scaling silicon-based quantum computing using CMOS technology: State-of-the-art, Challenges and Perspectives
• Noise suppression using symmetric exchange gates in spin qubits
• High-speed programmable photonic circuits in a cryogenically compatible, visible-NIR 200 mm CMOS architecture
• Cryogenic Trapped-Ion System for Large Scale Quantum Simulation
• Exponential Error Suppression for Near-Term Quantum Devices
• Quantum error mitigation as a universal error-minimization technique: applications from NISQ to FTQC eras
• The impact of classical control electronics on qubit fidelity
• Constructing a virtual two-qubit gate by sampling single-qubit operations
• Unified approach to data-driven quantum error mitigation
• Cryogenic setup for trapped ion quantum computing
• A CMOS dynamic random access architecture for radio-frequency readout of quantum devices
• Quantum Analytic Descent
• Quantum natural gradient generalised to noisy and non-unitary circuits
• Conditional control of donor nuclear spins in silicon using Stark shifts
• QuESTlink -- Mathematica embiggened by a hardware-optimised quantum emulator
• Quantum Error Mitigated Classical Shadows
• Pulse based Variational Quantum Optimal Control for hybrid quantum computing
• Training variational quantum circuits with CoVaR: covariance root finding with classical shadows
• Can shallow quantum circuits scramble local noise into global white noise?

Cited by in corpus (12)

• Continuous Hamiltonian dynamics on digital quantum computers without discretization error
• Algorithmic Shadow Spectroscopy
• Unlocking early fault-tolerant quantum computing with mitigated magic dilution
• TE-PAI: Exact Time Evolution by Sampling Random Circuits
• Sparse Probabilistic Synthesis of Quantum Operations
• More buck-per-shot: Why learning trumps mitigation in noisy quantum sensing
• Exponential distillation of dominant eigenproperties
• Theory of quantum error mitigation for non-Clifford gates
• Space-time tradeoff in networked virtual distillation
• Phase estimation with partially randomized time evolution
• Feed-Forward Probabilistic Error Cancellation with Noisy Recovery Gates
• Unbiased observable estimation with approximate channels in fault-tolerant quantum computation