Robust quantum compilation and circuit optimisation via energy minimisation

Abstract

We explore a method for automatically recompiling a quantum circuit A into a target circuit B, with the goal that both circuits have the same action on a specific input i.e. B|in> = A|in>. This is of particular relevance to hybrid, NISQ-era algorithms for dynamical simulation or eigensolving. The user initially specifies B as a blank template: a layout of parameterised unitary gates configured to the identity. The compilation then proceeds using quantum hardware to perform an isomorphic energy-minimisation task, and an optional gate elimination phase to compress the circuit. If B is insufficient for perfect recompilation then the method will result in an approximate solution. We optimise using imaginary time evolution, and a recent extension of quantum natural gradient for noisy settings. We successfully recompile a 7-qubit circuit involving 186 gates of multiple types into an alternative form with a different topology, far fewer two-qubit gates, and a smaller family of gate types. Moreover we verify that the process is robust, finding that per-gate noise of up to 1% can still yield near-perfect recompilation. We test the scaling of our algorithm on up to 20 qubits, recompiling into circuits with up to 400 parameterized gates, and incorporate a custom adaptive timestep technique. We note that a classical simulation of the process can be useful to optimise circuits for today's prototypes, and more generally the method may enable 'blind' compilation i.e. harnessing a device whose response to control parameters is deterministic but unknown.

23 pages, 17 figures; fixed table formats, elaborated on applications and Trotter method in supplementary; added scaling tests and adaptive timestep; updated with noise tests for Quantum publication; updated acknowledgements

References in corpus (30)

• Quantum Computing in the NISQ era and beyond
• Variational Quantum Algorithms
• Quantum computational chemistry
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Extending the computational reach of a noisy superconducting quantum processor
• High-fidelity preparation, gates, memory and readout of a trapped-ion quantum bit
• Variational ansatz-based quantum simulation of imaginary time evolution
• Practical Quantum Error Mitigation for Near-Future Applications
• Hybrid quantum-classical algorithms and quantum error mitigation
• Quantum Natural Gradient
• Theory of variational quantum simulation
• An initialization strategy for addressing barren plateaus in parametrized quantum circuits
• Quantum-assisted quantum compiling
• A random compiler for fast Hamiltonian simulation
• Variational quantum algorithms for discovering Hamiltonian spectra
• QuEST and High Performance Simulation of Quantum Computers
• Learning the quantum algorithm for state overlap
• Noise Resilience of Variational Quantum Compiling
• Faster quantum simulation by randomization
• An Adaptive Optimizer for Measurement-Frugal Variational Algorithms
• Machine learning of noise-resilient quantum circuits
• Variational Quantum Unsampling on a Quantum Photonic Processor
• A magic state's fidelity can be superior to the operations that created it
• Demonstration of Adiabatic Variational Quantum Computing with a Superconducting Quantum Coprocessor
• Measurement cost of metric-aware variational quantum algorithms
• Improvements in Quantum SDP-Solving with Applications
• QuESTlink -- Mathematica embiggened by a hardware-optimised quantum emulator
• Learning unknown pure quantum states
• Freely Scalable Quantum Technologies using Cells of 5-to-50 Qubits with Very Lossy and Noisy Photonic Links

Cited by in corpus (34)

• Generalization in quantum machine learning from few training data
• Variational Quantum Linear Solver
• Variational Quantum State Eigensolver
• Out-of-distribution generalization for learning quantum dynamics
• Towards a Larger Molecular Simulation on the Quantum Computer: Up to 28 Qubits Systems Accelerated by Point Group Symmetry
• Simulation of interaction-induced chiral topological dynamics on a digital quantum computer
• Can Error Mitigation Improve Trainability of Noisy Variational Quantum Algorithms?
• A Comprehensive Review of Quantum Circuit Optimization: Current Trends and Future Directions
• Experimental benchmarking of an automated deterministic error suppression workflow for quantum algorithms
• 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
• Local variational quantum compilation of a large-scale Hamiltonian dynamics
• Quantum Mixed State Compiling
• Training variational quantum circuits with CoVaR: covariance root finding with classical shadows
• Efficient variational synthesis of quantum circuits with coherent multi-start optimization
• Learning shallow quantum circuits
• Optimal quantum dataset for learning a unitary transformation
• Approximate encoding of quantum states using shallow circuits
• Chemically Aware Unitary Coupled Cluster with ab initio Calculations on System Model H1: A Refrigerant Chemicals Application
• Transition Role of Entangled Data in Quantum Machine Learning
• Variational Quantum Cloning: Improving Practicality for Quantum Cryptanalysis
• Adaptive projected variational quantum dynamics
• Exploring ab initio machine synthesis of quantum circuits
• Barren plateaus are swamped with traps
• The power and limitations of learning quantum dynamics incoherently
• Evolving Quantum Circuits
• Improving the Performance of Digitized Counterdiabatic Quantum Optimization via Algorithm-Oriented Qubit Mapping
• Initial-State Dependent Optimization of Controlled Gate Operations with Quantum Computer
• Exploiting subspace constraints and ab initio variational methods for quantum chemistry
• Quantum state tomography with disentanglement algorithm
• Optimal compression of constrained quantum time evolution
• Variational quantum cloning machine on an integrated photonic interferometer
• Realizing non-trivial doublon formation using a quantum computer
• Resilience-Runtime Tradeoff Relations for Quantum Algorithms