Quantum Distributed Complexity of Set Disjointness on a Line

Autor: Magniez, Frédéric, Nayak, Ashwin

Publikováno v: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Jul 2020, Saarbrücken, Germany. pp.82:1--82:18, ⟨10.4230/LIPIcs.ICALP.2020.82⟩

Set Disjointness on a Line is a variant of the Set Disjointness problem in a distributed computing scenario with $d+1$ processors arranged on a path of length $d$. It was introduced by Le Gall and Magniez (PODC 2018) for proving lower bounds on the q

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eddb5ca8968ce1f9e9470360a7958b69
https://doi.org/10.1145/3512751

Trade-Offs Between Entanglement and Communication

Autor: Arunachalam, Srinivasan, Girish, Uma

We study the advantages of quantum communication models over classical communication models that are equipped with a limited number of qubits of entanglement. In this direction, we give explicit partial functions on n bits for which reducing the enta

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8c3e614f3e4d57bb335066670af0e382

LIPIcs, Volume 232, TQC 2022, Complete Volume

Autor: Le Gall, François, Morimae, Tomoyuki

LIPIcs, Volume 232, TQC 2022, Complete Volume
LIPIcs, Vol. 232, 17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022), pages 1-218

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::43ed2169b65d36dcef28332cecb0f71a

Front Matter, Table of Contents, Preface, Conference Organization

Autor: Hsieh, Min-Hsiu

Front Matter, Table of Contents, Preface, Conference Organization
LIPIcs, Vol. 197, 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021), pages 0:i-0:xii

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::a0783f310208f339472de9a345bf862d

Distributed Quantum Proofs for Replicated Data

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

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,

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::21c7da8cd33cc78ff775d12cec20ce93
http://arxiv.org/abs/2002.10018