Compilation of algorithm-specific graph states for quantum circuits

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 (8)

• Surface codes: Towards practical large-scale quantum computation
• Topological fault-tolerance in cluster state quantum computation
• Topological Order with a Twist: Ising Anyons from an Abelian Model
• Fast simulation of stabilizer circuits using a graph state representation
• Fusion-based quantum computation
• Quantum computation by local measurement
• Lattice Surgery Translation for Quantum Computation
• 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