Quantum-assisted quantum compiling

Abstract

Compiling quantum algorithms for near-term quantum computers (accounting for connectivity and native gate alphabets) is a major challenge that has received significant attention both by industry and academia. Avoiding the exponential overhead of classical simulation of quantum dynamics will allow compilation of larger algorithms, and a strategy for this is to evaluate an algorithm's cost on a quantum computer. To this end, we propose a variational hybrid quantum-classical algorithm called quantum-assisted quantum compiling (QAQC). In QAQC, we use the overlap between a target unitary $U$ and a trainable unitary $V$ as the cost function to be evaluated on the quantum computer. More precisely, to ensure that QAQC scales well with problem size, our cost involves not only the global overlap $\mathrm{Tr}(V^{†}U)$ but also the local overlaps with respect to individual qubits. We introduce novel short-depth quantum circuits to quantify the terms in our cost function, and we prove that our cost cannot be efficiently approximated with a classical algorithm under reasonable complexity assumptions. We present both gradient-free and gradient-based approaches to minimizing this cost. As a demonstration of QAQC, we compile various one-qubit gates on IBM's and Rigetti's quantum computers into their respective native gate alphabets. Furthermore, we successfully simulate QAQC up to a problem size of 9 qubits, and these simulations highlight both the scalability of our cost function as well as the noise resilience of QAQC. Future applications of QAQC include algorithm depth compression, black-box compiling, noise mitigation, and benchmarking.

arXiv comment19 + 10 pages, 14 figures. Added larger scale implementations and proof that cost function is DQC1-hard

References in corpus (36)

• Quantum Computing in the NISQ era and beyond
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• A variational eigenvalue solver on a quantum processor
• Barren plateaus in quantum neural network training landscapes
• A Quantum Approximate Optimization Algorithm
• Quantum Circuit Learning
• On the Power of One Bit of Quantum Information
• Extending the computational reach of a noisy superconducting quantum processor
• A simple formula for the average gate fidelity of a quantum dynamical operation
• Quantum autoencoders for efficient compression of quantum data
• A blueprint for demonstrating quantum supremacy with superconducting qubits
• Optimal Quantum Circuits for General Two-Qubit Gates
• A generative modeling approach for benchmarking and training shallow quantum circuits
• Resource-Aware Quantum Programming with General Recursion and Quantum Control
• Quantum Circuit Simplification and Level Compaction
• Learning the quantum algorithm for state overlap
• Concrete Categorical Model of a Quantum Circuit Description Language with Measurement
• Automated optimization of large quantum circuits with continuous parameters
• Variational Quantum State Diagonalization
• The SWAP test and the Hong-Ou-Mandel effect are equivalent
• Adding control to arbitrary unknown quantum operations
• Quantum gradient descent for linear systems and least squares
• A Software Methodology for Compiling Quantum Programs
• Quantum computing and the entanglement frontier
• Compiling quantum circuits to realistic hardware architectures using temporal planners
• Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits
• Asymptotically Optimal Topological Quantum Compiling
• Optimizing quantum optimization algorithms via faster quantum gradient computation
• A Universal Training Algorithm for Quantum Deep Learning
• Glassy Phase of Optimal Quantum Control
• Impossibility of Classically Simulating One-Clean-Qubit Computation
• Optimising the Solovay-Kitaev algorithm
• QVECTOR: an algorithm for device-tailored quantum error correction
• In situ upgrade of quantum simulators to universal computers
• Quantum compiling with diffusive sets of gates
• Quantum Compiler Optimizations

Cited by in corpus (220)

• Variational Quantum Algorithms
• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum Chemistry in the Age of Quantum Computing
• Parameterized quantum circuits as machine learning models
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Noise-Induced Barren Plateaus in Variational Quantum Algorithms
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Hybrid quantum-classical algorithms and quantum error mitigation
• Generalization in quantum machine learning from few training data
• Absence of Barren Plateaus in Quantum Convolutional Neural Networks
• Robust data encodings for quantum classifiers
• General parameter-shift rules for quantum gradients
• Variational Fast Forwarding for Quantum Simulation Beyond the Coherence Time
• Effect of barren plateaus on gradient-free optimization
• Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps
• Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
• Barren Plateaus in Variational Quantum Computing
• Variational Quantum State Diagonalization
• Variational Quantum Linear Solver
• Noise Resilience of Variational Quantum Compiling
• Trainability of Dissipative Perceptron-Based Quantum Neural Networks
• Theory of overparametrization in quantum neural networks
• Differentiable Quantum Architecture Search
• The Born Supremacy: Quantum Advantage and Training of an Ising Born Machine
• Large gradients via correlation in random parameterized quantum circuits
• Equivalence of quantum barren plateaus to cost concentration and narrow gorges
• A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits
• Variational Quantum State Eigensolver
• Exponential Error Suppression for Near-Term Quantum Devices
• Barren plateaus preclude learning scramblers
• Higher Order Derivatives of Quantum Neural Networks with Barren Plateaus
• Low-depth gradient measurements can improve convergence in variational hybrid quantum-classical algorithms
• An Adaptive Optimizer for Measurement-Frugal Variational Algorithms
• On barren plateaus and cost function locality in variational quantum algorithms
• Quantum Computation of Finite-Temperature Static and Dynamical Properties of Spin Systems Using Quantum Imaginary Time Evolution
• Variational Quantum Fidelity Estimation
• Machine learning of noise-resilient quantum circuits
• From pulses to circuits and back again: A quantum optimal control perspective on variational quantum algorithms
• Theory for Equivariant Quantum Neural Networks
• Variational Quantum Unsampling on a Quantum Photonic Processor
• Neural Predictor based Quantum Architecture Search
• Universal discriminative quantum neural networks
• Evaluating the noise resilience of variational quantum algorithms
• Variational Quantum Algorithm for Estimating the Quantum Fisher Information
• Unified approach to data-driven quantum error mitigation
• Error mitigation for universal gates on encoded qubits
• Does provable absence of barren plateaus imply classical simulability?
• Correlation-Informed Permutation of Qubits for Reducing Ansatz Depth in VQE
• Out-of-distribution generalization for learning quantum dynamics
• On the practical usefulness of the Hardware Efficient Ansatz
• Variational Quantum Singular Value Decomposition
• Subtleties in the trainability of quantum machine learning models
• Reformulation of the No-Free-Lunch Theorem for Entangled Data Sets
• Quasiprobability decompositions with reduced sampling overhead
• Variational Consistent Histories as a Hybrid Algorithm for Quantum Foundations
• Scaling of variational quantum circuit depth for condensed matter systems
• Beyond the swap test: optimal estimation of quantum state overlap
• Efficient quantum algorithms for stabilizer entropies
• Error mitigation for variational quantum algorithms through mid-circuit measurements
• Quantum Hamiltonian-Based Models and the Variational Quantum Thermalizer Algorithm
• Evaluating energy differences on a quantum computer with robust phase estimation
• Robust quantum compilation and circuit optimisation via energy minimisation
• Simulation of interaction-induced chiral topological dynamics on a digital quantum computer
• Qubit Mapping Based on Subgraph Isomorphism and Filtered Depth-Limited Search
• Variational Hamiltonian Diagonalization for Dynamical Quantum Simulation
• Quantum Analytic Descent
• Strong bound between trace distance and Hilbert-Schmidt distance for low-rank states
• Noise-Resilient Variational Hybrid Quantum-Classical Optimization
• Realising and compressing quantum circuits with quantum reservoir computing
• Abrupt Transitions in Variational Quantum Circuit Training
• Approaching the theoretical limit in quantum gate decomposition
• Stabilizing multiple topological fermions on a quantum computer
• Variational quantum compiling with double Q-learning
• Can Error Mitigation Improve Trainability of Noisy Variational Quantum Algorithms?
• LEAP: Scaling Numerical Optimization Based Synthesis Using an Incremental Approach
• Application-Motivated, Holistic Benchmarking of a Full Quantum Computing Stack
• Minimum Hardware Requirements for Hybrid Quantum-Classical DMFT
• Trainability barriers and opportunities in quantum generative modeling
• Quantum Architecture Search: A Survey
• Gradient Ascent Pulse Engineering with Feedback
• Quantum autoencoders with enhanced data encoding
• Learning efficient decoders for quasi-chaotic quantum scramblers
• Constant-Depth Circuits for Dynamic Simulations of Materials on Quantum Computers
• Quantum Architecture Search with Meta-learning
• Unifying and benchmarking state-of-the-art quantum error mitigation techniques
• Variational quantum process tomography
• High-fidelity realization of the AKLT state on a NISQ-era quantum processor
• Long-time simulations with high fidelity on quantum hardware
• Variational circuit compiler for quantum error correction
• Probing many-body localization by excited-state VQE
• Fault-tolerant Quantum Error Correction on Near-term Quantum Processors using Flag and Bridge Qubits
• Dynamical simulation via quantum machine learning with provable generalization
• Approximate Quantum Circuit Synthesis using Block-Encodings
• A semi-agnostic ansatz with variable structure for quantum machine learning
• Learning Unitaries by Gradient Descent
• Non-trivial symmetries in quantum landscapes and their resilience to quantum noise
• Characterization and Verification of Trotterized Digital Quantum Simulation via Hamiltonian and Liouvillian Learning
• Stochastic Gradient Line Bayesian Optimization for Efficient Noise-Robust Optimization of Parameterized Quantum Circuits
• Multivariate trace estimation in constant quantum depth
• Local variational quantum compilation of a large-scale Hamiltonian dynamics
• Observation of higher-order topological states on a quantum computer
• Quantum Mixed State Compiling
• Operator Sampling for Shot-frugal Optimization in Variational Algorithms
• Simulating Noisy Variational Quantum Algorithms: A Polynomial Approach
• Quantum circuit synthesis with diffusion models
• Training variational quantum circuits with CoVaR: covariance root finding with classical shadows
• QFAST: Quantum Synthesis Using a Hierarchical Continuous Circuit Space
• Variational quantum simulation: a case study for understanding warm starts
• Engineered dissipation to mitigate barren plateaus
• Designing calibration and expressivity-efficient instruction sets for quantum computing
• Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
• State preparation and measurement in a quantum simulation of the O(3) sigma model
• Optimal training of variational quantum algorithms without barren plateaus
• Efficient variational synthesis of quantum circuits with coherent multi-start optimization
• Learning shallow quantum circuits
• Variational quantum algorithms to estimate rank, quantum entropies, fidelity and Fisher information via purity minimization
• Tight and Efficient Gradient Bounds for Parameterized Quantum Circuits
• Error mitigation with Clifford quantum-circuit data
• Characterizing correlation within multipartite quantum systems via local randomized measurements
• Generalization of Quantum Machine Learning Models Using Quantum Fisher Information Metric
• Quantum Convolutional Neural Networks are Effectively Classically Simulable
• Lie-algebraic classical simulations for quantum computing
• Enabling Large-Scale and High-Precision Fluid Simulations on Near-Term Quantum Computers
• Approximate complex amplitude encoding algorithm and its application to data classification problems
• Pseudorandom unitaries are neither real nor sparse nor noise-robust
• Optimal quantum dataset for learning a unitary transformation
• Transition Role of Entangled Data in Quantum Machine Learning
• Approximate encoding of quantum states using shallow circuits
• Short-depth circuits for efficient expectation value estimation
• Wishart and random density matrices: Analytical results for the mean-square Hilbert-Schmidt distance
• Heuristics for Quantum Compiling with a Continuous Gate Set
• GSQAS: Graph Self-supervised Quantum Architecture Search
• Complexity of quantum state verification in the quantum linear systems problem
• Fully-Optimized Quantum Metrology: Framework, Tools, and Applications
• Variational Quantum Cloning: Improving Practicality for Quantum Cryptanalysis
• Beyond unital noise in variational quantum algorithms: noise-induced barren plateaus and limit sets
• Practical verification protocols for analog quantum simulators
• A Toffoli Gate Decomposition via Echoed Cross-Resonance Gates
• Mitigated barren plateaus in the time-nonlocal optimization of analog quantum-algorithm protocols
• Binary Control Pulse Optimization for Quantum Systems
• Efficient Assessment of Process Fidelity
• Experimental Quantum Learning of a Spectral Decomposition
• Hybrid discrete-continuous compilation of trapped-ion quantum circuits with deep reinforcement learning
• Highly optimized quantum circuits synthesized via data-flow engines
• The battle of clean and dirty qubits in the era of partial error correction
• Adaptive projected variational quantum dynamics
• A Continuous Variable Born Machine
• Sample-efficient verification of continuously-parameterized quantum gates for small quantum processors
• Exploring ab initio machine synthesis of quantum circuits
• Error rate reduction of single-qubit gates via noise-aware decomposition into native gates
• Approximate Quantum Compiling for Quantum Simulation: A Tensor Network based approach
• Generative model for learning quantum ensemble via optimal transport loss
• Finding Broken Gates in Quantum Circuits---Exploiting Hybrid Machine Learning
• Barren plateaus are swamped with traps
• Robust and Resource-Efficient Quantum Circuit Approximation
• Random density matrices: Analytical results for mean root fidelity and mean square Bures distance
• Computation of Green's function by local variational quantum compilation
• Towards Efficient Ansatz Architecture for Variational Quantum Algorithms
• Quantum continual learning of quantum data realizing knowledge backward transfer
• The power and limitations of learning quantum dynamics incoherently
• Domain-Specific Compilers for Dynamic Simulations of Quantum Materials on Quantum Computers
• Coherent Quantum Channel Discrimination
• Simulation of a feedback-based algorithm for quantum optimization for a realistic neutral atom system with an optimized small-angle controlled-phase gate
• Adaptive shot allocation for fast convergence in variational quantum algorithms
• Evolving Quantum Circuits
• Optimisation-free Classification and Density Estimation with Quantum Circuits
• Qubit-efficient exponential suppression of errors
• Initial-State Dependent Optimization of Controlled Gate Operations with Quantum Computer
• The topology of data hides in quantum thermal states
• Riemannian quantum circuit optimization based on matrix product operators
• Quantum optimal control in quantum technologies. Strategic report on current status, visions and goals for research in Europe
• Qubit assignment using time reversal
• Assisted quantum simulation of open quantum systems
• Engineering the Cost Function of a Variational Quantum Algorithm for Implementation on Near-Term Devices
• Energy risk analysis with Dynamic Amplitude Estimation and Piecewise Approximate Quantum Compiling
• Random density matrices: Analytical results for mean fidelity and variance of squared Bures distance
• Algorithmic Primitives for Quantum-Assisted Quantum Control
• Schrödinger as a Quantum Programmer: Estimating Entanglement via Steering
• Optimal depth and a novel approach to variational quantum process tomography
• Variational quantum eigensolver with embedded entanglement using a tensor-network ansatz
• Sketching the Best Approximate Quantum Compiling Problem
• Exploiting subspace constraints and ab initio variational methods for quantum chemistry
• Subspace-Based Local Compilation of Variational Quantum Circuits for Large-Scale Quantum Many-Body Simulation
• Quantum Circuit Distillation and Compression
• Adaptive measurement strategy for noisy quantum amplitude estimation with variational quantum circuits
• Lightweight Detection of a Small Number of Large Errors in a Quantum Circuit
• Perturbative readout error mitigation for near term quantum computers
• Improving the efficiency of learning-based error mitigation
• Deep Circuit Compression for Quantum Dynamics via Tensor Networks
• Perturbative gadgets for gate-based quantum computing: Non-recursive constructions without subspace restrictions
• Universal compiling and (No-)Free-Lunch theorems for continuous variable quantum learning
• Towards solving the BCS Hamiltonian gap in Near-Term Quantum Computers
• A Monte Carlo Tree Search approach to QAOA: finding a needle in the haystack
• Optimal compression of constrained quantum time evolution
• Efficient preparation of the AKLT State with Measurement-based Imaginary Time Evolution
• Pitfalls when tackling the exponential concentration of parameterized quantum models
• Straddling-gates problem in multipartite quantum systems
• Quantum state tomography with disentanglement algorithm
• Variational Quantum Gate Optimization at the Pulse Level
• Exponentiation of Parametric Hamiltonians via Unitary interpolation
• Variational quantum cloning machine on an integrated photonic interferometer
• Policy Gradient Approach to Compilation of Variational Quantum Circuits
• The decomposition of an arbitrary $2^w\times 2^w$ unitary matrix into signed permutation matrices
• Optimized Topological Quantum Compilation of Three-Qubit Controlled Gates in the Fibonacci Anyon Model: A Controlled-Injection Approach
• Multi-target quantum compilation algorithm
• Simulating quantum dynamics: Evolution of algorithms in the HPC context
• Adiabatic quantum computing with parameterized quantum circuits
• Variational quantum compiling for three-qubit gates design in quantum dots
• Dynamic thermalization on noisy quantum hardware
• Finding eigenvectors with a quantum variational algorithm
• Efficient trainability of linear optical modules in quantum optical neural networks
• Shot-noise reduction for lattice Hamiltonians
• Realizing non-trivial doublon formation using a quantum computer
• Variational quantum algorithms with invariant probabilistic error cancellation on noisy quantum processors
• Compiling universal quantum circuits
• Controlled Gate Networks: Theory and Application to Eigenvalue Estimation
• The Dual Role of Low-Weight Pauli Propagation: A Flawed Simulator but a Powerful Initializer for Variational Quantum Algorithms
• Phase Estimation with Compressed Controlled Time Evolution
• Stochastic search for approximate compilation of unitaries
• Peephole Optimization for Quantum Approximate Synthesis