The complexity of quantum circuit mapping with fixed parameters
From MaRDI portal
Publication:2102776
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
Cites work
- scientific article; zbMATH DE number 5595151 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 7559364 (Why is no real title available?)
- Efficient distributed quantum computing
- Exact global reordering for nearest neighbor quantum circuits using \({\mathrm {A}}^{*}\)
- Fundamentals of Computation Theory
- Hamilton Paths in Grid Graphs
- Hamiltonian properties of triangular grid graphs
- Parametrized complexity theory.
- Quantum advantage with shallow circuits
- Qubit Mapping Based on Subgraph Isomorphism and Filtered Depth-Limited Search
- Some simplified NP-complete graph problems
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)