• Corpus ID: 252284124

Compilation of algorithm-specific graph states for quantum circuits

  title={Compilation of algorithm-specific graph states for quantum circuits},
  author={Madhav Krishnan Vijayan and Alexandru Paler and Jason Gavriel and Casey R. Myers and P. Rohde and Simon J. Devitt},
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… 

A compiler for universal photonic quantum computers

A pipeline to convert a QASM circuit into a graph representation named measurement-graph ( m-graph), that can be directly translated to hardware instructions on an optical one-way quantum computer, and optimize the graph using ZX-Calculus before evaluating the execution on an experimental discrete variable photonic platform.



Resources Required for Preparing Graph States

A rigorous analysis of the resources required for producing graph states is given, using a novel graph-contraction procedure, and it is shown that any graph state can be prepared by a linear-size constant-depth quantum circuit, and trade-offs between depth and width are established.

Measurement-based quantum computation on cluster states

We give a detailed account of the one-way quantum computer, a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster

Fault-tolerant, high-level quantum circuits: form, compilation and description

This work introduces a package that converts high-level quantum circuits consisting of commonly used gates into a form employing all decompositions and ancillary protocols needed for fault-tolerant error correction and outputs a standard circuit or a canonical geometric description, a necessity for operating current state-of-the-art hardware architectures using topological quantum codes.

A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery

No knowledge of quantum error correction is necessary to understand the schemes in this paper, but only the concepts of qubits and measurements, which are based on surface-code patches.

Fast simulation of stabilizer circuits using a graph-state representation

An algorithm for this task, which is based on the graph-state formalism, shows significant improvement in comparison to an existing algorithm, given by Gottesman and Aaronson, in terms of speed and of the number of qubits the simulator can handle.

Topological fault-tolerance in cluster state quantum computation

A fault-tolerant version of the one-way quantum computer using a cluster state in three spatial dimensions using topologically protected quantum gates and equivalence transformations that can be used to simplify fault-Tolerant circuits and to derive circuit identities in a topological manner are described.

A Compilation Framework for Photonic One-Way Quantum Computation

The first end-to-end compilation framework to accommodate one-way quantum computation toward realistic photonic quantum devices is proposed and the huge optimization space for mapping a quantum program to photonic devices where computation resources can be saved by orders of magnitude with novel compiler optimization designs is unveiled.

On the Co-Design of Quantum Software and Hardware

This review of quantum software and hardware systems should be designed collaboratively to fully exploit the potential of quantum computing and discusses some potential future directions following the co-design principle.

Lattice surgery translation for quantum computation

A method for a compiler to translate any non fault tolerant quantum circuit to the geometric representation of the lattice surgery error-correcting code using inherent merge and split operations is outlined.

Software-based Pauli tracking in fault-tolerant quantum circuits

This work presents an algorithm for tracking byproduct operators through a quantum computation and fills the gap in Pauli tracking, which is routinely ignored in quantum information.