On the qubit routing problem

DOI10.4230/LIPICS.TQC.2019.5MaRDI QIDQ5089151zbMATH OpenFDO

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

zbMATH Keywords

compilationquantum computingqubit routing

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(19)

• Pauli fusion: a computational model to realise quantum transformations from ZX terms
• scientific article; zbMATH DE number 7453183 (Why is no real title available?)
• scientific article; zbMATH DE number 7496272 (Why is no real title available?)
• Efficient routing quantum information in one-dimensional tight-binding array
• Efficient Realization of Toffoli and NCV Circuits for IBM QX Architectures
• Implementing NChooseK on IBM Q Quantum Computer Systems
• A polarity-based approach for optimization of multivalued quantum multiplexers with arbitrary single-qubit target gates
• Approximate quantum gates compilation for superconducting transmon qubits with self-navigation algorithm
• Quantum routing in planar graph using perfect state transfer
• Highly optimized quantum circuits synthesized via data-flow engines
• Improved cost-metric for nearest neighbor mapping of quantum circuits to 2-dimensional hexagonal architecture
• A Category of Surface-Embedded Graphs
• Improving quantum computation by optimized qubit routing
• Global Synthesis of CNOT Circuits with Holes
• 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
• A binary integer programming-based method for qubit mapping in sparse architectures
• Parallel token swapping for qubit routing
• Architecture-aware synthesis of phase polynomials for NISQ devices

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)