Quantum circuit compilation with quantum computers

Abstract

Compilation optimizes quantum algorithms performances on real-world quantum computers. To date, it is performed via classical optimization strategies. We introduce a class of quantum algorithms to perform compilation via quantum computers, paving the way for a quantum advantage in compilation. We demonstrate the effectiveness of this approach via Quantum and Simulated Annealing-based compilation: we successfully compile a Trotterized Hamiltonian simulation with up to 64 qubits and 64 time-steps and a Quantum Fourier Transform with up to 40 qubits and 771 time steps. We show that, for a translationally invariant circuit, the compilation results in a fidelity gain that grows extensively in the size of the input circuit, outperforming any local or quasi-local compilation approach.

5 pages, 4 figures

References in corpus (49)

• The density-matrix renormalization group in the age of matrix product states
• The density-matrix renormalization group
• A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Adiabatic Quantum Computing
• Quantum random access memory
• Control of quantum phenomena: Past, present, and future
• Quantum trajectories and open many-body quantum systems
• Unifying time evolution and optimization with matrix product states
• Theory of Quantum Annealing of an Ising Spin Glass
• Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
• Quantum control theory and applications: A survey
• Noise tailoring for scalable quantum computation via randomized compiling
• Perspectives of quantum annealing: Methods and implementations
• Quantum Optimization of Maximum Independent Set using Rydberg Atom Arrays
• Optimal control technique for Many Body Quantum Systems dynamics
• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• Chopped random-basis quantum optimization
• A Review on Quantum Approximate Optimization Algorithm and its Variants
• Quantum Approximate Optimization Algorithm for MaxCut: A Fermionic View
• Implementing the Quantum von Neumann Architecture with Superconducting Circuits
• Reinforcement Learning in Different Phases of Quantum Control
• Automated optimization of large quantum circuits with continuous parameters
• Synthesis of Quantum Circuits for Linear Nearest Neighbor Architectures
• Demonstration of a scaling advantage for a quantum annealer over simulated annealing
• What limits the simulation of quantum computers?
• The Tensor Networks Anthology: Simulation techniques for many-body quantum lattice systems
• Tensor Network Algorithms: a Route Map
• An information theoretical analysis of quantum optimal control
• Fast multi-qubit gates by adiabatic evolution in interacting excited state manifolds
• Classically optimized Hamiltonian simulation
• Speeding up critical system dynamics through optimized evolution
• Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search
• Towards adiabatic quantum computing using compressed quantum circuits
• Glassy Phase of Optimal Quantum Control
• Quantum Fourier Transform Has Small Entanglement
• Is quantum computing green? An estimate for an energy-efficiency quantum advantage
• Measurement-free fault-tolerant quantum error correction in near-term devices
• Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors
• Realization of quantum signal processing on a noisy quantum computer
• Quantum Optimal Control: Landscape Structure and Topology
• Computational Capabilities and Compiler Development for Neutral Atom Quantum Processors: Connecting Tool Developers and Hardware Experts
• Broken symmetry in a two-qubit quantum control landscape
• Synthesis of and compilation with time-optimal multi-qubit gates
• Optimized measurement-free and fault-tolerant quantum error correction for neutral atoms
• Quantum Annealing for Neural Network optimization problems: a new approach via Tensor Network simulations
• Ab-initio tree-tensor-network digital twin for quantum computer benchmarking in 2D
• Qubit assignment using time reversal
• Optimal sampling of tensor networks targeting wave function's fast decaying tails