License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.DISC.2020.43
URN: urn:nbn:de:0030-drops-131217
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/13121/
Go to the corresponding LIPIcs Volume Portal


Fraigniaud, Pierre ; Le Gall, François ; Nishimura, Harumichi ; Paz, Ami

Brief Announcement: Distributed Quantum Proofs for Replicated Data

pdf-format:
LIPIcs-DISC-2020-43.pdf (0.3 MB)


Abstract

This paper tackles the issue of checking that all copies of a large data set replicated at several nodes of a network are identical. The fact that the replicas may be located at distant nodes prevents the system from verifying their equality locally, i.e., by having each node consult only nodes in its vicinity. On the other hand, it remains possible to assign certificates to the nodes, so that verifying the consistency of the replicas can be achieved locally. However, we show that, as the replicated data is large, classical certification mechanisms, including distributed Merlin-Arthur protocols, cannot guarantee good completeness and soundness simultaneously, unless they use very large certificates. The main result of this paper is a distributed quantum Merlin-Arthur protocol enabling the nodes to collectively check the consistency of the replicas, based on small certificates, and in a single round of message exchange between neighbors, with short messages. In particular, the certificate-size is logarithmic in the size of the data set, which gives an exponential advantage over classical certification mechanisms.

BibTeX - Entry

@InProceedings{fraigniaud_et_al:LIPIcs:2020:13121,
  author =	{Pierre Fraigniaud and Fran{\c{c}}ois Le Gall and Harumichi Nishimura and Ami Paz},
  title =	{{Brief Announcement: Distributed Quantum Proofs for Replicated Data}},
  booktitle =	{34th International Symposium on Distributed Computing (DISC 2020)},
  pages =	{43:1--43:3},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-168-9},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{179},
  editor =	{Hagit Attiya},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/13121},
  URN =		{urn:nbn:de:0030-drops-131217},
  doi =		{10.4230/LIPIcs.DISC.2020.43},
  annote =	{Keywords: Quantum Computing, Distributed Network Computing, Algorithmic Aspects of Networks}
}

Keywords: Quantum Computing, Distributed Network Computing, Algorithmic Aspects of Networks
Collection: 34th International Symposium on Distributed Computing (DISC 2020)
Issue Date: 2020
Date of publication: 07.10.2020


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI