Algorithmic theory of qubit routing

DOI10.1007/978-3-031-38906-1_35arXiv2305.02059OpenAlexW4385317398MaRDI QIDQ6179439

Naoyuki Kamiyama, Naonori Kakimura, Yusuke Kobayashi, Yoshio Okamoto, Takehiro Ito

Publication date: 16 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

fixed-parameter tractabilityqubit allocationqubit routing

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Cites Work

• Unnamed Item
• Synthesis of quantum circuits for linear nearest neighbor architectures
• Complexity of token swapping and its variants
• Some simplified NP-complete graph problems
• Swapping labeled tokens on graphs
• Mathematical formulation of quantum circuit design problems in networks of quantum computers
• Quantum circuit for the fast Fourier transform
• The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant

This page was built for publication: Algorithmic theory of qubit routing