On the qubit routing problem

DOI10.4230/LIPICS.TQC.2019.5MaRDI QIDQ5089151FDOQ5089151

Authors: Alexander Cowtan, Silas Dilkes, Ross Duncan, Alexandre Krajenbrink, Will Simmons, Seyon Sivarajah 

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/1902.08091

Recommendations

• A dynamic programming approach for distributing quantum circuits by bipartite graphs
• Routing strategy for distributed quantum circuit based on optimized gate transmission direction
• Improved cost-metric for nearest neighbor mapping of quantum circuits to 2-dimensional hexagonal architecture
• scientific article; zbMATH DE number 7559364
• Connectivity matrix model of quantum circuits and its application to distributed quantum circuit optimization

zbMATH Keywords

compilationquantum computingqubit routing

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Cycles in butterfly graphs
• An efficient conversion of quantum circuits to a linear nearest neighbor architecture
• The complexity of finding minimum-length generator sequences
• Efficient distributed quantum computing
• Complexity of token swapping and its variants

Cited In (14)

• Quantum routing in planar graph using perfect state transfer
• Improving quantum computation by optimized qubit routing
• Improved cost-metric for nearest neighbor mapping of quantum circuits to 2-dimensional hexagonal architecture
• A Category of Surface-Embedded Graphs
• Title not available (Why is that?)
• Approximate quantum gates compilation for superconducting transmon qubits with self-navigation algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Global Synthesis of CNOT Circuits with Holes
• A binary integer programming-based method for qubit mapping in sparse architectures
• Efficient routing quantum information in one-dimensional tight-binding array
• Highly optimized quantum circuits synthesized via data-flow engines
• A processor architecture design method for improving reusability of special-purpose superconducting quantum processor
• A novel quantum algorithm for converting between one-hot and binary encodings

This page was built for publication: On the qubit routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089151)