Quantum Consensus: an overview

• URL: http://arxiv.org/abs/2101.04192v1
• Date: Mon, 11 Jan 2021 21:10:06 GMT
• Title: Quantum Consensus: an overview
• Authors: Marco Marcozzi and Leonardo Mostarda
• Abstract summary: We report on a formal definition of quantum consensus and the protocols proposed. Proposals are classified according to the quantum feature used to achieve agreement.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We review the literature about reaching agreement in quantum networks, also called quantum consensus. After a brief introduction to the key feature of quantum computing, allowing the reader with no quantum theory background to have minimal tools to understand, we report a formal definition of quantum consensus and the protocols proposed. Proposals are classified according to the quantum feature used to achieve agreement.

Related papers

• Separable Power of Classical and Quantum Learning Protocols Through the Lens of No-Free-Lunch Theorem [70.42372213666553]
  The No-Free-Lunch (NFL) theorem quantifies problem- and data-independent generalization errors regardless of the optimization process. We categorize a diverse array of quantum learning algorithms into three learning protocols designed for learning quantum dynamics under a specified observable. Our derived NFL theorems demonstrate quadratic reductions in sample complexity across CLC-LPs, ReQu-LPs, and Qu-LPs. We attribute this performance discrepancy to the unique capacity of quantum-related learning protocols to indirectly utilize information concerning the global phases of non-orthogonal quantum states.
  arXiv  Detail & Related papers  (2024-05-12T09:05:13Z)
• Quantum repeaters: From quantum networks to the quantum internet [2.053047357590719]
  We review the conceptual frameworks and architectures for quantum repeaters. We discuss the various near-term proposals to overcome the limits to the communication rates set by point-to-point quantum communication.
  arXiv  Detail & Related papers  (2022-12-21T07:21:50Z)
• Oblivious Quantum Computation and Delegated Multiparty Quantum Computation [61.12008553173672]
  We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required. Exploiting quantum teleportation, we propose a two-server protocol for this task. Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
  arXiv  Detail & Related papers  (2022-11-02T09:01:33Z)
• Quantum Semantic Communications for Resource-Efficient Quantum Networking [52.3355619190963]
  This letter proposes a novel quantum semantic communications (QSC) framework exploiting advancements in quantum machine learning and quantum semantic representations. The proposed framework achieves approximately 50-75% reduction in quantum communication resources needed, while achieving a higher quantum semantic fidelity.
  arXiv  Detail & Related papers  (2022-05-05T03:49:19Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• Characterizing quantum ensemble using geometric measure of quantum coherence [1.5630592429258865]
  We propose a quantumness quantifier for the quantum ensemble. It satisfies the necessary axioms of a bonafide measure of quantumness. We compute the quantumness of a few well-known ensembles.
  arXiv  Detail & Related papers  (2021-04-19T07:37:27Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Quantum Candies and Quantum Cryptography [0.0]
  We investigate, extend, and much expand here "quantum candies" (invented by Jacobs), a pedagogical model for intuitively describing some basic concepts in quantum information. We explicitly demonstrate various additional quantum cryptography protocols using quantum candies in an approachable manner.
  arXiv  Detail & Related papers  (2020-11-03T21:01:08Z)
• Quantum information spreading in a disordered quantum walk [50.591267188664666]
  We design a quantum probing protocol using Quantum Walks to investigate the Quantum Information spreading pattern. We focus on the coherent static and dynamic disorder to investigate anomalous and classical transport. Our results show that a Quantum Walk can be considered as a readout device of information about defects and perturbations occurring in complex networks.
  arXiv  Detail & Related papers  (2020-10-20T20:03:19Z)
• Introduction to quantum radar [0.0]
  Several schemes for a quantum radar based upon the quantum illumination and others protocols are discussed. We review different concepts that have been introduced to overcome several of the inherent difficulties in the implementation of quantum generation and/or detection quantum sensing protocols for RADAR applications.
  arXiv  Detail & Related papers  (2020-06-25T08:12:08Z)
• Design and Analysis of Communication Protocols using Quantum Resources [0.0]
  This thesis is focused on the design and analysis of quantum communication protocols. Specifically, a specific attention of the present thesis is to study the quantum teleportation schemes with entangled and nonorthogonal states.
  arXiv  Detail & Related papers  (2020-02-19T17:03:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.