Reaching Agreement in Quantum Hybrid Networks
Abstract 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 measuremen...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Nature Publishing Group
2017-07-01
|
Series: | Scientific Reports |
Online Access: | https://doi.org/10.1038/s41598-017-05158-7 |
id |
doaj-28ab0592a5554d68b130466e64c6a44b |
---|---|
record_format |
Article |
spelling |
doaj-28ab0592a5554d68b130466e64c6a44b2020-12-08T02:12:33ZengNature Publishing GroupScientific Reports2045-23222017-07-01711910.1038/s41598-017-05158-7Reaching Agreement in Quantum Hybrid NetworksGuodong Shi0Bo Li1Zibo Miao2Peter M. Dower3Matthew R. James4Research School of Engineering, Australian National UniversityKey Lab of Mathematics Mechanization, Chinese Academy of SciencesDepartment of Electrical & Electronic Engineering, The University of MelbourneDepartment of Electrical & Electronic Engineering, The University of MelbourneResearch School of Engineering, Australian National UniversityAbstract 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. In this way the quantum-opeartion/classical-communication nature of hybrid quantum networks is captured, although coherent states and joint operations are not taken into consideration in order to facilitate a clear and explicit analysis. We show how to carry out centralized optimal path planning for this 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.https://doi.org/10.1038/s41598-017-05158-7 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Guodong Shi Bo Li Zibo Miao Peter M. Dower Matthew R. James |
spellingShingle |
Guodong Shi Bo Li Zibo Miao Peter M. Dower Matthew R. James Reaching Agreement in Quantum Hybrid Networks Scientific Reports |
author_facet |
Guodong Shi Bo Li Zibo Miao Peter M. Dower Matthew R. James |
author_sort |
Guodong Shi |
title |
Reaching Agreement in Quantum Hybrid Networks |
title_short |
Reaching Agreement in Quantum Hybrid Networks |
title_full |
Reaching Agreement in Quantum Hybrid Networks |
title_fullStr |
Reaching Agreement in Quantum Hybrid Networks |
title_full_unstemmed |
Reaching Agreement in Quantum Hybrid Networks |
title_sort |
reaching agreement in quantum hybrid networks |
publisher |
Nature Publishing Group |
series |
Scientific Reports |
issn |
2045-2322 |
publishDate |
2017-07-01 |
description |
Abstract 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. In this way the quantum-opeartion/classical-communication nature of hybrid quantum networks is captured, although coherent states and joint operations are not taken into consideration in order to facilitate a clear and explicit analysis. We show how to carry out centralized optimal path planning for this 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. |
url |
https://doi.org/10.1038/s41598-017-05158-7 |
work_keys_str_mv |
AT guodongshi reachingagreementinquantumhybridnetworks AT boli reachingagreementinquantumhybridnetworks AT zibomiao reachingagreementinquantumhybridnetworks AT petermdower reachingagreementinquantumhybridnetworks AT matthewrjames reachingagreementinquantumhybridnetworks |
_version_ |
1724393934519533568 |