Faster manipulation of large quantum circuits using wire label reference diagrams
arXiv:1811.06011
Abstract
Large scale quantum computing is highly anticipated, and quantum circuit design automation needs to keep up with the transition from small scale to large scale problems. Methods to support fast quantum circuit manipulations (e.g.~gate replacement, wire reordering, etc.) or specific circuit analysis operations have not been considered important and have been often implemented in a naive manner thus far. For example, quantum circuits are usually represented in term of one-dimensional gate lists or as directed acyclic graphs. Although implementations for quantum circuit manipulations are often only of polynomial complexity, the sheer number of possibilities to consider with increasing scales of quantum computations make these representations highly inefficient -- constituting a serious bottleneck. At the same time, quantum circuits have structural characteristics, which allow for more specific and faster approaches. This work utilises these characteristics by introducing a dedicated representation for large quantum circuits, namely wire label reference diagrams. We apply the representation to a set of very common circuit transformations, and develop corresponding solutions which achieve orders of magnitude performance improvements for circuits which include up to 80 000 qubits and 200 000 gates. The implementation of the proposed method is available online.
References in corpus (13)
- Elementary gates for quantum computation
- Surface codes: Towards practical large-scale quantum computation
- A new quantum ripple-carry addition circuit
- Synthesis and Optimization of Reversible Circuits - A Survey
- Quantum Circuit Simplification and Level Compaction
- Quantum circuits of T-depth one
- Local and Distributed Quantum Computation
- Fast simulation of stabilizer circuits using a graph state representation
- Fault-Tolerant High Level Quantum Circuits: Form, Compilation and Description
- Consistently faster and smaller compressed bitmaps with Roaring
- Time-optimal quantum computation
- Wire Recycling for Quantum Circuit Optimization
- Quantum Vertex Model for Reversible Classical Computing