scientific article; zbMATH DE number 7559364
From MaRDI portal
Publication:5089148
DOI10.4230/LIPICS.TQC.2019.3MaRDI QIDQ5089148FDOQ5089148
Cem Ünsal, Eddie Schoute, Andrew M. Childs
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1902.09102
Title of this publication is not available (Why is that?)
Cites Work
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- The generalized hierarchical product of graphs
- Sorting in \(c \log n\) parallel steps
- Synthesis of quantum circuits for linear nearest neighbor architectures
- Routing Permutations on Graphs via Matchings
- Sorting networks on restricted topologies
- Toward the first quantum simulation with quantum speedup
- New results on routing via matchings on graphs
- Swapping labeled tokens on graphs
- Efficient distributed quantum computing
- Complexity of token swapping and its variants
- Optimal Bounds for Matching Routing on Trees
- Optimal Quantum Circuits for Nearest-Neighbor Architectures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Quantum circuit physical design methodology with emphasis on physical synthesis 👍 👎
- Quantum Circuit Simulation 👍 👎
- Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms 👍 👎
- Transformation rules for CNOT-based quantum circuits and their applications 👍 👎
- Quantum gates and circuits 👍 👎
- Quantum circuits synthesis using Householder transformations 👍 👎
- Quantum circuit design for accurate simulation of qudit channels 👍 👎
- Quantum circuit for the fast Fourier transform 👍 👎
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089148)
