Compilation of algorithm-specific graph states for quantum circuits
arXiv:2209.07345 · doi:10.1088/2058-9565/ad1f39
Abstract
We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages, such as Cirq and Q#. The computation can then be implemented using a series of non-Pauli measurements on this graph state. By compiling the graph state directly instead of starting with a standard lattice cluster state and preparing it over the course of the computation, we are able to better understand the resource costs involved and eliminate wasteful Pauli measurements on the actual quantum device. Access to this algorithm-specific graph state also allows for optimisation over locally equivalent graph states to implement the same quantum circuit. The compiler presented here finds ready application in measurement based quantum computing, NISQ devices and logical level compilation for fault tolereant implementations.
References in corpus (33)
- Mixed State Entanglement and Quantum Error Correction
- Elementary gates for quantum computation
- Surface codes: Towards practical large-scale quantum computation
- Measurement-based quantum computation with cluster states
- Improved Simulation of Stabilizer Circuits
- A Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming Bound
- Parameterized quantum circuits as machine learning models
- The Variational Quantum Eigensolver: a review of methods and best practices
- Quantum Error Correction and Orthogonal Geometry
- Topological fault-tolerance in cluster state quantum computation
- Surface code quantum computing by lattice surgery
- Instantaneous non-local computation of low T-depth quantum circuits
- The Heisenberg Representation of Quantum Computers
- Cluster-state quantum computation
- A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
- Stim: a fast stabilizer circuit simulator
- Topological Order with a Twist: Ising Anyons from an Abelian Model
- Graphical description of the action of local Clifford transformations on graph states
- Interacting Quantum Observables: Categorical Algebra and Diagrammatics
- Hybrid Quantum-Classical Approach to Quantum Optimal Control
- Fast simulation of stabilizer circuits using a graph state representation
- Yao.jl: Extensible, Efficient Framework for Quantum Algorithm Design
- Fault-Tolerant High Level Quantum Circuits: Form, Compilation and Description
- A measurement-based variational quantum eigensolver
- There and back again: A circuit extraction tale
- Structure of 2D Topological Stabilizer Codes
- An efficient algorithm to recognize local Clifford equivalence of graph states
- Fusion-based quantum computation
- Quantum computation by local measurement
- Mapping graph state orbits under local complementation
- Lattice Surgery Translation for Quantum Computation
- A comparative study of universal quantum computing models: towards a physical unification
- Sharp complexity phase transitions generated by entanglement
Cited by in corpus (7)
- Benchmarking quantum gates and circuits
- A SAT Scalpel for Lattice Surgery: Representation and Synthesis of Subroutines for Surface-Code Fault-Tolerant Quantum Computing
- Hamiltonian-based graph-state ansatz for variational quantum algorithms
- Superconducting qubits in the millions: the potential and limitations of modularity
- Minimising the number of edges in LC-equivalent graph states
- Optimal Scheduling of Graph States via Path Decompositions
- Monitoring the generation of photonic linear cluster states with partial measurements