Synthesis of Arbitrary Quantum Circuits to Topological Assembly
arXiv:1604.08621 · doi:10.1038/srep30600
Abstract
Given a quantum algorithm, it is highly nontrivial to devise an efficient sequence of physical gates implementing the algorithm on real hardware and incorporating topological quantum error correction. In this paper, we present a first step towards this goal, focusing on generating correct and simple arrangements of topological structures that correspond to a given quantum circuit and largely neglecting their efficiency. We detail the many challenges that will need to be tackled in the pursuit of efficiency. The software source code can be consulted at https://github.com/alexandrupaler/tqec.
arXiv comment24 pages, 28 figures
References in corpus (8)
- Surface codes: Towards practical large-scale quantum computation
- Topological fault-tolerance in cluster state quantum computation
- Unified derivations of measurement-based schemes for quantum computation
- A bridge to lower overhead quantum computation
- Time-optimal quantum computation
- Optimal ancilla-free Clifford+T approximation of z-rotations
- A Regular Representation of Quantum Circuits
- Synthesis of Topological Quantum Circuits
Cited by in corpus (19)
- Roads towards fault-tolerant universal quantum computation
- Local and Distributed Quantum Computation
- Performing Quantum Computing Experiments in the Cloud
- Fault-Tolerant High Level Quantum Circuits: Form, Compilation and Description
- Optimized Surface Code Communication in Superconducting Quantum Computers
- Mapping of Lattice Surgery-based Quantum Circuits on Surface Code Architectures
- Parallelising the Queries in Bucket Brigade Quantum RAM
- Lattice Surgery Translation for Quantum Computation
- Magic-State Functional Units: Mapping and Scheduling Multi-Level Distillation Circuits for Fault-Tolerant Quantum Architectures
- Optimization of CNOT circuits on limited connectivity architecture
- Lattice Surgery on the Raussendorf Lattice
- Synthesis of Arbitrary Quantum Circuits to Topological Assembly: Systematic, Online and Compact
- A SAT Scalpel for Lattice Surgery: Representation and Synthesis of Subroutines for Surface-Code Fault-Tolerant Quantum Computing
- A 3D lattice defect and efficient computations in topological MBQC
- Feasibility of Logical Bell State Generation in Memory Assisted Quantum Networks
- Time versus Hardware: Reducing Qubit Counts with a (Surface Code) Data Bus
- String Diagrams for Defect-Based Surface Code Computing
- Programming quantum computers using 3-D puzzles, coffee cups, and doughnuts
- Reliable quantum circuits have defects