TILens turns technical updates into a focused daily brief: official releases,
trusted reporting, and practitioner analysis, deduplicated and organized by topic.
arXiv:2610.02101v1 Announce Type: cross Abstract: We prove near-optimal time-space lower bounds for breaking quantum cryptography in the random oracle model. Specifically, we show that a $T$-query adversary with $S$…
arXiv:2610.00527v1 Announce Type: cross Abstract: Local-unitary (LU) equivalence asks whether two quantum states differ only by independent changes of basis on their qubits. For graph states, whether this relation can…
arXiv:2610.00847v1 Announce Type: cross Abstract: The equalities IP = PSPACE and QIP = PSPACE, the latter achievable with three messages, raise a basic question: how much of an interactive proof's power comes from the…
arXiv:2605.12615v2 Announce Type: replace-cross Abstract: We study the computational complexity of quantum state isomorphism problems under group actions: given two quantum circuits that prepare pure or mixed states,…
arXiv:2610.01848v1 Announce Type: cross Abstract: Random Clifford operators have numerous applications in quantum computing, including randomized benchmarking, classical shadows, and quantum authentication. However,…
arXiv:2610.01639v1 Announce Type: new Abstract: Strassen showed that two 2x2 matrices can be multiplied with 7 multiplications instead of 8. Applied recursively, his algorithm multiplies two nxn matrices with O(n^2.807)…
arXiv:2610.02166v1 Announce Type: cross Abstract: We introduce a method for studying state preparation complexity in dense quantum $p$-spin Hamiltonians on $n$ qubits, going beyond bounds based only on circuit…
arXiv:2610.00525v1 Announce Type: cross Abstract: Sipser and Spielman constructed LDPC codes from either bipartite \emph{spectral} expanders or one-sided \emph{lossless} expanders. In higher dimensions, \emph{spectral}…
arXiv:2610.00837v1 Announce Type: new Abstract: For every constant-width CNF, we show that linear degree in polynomial calculus (PC) implies exponential size in resolution over constant-degree polynomials, over the same…
arXiv:2604.27787v4 Announce Type: replace Abstract: We study when a sound arithmetic theory $\mathcal S{\supseteq}S^1_2$ with polynomial-time decidable axioms has polynomial-size proofs of $Con_{\mathcal S{+}\phi}(n)$…
arXiv:2609.40334v2 Announce Type: replace Abstract: Time and space (memory) are two of the most important measures of cost in computation, even more so for quantum computation. Yet, our tools for proving unconditional…
arXiv:2610.00506v1 Announce Type: cross Abstract: We study quantum query complexity under several models of imperfect oracle access, and develop lower bounds through a common framework based on fractional block…
arXiv:2610.02133v1 Announce Type: cross Abstract: Transducers (Belovs, Jeffery and Yolcu, 2024) are a quantum computing framework describing a quantum algorithm as a unitary converting an input state into a target state…
arXiv:2610.00079v1 Announce Type: new Abstract: Holographic algorithms solve planar counting problems by encoding each value of a finite domain into several Boolean matchgate wires. Base collapse asks whether every…
arXiv:2602.07503v2 Announce Type: replace Abstract: We study the extremal Forrelation problem, where, provided with oracle access to Boolean functions $f$ and $g$ promised to satisfy either $\operatorname{forr}(f,g)=1$…
arXiv:2610.02154v1 Announce Type: cross Abstract: In this work we study the robustness of $\mathsf{QAC}^0$ with respect to error tolerance and modifications to its gate-set. First, we investigate whether the non-zero…
arXiv:2609.40310v2 Announce Type: replace-cross Abstract: The planted clique problem is a promising candidate for quantum advantage with a wide computational-statistical gap and substantial evidence for classical…
arXiv:2610.00081v1 Announce Type: new Abstract: We prove a complexity dichotomy for Boolean Holant problems defined by arbitrary finite sets of algebraic complex-valued signatures. The tractable cases are characterized…
arXiv:2610.00828v1 Announce Type: new Abstract: We prove a complexity classification of counting planar graph homomorphisms with non-negative weights. For a real symmetric matrix $M$ with non-negative entries, the…
arXiv:2607.01843v2 Announce Type: cross Abstract: Block encodings are a basic interface between quantum algorithms and linear algebra. Standard LCU constructions achieve optimal circuit depth but typically require…