Exploring ab initio machine synthesis of quantum circuits

Abstract

Gate-level quantum circuits are often derived manually from higher level algorithms. While this suffices for small implementations and demonstrations, ultimately automatic circuit design will be required to realise complex algorithms using hardware-specific operations and connectivity. Here we explore methods for the ab initio creation of circuits within a machine, either a classical computer or a hybrid quantum-classical device. We consider a range of techniques including: methods for introducing new gate structures, optimisation of parameterised circuits and choices of cost functions, and efficient removal of low-value gates exploiting the quantum geometric tensor and other heuristics. Using these principles we tackle the tasks of automatic encoding of unitary processes and translation (recompilation) of a circuit from one form to another. Using emulated quantum computers with various noise-free gate sets we provide simple examples involving up to 10 qubits, corresponding to 20 qubits in the augmented space we use. Further applications of specific relevance to chemistry modelling are considered in a sister paper, 'Exploiting subspace constraints and ab initio variational methods for quantum chemistry'.

arXiv comment17 pages, 10 figures

References in corpus (40)

• Elementary gates for quantum computation
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Variational ansatz-based quantum simulation of imaginary time evolution
• Fast universal quantum control above the fault-tolerance threshold in silicon
• Generalization in quantum machine learning from few training data
• Quantum Natural Gradient
• Theory of variational quantum simulation
• qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
• Complete universal quantum gate set approaching fault-tolerant thresholds with superconducting qubits
• Quantum-assisted quantum compiling
• Two-qubit silicon quantum processor with operation fidelity exceeding 99%
• Learning the quantum algorithm for state overlap
• Quantum Circuits for Isometries
• Compiling quantum circuits to realistic hardware architectures using temporal planners
• Machine learning of noise-resilient quantum circuits
• Robust entanglement gates for trapped-ion qubits
• A Hardware-Aware Heuristic for the Qubit Mapping Problem in the NISQ Era
• Resilient entanglement gates for trapped ions
• Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search
• Universal gate-set for trapped-ion qubits using a narrow linewidth diode laser
• Measurement cost of metric-aware variational quantum algorithms
• Robust quantum compilation and circuit optimisation via energy minimisation
• Circuit Transformations for Quantum Architectures
• A Rudimentary Quantum Compiler
• Grid-based methods for chemistry simulations on a quantum computer
• Efficient decomposition of unitary matrices in quantum circuit compilers
• LEAP: Scaling Numerical Optimization Based Synthesis Using an Incremental Approach
• On the natural gradient for variational quantum eigensolver
• Realization of a Universal Quantum Gate Set for Itinerant Microwave Photons
• Parallelizing quantum circuit synthesis
• Training variational quantum circuits with CoVaR: covariance root finding with classical shadows
• Fast Bayesian tomography of a two-qubit gate set in silicon
• Quantum computing with superconducting circuits in the picosecond regime
• Supervised Learning Enhanced Quantum Circuit Transformation
• Machine Learning Optimization of Quantum Circuit Layouts
• A universal quantum gate set for transmon qubits with strong ZZ interactions
• Exploiting subspace constraints and ab initio variational methods for quantum chemistry
• Computational Assessment of Silicon Quantum Gate Based on Detuning Mechanism for Quantum Computing
• Quantum Circuit Transformation Based on Tabu Search

Cited by in corpus (6)

• Grid-based methods for chemistry simulations on a quantum computer
• Approximate encoding of quantum states using shallow circuits
• A Toffoli Gate Decomposition via Echoed Cross-Resonance Gates
• Variational quantum eigensolver with embedded entanglement using a tensor-network ansatz
• Exploiting subspace constraints and ab initio variational methods for quantum chemistry
• The Virtual Quantum Device (VQD): A tool for detailed emulation of quantum computers