Sparse Probabilistic Synthesis of Quantum Operations
arXiv:2402.15550 · doi:10.1103/PRXQuantum.5.040352
Abstract
Successful implementations of quantum technologies require protocols and algorithms that use as few quantum resources as possible. However, many important quantum operations, such as continuous rotation gates in quantum computing or broadband pulses in NMR or MRI applications, can only be implemented approximately using finite quantum resources. This work develops an approach that enables -- at the cost of a modestly increased measurement repetition rate -- exact implementations on average. One proceeds by first building a library of a large number of different approximations to the desired gate operation; by randomly selecting these operations according to a pre-optimised probability distribution, one can on average implement the desired operation with a rigorously controllable approximation error. The approach relies on sophisticated tools from convex optimisation to efficiently find optimal probability distributions. A diverse spectrum of applications are demonstrated as (a) exactly synthesising rotations in fault-tolerant quantum computers using only low T-count circuits and (b) synthesising broadband and band-selective pulses of superior performance in quantum optimal control with (c) further applications in NMR or MRI. The approach is very general and a broad spectrum of practical applications in quantum technologies are explicitly demonstrated.
12 pages, 4 figures
References in corpus (27)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Variational Quantum Algorithms
- Noisy intermediate-scale quantum (NISQ) algorithms
- Error mitigation for short-depth quantum circuits
- Predicting Many Properties of a Quantum System from Very Few Measurements
- Strong quantum computational advantage using a superconducting quantum processor
- Suppressing quantum errors by scaling a surface code logical qubit
- Logical quantum processor based on reconfigurable atom arrays
- The European Quantum Technologies Roadmap
- Practical Quantum Error Mitigation for Near-Future Applications
- Hybrid quantum-classical algorithms and quantum error mitigation
- Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
- Exponential Error Suppression for Near-Term Quantum Devices
- Quantum error mitigation as a universal error-minimization technique: applications from NISQ to FTQC eras
- Quasiprobability decompositions with reduced sampling overhead
- Efficient synthesis of probabilistic quantum circuits with fallback
- Operationally Invariant Measure of the Distance between Quantum States by Complementary Measurements
- Shorter gate sequences for quantum computing by mixing unitaries
- Quantum Analytic Descent
- Quantum natural gradient generalised to noisy and non-unitary circuits
- QuESTlink -- Mathematica embiggened by a hardware-optimised quantum emulator
- Quantum Error Mitigated Classical Shadows
- Shorter quantum circuits via single-qubit gate approximation
- Training variational quantum circuits with CoVaR: covariance root finding with classical shadows
- L1Packv2: A Mathematica package for minimizing an -penalized functional
- Probabilistic Interpolation of Quantum Rotation Angles
- Exploring Quantum Average-Case Distances: proofs, properties, and examples