Qubit mapping of one-way quantum computation patterns onto 2D nearest-neighbor architectures
DOI10.1007/S11128-019-2177-XzbMATH Open1409.81032OpenAlexW2910377499WikidataQ128567500 ScholiaQ128567500MaRDI QIDQ669935FDOQ669935
Authors: Sajjad Sanaei, Naser Mohammadzadeh 
Publication date: 15 March 2019
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-019-2177-x
Recommendations
- Design of efficient quantum circuits using nearest neighbor constraint in 2D architecture
- Optimization of one-way quantum computation measurement patterns
- Automatic translation of quantum circuits to optimized one-way quantum computation patterns
- An efficient conversion of quantum circuits to a linear nearest neighbor architecture
- The measurement calculus
Quantum computation (81P68) Quantum coherence, entanglement, quantum correlations (81P40) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Mathematical problems of computer architecture (68M07)
Cites Work
- Quantum computation and quantum information. 10th anniversary edition
- Principles of quantum computation and information. Vol. II: Basic tools and special topics.
- Quantum Computing
- Quantum circuit physical design methodology with emphasis on physical synthesis
- Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations
- The measurement calculus
- Extended measurement calculus
- Automatic translation of quantum circuits to optimized one-way quantum computation patterns
- An introduction to one-way quantum computing in distributed architectures
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: Qubit mapping of one-way quantum computation patterns onto 2D nearest-neighbor architectures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q669935)
