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 (39)
- MQT Bench: Benchmarking Software and Design Automation Tools for Quantum Computing
- Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware
- Optimality Study of Existing Quantum Computing Layout Synthesis Tools
- Phase Gadget Synthesis for Shallow Circuits
- Domain wall encoding of discrete variables for quantum annealing and QAOA
- A Hardware-Aware Heuristic for the Qubit Mapping Problem in the NISQ Era
- The ZX calculus is a language for surface code lattice surgery
- staq -- A full-stack quantum processing toolkit
- Quantum Volume in Practice: What Users Can Expect from NISQ Devices
- Qubit Mapping Based on Subgraph Isomorphism and Filtered Depth-Limited Search
- Dynamical mean field theory algorithm and experiment on quantum computers
- MoG-VQE: Multiobjective genetic variational quantum eigensolver
- Application-Motivated, Holistic Benchmarking of a Full Quantum Computing Stack
- Grammar-aware sentence classification on quantum computers
- A hybrid classical-quantum workflow for natural language processing
- Quantum Circuit Compiler for a Shuttling-Based Trapped-Ion Quantum Computer
- Toward a 2D Local Implementation of Quantum LDPC Codes
- Improving Quantum Computation by Optimized Qubit Routing
- Orchestrated Trios: Compiling for Efficient Communication in Quantum Programs with 3-Qubit Gates
- Architecture-Aware Synthesis of Phase Polynomials for NISQ Devices
- Topological-Graph Dependencies and Scaling Properties of a Heuristic Qubit-Assignment Algorithm
- Architecture aware compilation of quantum circuits via lazy synthesis
- Integration of Quantum Accelerators with High Performance Computing -- A Review of Quantum Programming Tools
- Discovering optimal fermion-qubit mappings through algorithmic enumeration
- Volumetric Benchmarking of Error Mitigation with Qermit
- Pauli Fusion: a Computational Model to Realise Quantum Transformations from ZX Terms
- Hardware-Conscious Optimization of the Quantum Toffoli Gate
- Supervised Learning Enhanced Quantum Circuit Transformation
- A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz
- Quantum linear network coding for entanglement distribution in restricted architectures
- Fast simulation of quantum algorithms using circuit optimization
- Methods for Classically Simulating Noisy Networked Quantum Architectures
- Quantum Circuit Transformation: A Monte Carlo Tree Search Framework
- Quantum Circuit Transformation Based on Tabu Search
- Quantum Theory from Principles, Quantum Software from Diagrams
- Global Synthesis of CNOT Circuits with Holes
- A Category of Surface-Embedded Graphs
- Quantum Circuits in Additive Hilbert Space
- Special-Purpose Quantum Processor Design