Quantum Route Selection based on Graph State
- 10.2991/icmmct-16.2016.224How to use a DOI?
- Quantum Route; Graph State; Local complementation; Local Pauli Measurement
Many quantum communication protocols involve multiple participants. With participants increasing, selecting designated legal participants in a nice way becomes more and more significant. In this paper, we develop a quantum route selection approach to the design of participant selection. Graph state is a special type of multi-particle entangled quantum state that can be represented by mathematical graph, where each vertex denotes a qubit and each edge denotes an Ising interaction. Motivated by the characteristics of graph state, we propose that each participant holds a vertex of graph state so that all legal participants are selected through a series of operations on specific vertices of graph state.
- © 2016, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Lei Yan AU - Peng Luo AU - Hanyu Cui AU - Ronghua Shi AU - Ying Guo PY - 2016/03 DA - 2016/03 TI - Quantum Route Selection based on Graph State BT - Proceedings of the 2016 4th International Conference on Machinery, Materials and Computing Technology PB - Atlantis Press SP - 1134 EP - 1138 SN - 2352-5401 UR - https://doi.org/10.2991/icmmct-16.2016.224 DO - 10.2991/icmmct-16.2016.224 ID - Yan2016/03 ER -