The complexity of quantum circuit mapping with fixed parameters
From MaRDI portal
Publication:2102776
DOI10.1007/S11128-022-03698-0OpenAlexW4307648408MaRDI QIDQ2102776FDOQ2102776
Authors: Pengcheng Zhu, Shenggen Zheng, Lihua Wei, Shiguang Feng, Xueyun Cheng, Zhi-jin Guan 
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
Recommendations
- Qubits' mapping and routing for NISQ on variability of quantum gates
- An exact qubit allocation approach for NISQ architectures
- Analyzing heuristic-based randomized search strategies for the quantum circuit compilation problem
- Quantum circuit optimization by changing the gate order for 2D nearest neighbor architectures
- Mapping from multiple-control Toffoli circuits to linear nearest neighbor quantum circuits
Applications of graph theory (05C90) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)
Cites Work
- Title not available (Why is that?)
- Parametrized complexity theory.
- Hamilton Paths in Grid Graphs
- Some simplified NP-complete graph problems
- Title not available (Why is that?)
- Quantum advantage with shallow circuits
- Hamiltonian properties of triangular grid graphs
- Fundamentals of Computation Theory
- Efficient distributed quantum computing
- Exact global reordering for nearest neighbor quantum circuits using \({\mathrm {A}}^{*}\)
- Title not available (Why is that?)
- Qubit Mapping Based on Subgraph Isomorphism and Filtered Depth-Limited Search
Cited In (4)
This page was built for publication: The complexity of quantum circuit mapping with fixed parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102776)
