Phase Gadget Synthesis for Shallow Circuits
arXiv:1906.01734 · doi:10.4204/EPTCS.318.13
Abstract
We give an overview of the circuit optimisation methods used by tket, a compiler system for quantum software developed by Cambridge Quantum Computing Ltd. We focus on a novel technique based around phase gadgets, a family of multi-qubit quantum operations which occur naturally in a wide range of quantum circuits of practical interest. The phase gadgets have a simple presentation in the ZX-calculus, which makes it easy to reason about them. Taking advantage of this, we present an efficient method to translate the phase gadgets back to CNOT gates and single qubit operations suitable for execution on a quantum computer with significant reductions in gate count and circuit depth. We demonstrate the effectiveness of these methods on a quantum chemistry benchmarking set based on variational circuits for ground state estimation of small molecules.
In Proceedings QPL 2019, arXiv:2004.14750
References in corpus (15)
- The theory of variational hybrid quantum-classical algorithms
- Fermionic quantum computation
- A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
- A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
- Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
- Interacting Quantum Observables: Categorical Algebra and Diagrammatics
- A universal quantum circuit for two-qubit transformations with three CNOT gates
- Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
- Automated optimization of large quantum circuits with continuous parameters
- The ZX calculus is a language for surface code lattice surgery
- On the qubit routing problem
- T-count optimization and Reed-Muller codes
- Generators and relations for n-qubit Clifford operators
- Optimising Clifford Circuits with Quantomatic
- A Finite Presentation of CNOT-Dihedral Operators
Cited by in corpus (52)
- There and back again: A circuit extraction tale
- Analyzing the barren plateau phenomenon in training quantum neural networks with the ZX-calculus
- Qubit Mapping Based on Subgraph Isomorphism and Filtered Depth-Limited Search
- Application-Motivated, Holistic Benchmarking of a Full Quantum Computing Stack
- Synthesizing Quantum-Circuit Optimizers
- Distributing circuits over heterogeneous, modular quantum computing network architectures
- Quantum Computation of Reactions on Surfaces Using Local Embedding
- Universal Parity Quantum Computing
- Modular Parity Quantum Approximate Optimization
- Architecture-Aware Synthesis of Phase Polynomials for NISQ Devices
- Qurzon: A Prototype for a Divide and Conquer Based Quantum Compiler
- Chemically Aware Unitary Coupled Cluster with ab initio Calculations on System Model H1: A Refrigerant Chemicals Application
- Relating Measurement Patterns to Circuits via Pauli Flow
- A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits
- Toward QCD on Quantum Computer: Orbifold Lattice Approach
- Parity Quantum Optimization: Benchmarks
- Optimal joint cutting of two-qubit rotation gates
- A model of randomly-coupled Pauli spins
- Low-depth simulations of fermionic systems on square-grid quantum hardware
- Quantum circuit compilation and hybrid computation using Pauli-based computation
- Volumetric Benchmarking of Error Mitigation with Qermit
- A Complete Equational Theory for Quantum Circuits
- Annealing Optimisation of Mixed ZX Phase Circuits
- Optimal, hardware native decomposition of parameterized multi-qubit Pauli gates
- Measurement-based infused circuits for variational quantum eigensolvers
- Quantum Goemans-Williamson Algorithm with the Hadamard Test and Approximate Amplitude Constraints
- Diagrammatic Differentiation for Quantum Machine Learning
- How to Sum and Exponentiate Hamiltonians in ZXW Calculus
- Flow-preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation
- The Qudit ZH-Calculus: Generalised Toffoli+Hadamard and Universality
- Light-Matter Interaction in the ZXW Calculus
- Noise-Adaptive Quantum Compilation Strategies Evaluated with Application-Motivated Benchmarks
- Variational Phase Estimation with Variational Fast Forwarding
- Building Qutrit Diagonal Gates from Phase Gadgets
- Diagrammatic Analysis for Parameterized Quantum Circuits
- Picturing Counting Reductions with the ZH-Calculus
- Fermihedral: On the Optimal Compilation for Fermion-to-Qubit Encoding
- Scaling W state circuits in the qudit Clifford hierarchy
- Well-tempered ZX and ZH Calculi
- Procedurally Optimised ZX-Diagram Cutting for Efficient T-Decomposition in Classical Simulation
- SWAP-less Implementation of Quantum Algorithms
- A recursively partitioned approach to architecture-aware ZX Polynomial synthesis and optimization
- Efficient application of the factorized form of the unitary coupled-cluster ansatz for the variational quantum eigensolver algorithm by using linear combination of unitaries
- Non-stabilizerness and entanglement from cat-state injection
- Minimally Universal Parity Quantum Computing
- HATT: Hamiltonian Adaptive Ternary Tree for Optimizing Fermion-to-Qubit Mapping
- The Parity Flow Formalism: Tracking Quantum Information Throughout Computation
- Fast Classical Simulation of Quantum Circuits via Parametric Rewriting in the ZX-Calculus
- Optimizing State Preparation for Variational Quantum Regression on NISQ Hardware
- Transversal AND in Quantum Codes
- Near-Term Fermionic Simulation with Subspace Noise Tailored Quantum Error Mitigation
- PHOENIX: Pauli-Based High-Level Optimization Engine for Instruction Execution on NISQ Devices