scientific article; zbMATH DE number 7559364
From MaRDI portal
DOI10.4230/LIPIcs.TQC.2019.3MaRDI QIDQ5089148
Cem Ünsal, Eddie Schoute, Andrew M. Childs
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1902.09102
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Improving quantum computation by optimized qubit routing, Unnamed Item, The complexity of quantum circuit mapping with fixed parameters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Synthesis of quantum circuits for linear nearest neighbor architectures
- Complexity of token swapping and its variants
- The generalized hierarchical product of graphs
- Sorting in \(c \log n\) parallel steps
- New results on routing via matchings on graphs
- Sorting networks on restricted topologies
- Swapping labeled tokens on graphs
- Optimal Quantum Circuits for Nearest-Neighbor Architectures
- Optimal Bounds for Matching Routing on Trees
- Routing Permutations on Graphs via Matchings
- Toward the first quantum simulation with quantum speedup
- Efficient distributed quantum computing
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
