TY - JOUR

T1 - Resource-aware system architecture model for implementation of quantum aided byzantine agreement on quantum repeater networks

AU - Amin Taherkhani, M.

AU - Navi, Keivan

AU - van Meter, Rodney

N1 - Publisher Copyright:
Copyright © 2017, The Authors. All rights reserved.
Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.

PY - 2017/1/17

Y1 - 2017/1/17

N2 - Quantum aided Byzantine agreement (QBA) is an important distributed quantum algorithm with unique features in comparison to classical deterministic and randomized algorithms, requiring only a constant expected number of rounds in addition to giving a higher level of security. In this paper, we analyze details of the high level multi-party algorithm, and propose elements of the design for the quantum architecture and circuits required at each node to run the algorithm on a quantum repeater network. Our optimization techniques have reduced the quantum circuit depth by 44% and the number of qubits in each node by 20% for a minimum five-node setup compared to the design based on the standard arithmetic circuits. These improvements lead to a quantum system architecture with 160 qubits per node, space-time product (an estimate of the required fidelity) KQ ≈ 1.3 × 105 per node and error threshold 1.1 × 10−6 for the total nodes in the network. The evaluation of the designed architecture shows that to execute the algorithm once on the minimum setup, we need to successfully distribute a total of 648 Bell pairs across the network, spread evenly between all pairs of nodes. This framework can be considered a starting point for establishing a road-map for light-weight demonstration of a distributed quantum application on quantum repeater networks.

AB - Quantum aided Byzantine agreement (QBA) is an important distributed quantum algorithm with unique features in comparison to classical deterministic and randomized algorithms, requiring only a constant expected number of rounds in addition to giving a higher level of security. In this paper, we analyze details of the high level multi-party algorithm, and propose elements of the design for the quantum architecture and circuits required at each node to run the algorithm on a quantum repeater network. Our optimization techniques have reduced the quantum circuit depth by 44% and the number of qubits in each node by 20% for a minimum five-node setup compared to the design based on the standard arithmetic circuits. These improvements lead to a quantum system architecture with 160 qubits per node, space-time product (an estimate of the required fidelity) KQ ≈ 1.3 × 105 per node and error threshold 1.1 × 10−6 for the total nodes in the network. The evaluation of the designed architecture shows that to execute the algorithm once on the minimum setup, we need to successfully distribute a total of 648 Bell pairs across the network, spread evenly between all pairs of nodes. This framework can be considered a starting point for establishing a road-map for light-weight demonstration of a distributed quantum application on quantum repeater networks.

KW - Byzantine Agreement

KW - Distributed Quantum Algorithms

KW - Quantum Repeater Network (QRN)

UR - http://www.scopus.com/inward/record.url?scp=85093210954&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85093210954&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:85093210954

JO - Mathematical Social Sciences

JF - Mathematical Social Sciences

SN - 0165-4896

ER -