Automated optimization of large quantum circuits with continuous parameters
arXiv:1710.07345 · doi:10.1038/s41534-018-0072-4
Abstract
We develop and implement automated methods for optimizing quantum circuits of the size and type expected in quantum computations that outperform classical computers. We show how to handle continuous gate parameters and report a collection of fast algorithms capable of optimizing large-scale quantum circuits. For the suite of benchmarks considered, we obtain substantial reductions in gate counts. In particular, we provide better optimization in significantly less time than previous approaches, while making minimal structural changes so as to preserve the basic layout of the underlying quantum algorithms. Our results help bridge the gap between the computations that can be run on existing hardware and those that are expected to outperform classical computers.
arXiv comment21 pages
References in corpus (19)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Elementary gates for quantum computation
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Demonstration of a small programmable quantum computer with atomic qubits
- Efficient quantum algorithms for simulating sparse Hamiltonians
- A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
- An approximate Fourier transform useful in quantum factoring
- Synthesis and Optimization of Reversible Circuits - A Survey
- Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
- Quantum Circuit Simplification and Level Compaction
- On the advantages of using relative phase Toffolis with an application to multiple control Toffoli optimization
- Addition on a Quantum Computer
- Fast Quantum Modular Exponentiation
- Quantum computation with realistic magic state factories
- Quipper: A Scalable Quantum Programming Language
- A bridge to lower overhead quantum computation
- Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates
- Identity check is QMA-complete
- Scaling laws for Shor's algorithm with a banded quantum Fourier transform
Cited by in corpus (90)
- Circuit-centric quantum classifiers
- Toward the first quantum simulation with quantum speedup
- tket : A Retargetable Compiler for NISQ Devices
- Quantum-assisted quantum compiling
- Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
- Challenges and Opportunities of Near-Term Quantum Computing Systems
- Reducing T-count with the ZX-calculus
- Optimized Compilation of Aggregated Instructions for Realistic Quantum Computers
- PyZX: Large Scale Automated Diagrammatic Reasoning
- A Verified Optimizer for Quantum Circuits
- Quantum circuit optimizations for NISQ architectures
- Optimal Layout Synthesis for Quantum Computing
- Optimality Study of Existing Quantum Computing Layout Synthesis Tools
- Approximate Quantum Fourier Transform with T gates
- Phase Gadget Synthesis for Shallow Circuits
- Computer-inspired Quantum Experiments
- Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
- Toward scalable simulations of Lattice Gauge Theories on quantum computers
- Time-Sliced Quantum Circuit Partitioning for Modular Architectures
- staq -- A full-stack quantum processing toolkit
- On the CNOT-complexity of CNOT-PHASE circuits
- QDiff: Differential Testing of Quantum Software Stacks
- Robust quantum compilation and circuit optimisation via energy minimisation
- Equivalence Checking of Quantum Circuits with the ZX-Calculus
- Quantum Embedding Search for Quantum Machine Learning
- Low cost quantum circuits for classically intractable instances of the Hamiltonian dynamics simulation problem
- Optimal synthesis of the Fredkin gate in a multilevel system
- Synthesizing Quantum-Circuit Optimizers
- Exact and practical pattern matching for quantum circuit optimization
- Quantum Architecture Search: A Survey
- A Comprehensive Review of Quantum Circuit Optimization: Current Trends and Future Directions
- Cross-Platform Comparison of Arbitrary Quantum Computations
- Constructing quantum circuits with global gates
- Reducing the Depth of Linear Reversible Quantum Circuits
- Variational circuit compiler for quantum error correction
- Fault-tolerant Quantum Error Correction on Near-term Quantum Processors using Flag and Bridge Qubits
- Asymptotically Improved Circuit for -ary Grover's Algorithm with Advanced Decomposition of -qudit Toffoli Gate
- Resource-Optimized Fermionic Local-Hamiltonian Simulation on Quantum Computer for Quantum Chemistry
- Quantum Computation of Reactions on Surfaces Using Local Embedding
- Probing Geometric Excitations of Fractional Quantum Hall States on Quantum Computers
- Phase polynomials synthesis algorithms for NISQ architectures and beyond
- Enabling Dataflow Optimization for Quantum Programs
- Equivalence Checking of Parameterized Quantum Circuits: Verifying the Compilation of Variational Quantum Algorithms
- Efficient variational synthesis of quantum circuits with coherent multi-start optimization
- Reducing 2-QuBit Gate Count for ZX-Calculus based Quantum Circuit Optimization
- Orchestrated Trios: Compiling for Efficient Communication in Quantum Programs with 3-Qubit Gates
- Magic State Distillation from Entangled States
- HamLib: A library of Hamiltonians for benchmarking quantum algorithms and hardware
- Implementation of Measurement Reduction for the Variational Quantum Eigensolver
- Quantum circuit synthesis using Householder transformations
- Robustness of quantum algorithms against coherent control errors
- Gaussian Elimination versus Greedy Methods for the Synthesis of Linear Reversible Circuits
- Quantum circuit compilation and hybrid computation using Pauli-based computation
- Integration of Quantum Accelerators with High Performance Computing -- A Review of Quantum Programming Tools
- A Complete Equational Theory for Quantum Circuits
- Assertion-Based Optimization of Quantum Programs
- Automatic Depth-Optimized Quantum Circuit Synthesis for Diagonal Unitary Matrices with Asymptotically Optimal Gate Count
- Reinforcement Learning Based Quantum Circuit Optimization via ZX-Calculus
- Optimal Hadamard gate count for Clifford synthesis of Pauli rotations sequences
- The phase/state duality in reversible circuit design
- The T-Complexity Costs of Error Correction for Control Flow in Quantum Computation
- Symbolic Reasoning about Quantum Circuits in Coq
- Using Spectral Graph Theory to Map Qubits onto Connectivity-Limited Devices
- Linear and non-linear relational analyses for Quantum Program Optimization
- FeynmanDD: Quantum Circuit Analysis with Classical Decision Diagrams
- AND-gates in ZX-calculus: Spider Nest Identities and QBC-completeness
- Synthesis of CNOT-Dihedral circuits with optimal number of two qubit gates
- Evolving Quantum Circuits
- Characterization, synthesis, and optimization of quantum circuits over multiple-control -rotation gates: A systematic study
- Initial-State Dependent Optimization of Controlled Gate Operations with Quantum Computer
- QuYBE -- An Algebraic Compiler for Quantum Circuit Compression
- Quantum circuit compilation with quantum computers
- Symbolic Synthesis of Clifford Circuits and Beyond
- Generators and Relations for 2-Qubit Clifford+T Operators
- Generators and Relations for Un(Z[1/2,i])
- Variational quantum eigensolver with embedded entanglement using a tensor-network ansatz
- Optimal compilation of parametrised quantum circuits
- Fast algorithms for classical specifications of stabiliser states and Clifford gates
- A recursively partitioned approach to architecture-aware ZX Polynomial synthesis and optimization
- Optimizing Electronic Structure Simulations on a Trapped-ion Quantum Computer using Problem Decomposition
- Quantum Software Ecosystem Design
- Superconducting qubits in the millions: the potential and limitations of modularity
- HATT: Hamiltonian Adaptive Ternary Tree for Optimizing Fermion-to-Qubit Mapping
- Describing Trotterized Time Evolutions on Noisy Quantum Computers via Static Effective Lindbladians
- Classical and Quantum Data Interaction in Programming Languages: A Runtime Architecture
- Optimizing Quantum Transformation Matrices: A Block Decomposition Approach for Efficient Gate Reduction
- Quantum Circuit Optimization by Graph Coloring
- Ion-Trap Chip Architecture Optimized for Implementation of Quantum Error-Correcting Code
- Realizing Topological Quantum Walks on NISQ Digital Quantum Computer
- Free Quantum Computing