Qubit mapping of one-way quantum computation patterns onto 2D nearest-neighbor architectures
From MaRDI portal
Publication:669935
DOI10.1007/s11128-019-2177-xzbMath1409.81032OpenAlexW2910377499WikidataQ128567500 ScholiaQ128567500MaRDI QIDQ669935
Naser Mohammadzadeh, Sajjad Sanaei
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
Quantum computation (81P68) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Mathematical problems of computer architecture (68M07) Quantum coherence, entanglement, quantum correlations (81P40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Automatic translation of quantum circuits to optimized one-way quantum computation patterns
- Quantum circuit physical design methodology with emphasis on physical synthesis
- Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations
- Quantum Computation and Quantum Information
- The measurement calculus
- AN INTRODUCTION TO ONE-WAY QUANTUM COMPUTING IN DISTRIBUTED ARCHITECTURES
- Quantum Computing
This page was built for publication: Qubit mapping of one-way quantum computation patterns onto 2D nearest-neighbor architectures