Zobrazeno 1 - 10
of 62
pro vyhledávání: '"Theory of computation ��� Quantum computation theory"'
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⟩
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
https://doi.org/10.1145/3512751
Autor:
Vilmart, Renaud
Publikováno v:
CSL 2023-31st EACSL Annual Conference on Computer Science Logic
CSL 2023-31st EACSL Annual Conference on Computer Science Logic, Feb 2023, Warsaw, Poland. pp.36:1--36:17, ⟨10.4230/LIPIcs.CSL.2023.36⟩
CSL 2023-31st EACSL Annual Conference on Computer Science Logic, Feb 2023, Warsaw, Poland. pp.36:1--36:17, ⟨10.4230/LIPIcs.CSL.2023.36⟩
The "Sum-Over-Paths" formalism is a way to symbolically manipulate linear maps that describe quantum systems, and is a tool that is used in formal verification of such systems. We give here a new set of rewrite rules for the formalism, and show that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6f409797f7f1aa24513ab22dc1a8be37
https://hal.science/hal-03654438v2/document
https://hal.science/hal-03654438v2/document
Autor:
Fawzi, Omar, Walter, Michael
LIPIcs, Volume 266, TQC 2023, Complete Volume
LIPIcs, Vol. 266, 18th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2023), pages 1-314
LIPIcs, Vol. 266, 18th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2023), pages 1-314
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2731b3761d9f5d936b5b809fa39dcc54
Many problems that can be solved in quadratic time have bit-parallel speed-ups with factor $w$, where $w$ is the computer word size. A classic example is computing the edit distance of two strings of length $n$, which can be solved in $O(n^2/w)$ time
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1abb36486f92cce9a95effe0ed04012f
We exhibit a strong connection between the matchgate formalism introduced by Valiant and the ZW-calculus of Coecke and Kissinger. This connection provides a natural compositional framework for matchgate theory as well as a direct combinatorial interp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::67b49775203b3780c680d5b1860cab55
Autor:
Aaronson, Scott, Grewal, Sabee
We give an efficient algorithm that learns a non-interacting-fermion state, given copies of the state. For a system of n non-interacting fermions and m modes, we show that O(m³ n² log(1/δ) / ε⁴) copies of the input state and O(m⁴ n² log(1/δ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd098897d1d485d045897c0a3726e844
Autor:
Dall'Agnol, Marcel, Spooner, Nicholas
Collapse binding and collapsing were proposed by Unruh (Eurocrypt '16) as post-quantum strengthenings of computational binding and collision resistance, respectively. These notions have been very successful in facilitating the "lifting" of classical
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dbfc3384bea00507146f8bae546b9a0d
Autor:
Fawzi, Omar, Walter, Michael
Front Matter, Table of Contents, Preface, Conference Organization
LIPIcs, Vol. 266, 18th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2023), pages 0:i-0:xii
LIPIcs, Vol. 266, 18th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2023), pages 0:i-0:xii
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0c341b3fb305388442bb8992c57aa7d6
Quantum secret sharing (QSS) allows a dealer to distribute a secret quantum state among a set of parties in such a way that certain authorized subsets can reconstruct the secret, while unauthorized subsets obtain no information about it. Previous wor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::651cea8100cf87310e7b274004fdb2e0
Publikováno v:
Theoretical Computer Science. 893:117-132
We study the effect of noise on the classical simulatability of quantum circuits defined by computationally tractable (CT) states and efficiently computable sparse (ECS) operations. Examples of such circuits, which we call CT-ECS circuits, are IQP, C
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::78dfe64710496d329ae652259be28499
https://doi.org/10.1016/j.tcs.2021.07.025
https://doi.org/10.1016/j.tcs.2021.07.025