Papers
Topics
Authors
Recent
Search
2000 character limit reached

Resource analysis for quantum-aided Byzantine agreement with the four-qubit singlet state

Published 11 Jul 2022 in quant-ph | (2207.04939v2)

Abstract: In distributed computing, a Byzantine fault is a condition where a component behaves inconsistently, showing different symptoms to different components of the system. Consensus among the correct components can be reached by appropriately crafted communication protocols even in the presence of byzantine faults. Quantum-aided protocols built upon distributed entangled quantum states are worth considering, as they are more resilient than traditional ones. Based on earlier ideas, here we establish a parameter-dependent family of quantum-aided weak broadcast protocols. We compute upper bounds on the failure probability of the protocol, and define and illustrate a procedure that minimizes the quantum resource requirements. Following earlier work demonstrating the suitability of noisy intermediate scale quantum (NISQ) devices for the study of quantum networks, we experimentally create our resource quantum state on publicly available quantum computers. Our work highlights important engineering aspects of the future deployment of quantum communication protocols with multi-qubit entangled states.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (30)
  1. M. Pease, R. Shostak and L. Lamport “Reaching Agreement in the Presence of Faults” In J. ACM 27, 1980, pp. 228–234 DOI: 10.1145/322186.322188
  2. Matthias Fitzi “Generalized Communication and Security Models in Byzantine Agreement” Reprint as vol. 4 of ETH Series in Information Security and Cryptography, ISBN 3-89649-853-3, Hartung-Gorre Verlag, Konstanz, 2003, 2003
  3. Leslie Lamport, Robert Shostak and Marshall Pease “The Byzantine Generals Problem” In ACM Trans. Program. Lang. Syst. 4, 1982, pp. 382–401 DOI: 10.1145/357172.357176
  4. “Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds” In SIAM Journal on Computing 27, 1999, pp. 247–290 DOI: 10.1137/S0097539794265232
  5. “Practical byzantine fault tolerance” In OSDI 99.1999, 1999, pp. 173–186
  6. “In Search of an Understandable Consensus Algorithm” In Proceedings of the 2014 USENIX Conference on USENIX Annual Technical Conference, USENIX ATC’14 USENIX Association, 2014, pp. 305–320
  7. Leslie Lamport “The Part-Time Parliament” In ACM Trans. Comput. Syst. 16, 1998, pp. 133–169 DOI: 10.1145/279227.279229
  8. “Unconditional Byzantine Agreement and Multi-Party Computation Secure against Dishonest Minorities from Scratch” In Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology, EUROCRYPT ’02 Springer-Verlag, 2002, pp. 482–501 DOI: 10.1007/3-540-46035-7_32
  9. Adán Cabello “Solving the liar detection problem using the four-qubit singlet state” In Phys. Rev. A 68, 2003, pp. 012304 DOI: 10.1103/PhysRevA.68.012304
  10. “Experimental Demonstration of a Quantum Protocol for Byzantine Agreement and Liar Detection” In Phys. Rev. Lett. 100, 2008, pp. 070504 DOI: 10.1103/PhysRevLett.100.070504
  11. “Modeling of measurement-based quantum network coding on a superconducting quantum processor” In Phys. Rev. A 101, 2020, pp. 052301 DOI: 10.1103/PhysRevA.101.052301
  12. Mohammand Amin Taherkhani, Keivan Navi and Rodney Van Meter “Resource-aware system architecture model for implementation of quantum aided Byzantine agreement on quantum repeater networks” In Quantum Science and Technology 3, 2017, pp. 014011 DOI: 10.1088/2058-9565/aa9bb1
  13. “Fast Quantum Byzantine Agreement” In Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, STOC ’05 New York, NY, USA: Association for Computing Machinery, 2005, pp. 481–485 DOI: https://doi.org/10.1145/1060590.1060662
  14. Matthias Fitzi, Nicolas Gisin and Ueli Maurer “Quantum Solution to the Byzantine Agreement Problem” In Phys. Rev. Lett. 87, 2001, pp. 217901 DOI: 10.1103/PhysRevLett.87.217901
  15. Stephanie Wehner, David Elkouss and Ronald Hanson “Quantum internet: A vision for the road ahead” In Science 362, 2018, pp. eaam9288 DOI: 10.1126/science.aam9288
  16. “Realization of a multinode quantum network of remote solid-state qubits” In Science 372, 2021, pp. 259–264 DOI: 10.1126/science.abg1919
  17. John Preskill “Quantum Computing in the NISQ era and beyond” In Quantum 2, 2018, pp. 79 DOI: 10.22331/q-2018-08-06-79
  18. “IBM Quantum”, https://quantum-computing.ibm.com/, 2021
  19. Christopher Monroe “IonQ Quantum Computers: Clear to Scale” In APS March Meeting Abstracts 2021, APS Meeting Abstracts, 2021, pp. P10.002
  20. “Microwave Quantum Link between Superconducting Circuits Housed in Spatially Separated Cryogenic Systems” In Phys. Rev. Lett. 125, 2020, pp. 260502 DOI: 10.1103/PhysRevLett.125.260502
  21. “Loophole-free Bell inequality violation with superconducting circuits” In Nature 617, 2023, pp. 265–270 DOI: https://doi.org/10.1038/s41586-023-05885-0
  22. “Modular entanglement of atomic qubits using photons and phonons” In Nature Physics 11, 2015, pp. 37–42 DOI: 10.1038/nphys3150
  23. “Entanglement of Trapped-Ion Qubits Separated by 230 Meters” In Phys. Rev. Lett. 130, 2023, pp. 050803 DOI: 10.1103/PhysRevLett.130.050803
  24. “High-Rate, High-Fidelity Entanglement of Qubits Across an Elementary Quantum Network” In Phys. Rev. Lett. 124, 2020, pp. 110501 DOI: 10.1103/PhysRevLett.124.110501
  25. Constantin Gonzalez “Cloud based QC with Amazon Braket” In Digitale Welt 5, 2021, pp. 14–17 DOI: 10.1007/s42354-021-0330-z
  26. “Detector tomography on IBM quantum computers and mitigation of an imperfect measurement” In Physical Review A 100, 2019, pp. 052315 DOI: 10.1103/PhysRevA.100.052315
  27. Filip B Maciejewski, Zoltán Zimborás and Michał Oszmaniec “Mitigation of readout noise in near-term quantum devices by classical post-processing based on detector tomography” In Quantum 4, 2020, pp. 257 DOI: https://doi.org/10.22331/q-2020-04-24-257
  28. “Device-Independent Security of Quantum Cryptography against Collective Attacks” In Phys. Rev. Lett. 98, 2007, pp. 230501 DOI: 10.1103/PhysRevLett.98.230501
  29. “Secure quantum key distribution with realistic devices” In Rev. Mod. Phys. 92, 2020, pp. 025002 DOI: 10.1103/RevModPhys.92.025002
  30. Akos Budai, Istvan Finta and Zoltán Guba “akosbudai/quantum-byzantine: v0.0.2” Zenodo, 2023 DOI: 10.5281/zenodo.10364755

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.