TY - GEN
T1 - Agreeing over quantum hybrid networks
T2 - 2016 Australian Control Conference, AuCC 2016
AU - Shi, Guodong
AU - Li, Bo
AU - Miao, Zibo
AU - Dower, Peter M.
AU - James, Matthew R.
N1 - Publisher Copyright:
© 2016 Engineers Australia.
PY - 2017/3/1
Y1 - 2017/3/1
N2 - Quantum hybrid networks where classical and quantum components coexist play a fundamental role in quantum communications. We consider a basic quantum hybrid network model consisting of a number of nodes each holding a qubit, for which the aim is to drive the network to a consensus in the sense that all qubits reach a common state. Projective measurements are applied serving as control means, and the measurement results are exchanged among the nodes via classical communication channels. We show how to carry out centralized optimal path planning for the network with all-to-all classical communications, in which case the problem becomes a stochastic optimal control problem with a continuous action space. To overcome the computation and communication obstacles facing the centralized solutions, we also develop a distributed Pairwise Qubit Projection (PQP) algorithm, where pairs of nodes meet at a given time and respectively perform measurements at their geometric average. We show that the qubit states are driven to a consensus almost surely along the proposed PQP algorithm, and that the expected qubit density operators converge to the average of the network's initial values.
AB - Quantum hybrid networks where classical and quantum components coexist play a fundamental role in quantum communications. We consider a basic quantum hybrid network model consisting of a number of nodes each holding a qubit, for which the aim is to drive the network to a consensus in the sense that all qubits reach a common state. Projective measurements are applied serving as control means, and the measurement results are exchanged among the nodes via classical communication channels. We show how to carry out centralized optimal path planning for the network with all-to-all classical communications, in which case the problem becomes a stochastic optimal control problem with a continuous action space. To overcome the computation and communication obstacles facing the centralized solutions, we also develop a distributed Pairwise Qubit Projection (PQP) algorithm, where pairs of nodes meet at a given time and respectively perform measurements at their geometric average. We show that the qubit states are driven to a consensus almost surely along the proposed PQP algorithm, and that the expected qubit density operators converge to the average of the network's initial values.
UR - http://www.scopus.com/inward/record.url?scp=85016980711&partnerID=8YFLogxK
U2 - 10.1109/AUCC.2016.7868180
DO - 10.1109/AUCC.2016.7868180
M3 - Conference contribution
T3 - 2016 Australian Control Conference, AuCC 2016
SP - 159
EP - 161
BT - 2016 Australian Control Conference, AuCC 2016
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 3 November 2016 through 4 November 2016
ER -