Abstract
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.
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call