The complexity of quantum circuit mapping with fixed parameters

DOI10.1007/s11128-022-03698-0OpenAlexW4307648408MaRDI QIDQ2102776

Pengcheng Zhu, Shiguang Feng, Shenggen Zheng, Lihua Wei, Zhi-jin Guan, Xue-yun Cheng

Publication date: 9 December 2022

Published in: Quantum Information Processing (Search for Journal in Brave)

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

zbMATH Keywords

parameterized complexityNISQ devicequantum circuit transformationqubit mapping

Mathematics Subject Classification ID

Applications of graph theory (05C90) Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonian properties of triangular grid graphs
• Some simplified NP-complete graph problems
• Exact global reordering for nearest neighbor quantum circuits using \({\mathrm {A}}^{*}\)
• Parametrized complexity theory.
• Qubit Mapping Based on Subgraph Isomorphism and Filtered Depth-Limited Search
• Hamilton Paths in Grid Graphs
• Quantum advantage with shallow circuits
• Efficient distributed quantum computing
• Fundamentals of Computation Theory

This page was built for publication: The complexity of quantum circuit mapping with fixed parameters