Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



LATEST > REPORTS:
RSS-FeedNext next

TR25-145 | 2nd October 2025
Sabee Grewal, William Kretschmer

Unentanglement and Post-Measurement Branching in Quantum Interactive Proofs

We investigate two resources whose effects on quantum interactive proofs remain poorly understood: the promise of unentanglement, and the verifier’s ability to condition on an intermediate measurement, which we call post-measurement branching. We first show that unentanglement can dramatically increase computational power: three-round unentangled quantum interactive proofs equal NEXP, even ... more >>>


TR25-144 | 7th October 2025
Siddhartha Jain, Vishnu Iyer, Rolando Somma, Ning Bao, Stephen Jordan

Efficient Quantum Hermite Transform

We present a new primitive for quantum algorithms that implements a discrete Hermite transform efficiently, in time that depends logarithmically in both the dimension and the inverse of the allowable error. This transform, which maps basis states to states whose amplitudes are proportional to the Hermite functions, can be interpreted ... more >>>


TR25-143 | 26th September 2025
Vladimir Podolskii, Morgan Prior

Alternation Depth of Threshold Decision Lists

Linear decision lists are a computational model for Boolean functions built from a sequence of linear threshold function queries. Each query is evaluated in order: if a query returns true, the list outputs the value of the function, and if the answer is false, the process continues to the next ... more >>>



Next next


ISSN 1433-8092 | Imprint