On the qubit routing problem
arXiv:1902.08091 · doi:10.4230/LIPIcs.TQC.2019.5
Abstract
We introduce a new architecture-agnostic methodology for mapping abstract quantum circuits to realistic quantum computing devices with restricted qubit connectivity, as implemented by Cambridge Quantum Computing's tket compiler. We present empirical results showing the effectiveness of this method in terms of reducing two-qubit gate depth and two-qubit gate count, compared to other implementations.
v2: wrong chart replaced with correct version; minor edits for clarity
Cited by in corpus (8)
- Dynamical mean field theory algorithm and experiment on quantum computers
- MoG-VQE: Multiobjective genetic variational quantum eigensolver
- Orchestrated Trios: Compiling for Efficient Communication in Quantum Programs with 3-Qubit Gates
- A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz
- Global Synthesis of CNOT Circuits with Holes
- Quantum Theory from Principles, Quantum Software from Diagrams
- Quantum Circuits in Additive Hilbert Space
- Special-Purpose Quantum Processor Design