Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



LATEST > REPORTS:
RSS-Feedprevious PreviousNext next

TR24-167 | 31st October 2024
François Le Gall, Yupan Liu, Harumichi Nishimura, Qisheng Wang

Space-bounded quantum interactive proof systems

Revisions: 2

We introduce two models of space-bounded quantum interactive proof systems, $\mathbf{QIPL}$ and $\mathbf{QIP_\mathrm{U}L}$. The $\mathbf{QIP_\mathrm{U}L}$ model, a space-bounded variant of quantum interactive proofs ($\mathbf{QIP}$) introduced by Watrous (CC 2003) and Kitaev and Watrous (STOC 2000), restricts verifier actions to unitary circuits. In contrast, $\mathbf{QIPL}$ allows logarithmically many intermediate measurements per ... more >>>


TR24-166 | 16th October 2024
John Bostanci, Yeongwoo Hwang

Commuting Local Hamiltonians Beyond 2D

Revisions: 1

Commuting local Hamiltonians provide a testing ground for studying many of the most interesting open questions in quantum information theory, including the quantum PCP conjecture and the existence of area laws. Although they are a simplified model of quantum computation, the status of the commuting local Hamiltonian problem remains largely ... more >>>


TR24-165 | 21st October 2024
Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman

Online Condensing of Unpredictable Sources via Random Walks

Revisions: 2

A natural model of a source of randomness consists of a long stream of symbols $X = X_1\circ\ldots\circ X_t$, with some guarantee on the entropy of $X_i$ conditioned on the outcome of the prefix $x_1,\dots,x_{i-1}$. We study unpredictable sources, a generalization of the almost Chor--Goldreich (CG) sources considered in [DMOZ23]. ... more >>>



previous PreviousNext next


ISSN 1433-8092 | Imprint