TILens turns technical updates into a focused daily brief: official releases,
trusted reporting, and practitioner analysis, deduplicated and organized by topic.
arXiv:2609.39768v1 Announce Type: cross Abstract: Certifying a deployed neural network raises decision problems that the verification literature has not classified: whether the model carries a backdoor planted in its…
arXiv:2609.39823v1 Announce Type: cross Abstract: We study quantum random self-reductions for linear problems over finite fields. Let $M\in\mathbb{F}^{n\times n}$ be an arbitrary matrix, and let $\mathcal{O}$ be an…
arXiv:2609.40334v1 Announce Type: new Abstract: Time and space (memory) are two of the most important measures of cost in computation, even more so for quantum computation. In quantum computation our tools for proving…
arXiv:2609.07090v2 Announce Type: replace-cross Abstract: Compressed quantum encodings aim to overcome hardware limitations towards tackling challenging problems at scale, with many classical variables mapped onto…
arXiv:2609.38436v1 Announce Type: cross Abstract: We determine the decidability of Karp's NP-complete problems on structures which are first-order definable over the theory of equality, also known as orbit-finite sets…
arXiv:2609.39668v1 Announce Type: cross Abstract: A $\mathsf{QMA}(2)$ protocol involves two provers submitting unentangled witnesses to a polynomial-time quantum verifier. In The Power of Unentanglement (ToC, 2009),…
arXiv:2609.39328v1 Announce Type: cross Abstract: Quantum information complexity (QIC), introduced by Touchette [Touchette, STOC 2015], has been shown to be one of the most powerful methods for proving quantum…
arXiv:2609.35927v2 Announce Type: replace Abstract: The problem to establish a lower bound for $\mbox{AC}^0[p]$-Frege refutations of a system of polynomial equations over ${\bf F}_p$ was in K. (2024) reduced to the…
arXiv:2609.23603v2 Announce Type: replace Abstract: We study SC derandomizations for regular read-once branching programs (ROBPs) and computation models beyond BPL. For regular ROBPs with length $n$, width $w$, and…
arXiv:2609.26678v2 Announce Type: replace Abstract: Quantum strong direct-product theorems for specific functions have been known for nearly two decades. These have been extended to general results for function…
arXiv:2501.18183v3 Announce Type: replace-cross Abstract: We introduce a novel framework for decentralized projection-free optimization, extending projection-free methods to a broader class of upper-linearizable…
arXiv:2609.39495v1 Announce Type: cross Abstract: Interactive proof systems with a laconic prover, studied by Goldreich, Vadhan, and Wigderson (CC, 2002), capture problems verifiable with logarithmic prover…
arXiv:2609.38704v1 Announce Type: cross Abstract: Recent works have demonstrated that quantum oracles have subtle behavior, as access to inverse, conjugate or controlled queries can exponentially change the query…
arXiv:2609.38910v1 Announce Type: new Abstract: We continue the study of the Stoquastic Local Hamiltonian problem, a physically motivated restriction of the QMA-complete Local Hamiltonian problem (Kitaev, Shen, and…
arXiv:2606.24471v2 Announce Type: replace-cross Abstract: We show that random linear codes (RLCs) possess nearly optimal discrepancy-type properties in a broad range of settings. Our main results are two general…
arXiv:2609.40182v1 Announce Type: cross Abstract: We develop a mixing time method for estimating the sample complexity of quantum state discrimination. We start with considering the minimum-error discrimination of…
arXiv:2609.40310v1 Announce Type: cross Abstract: The planted clique problem is a promising candidate for quantum advantage with a wide computational-statistical gap and substantial evidence for classical hardness. We…
arXiv:2609.40226v1 Announce Type: cross Abstract: Bosonic quantum systems are among the leading architectures for quantum information processing, offering continuous-variable degrees of freedom with strong…
arXiv:2609.40273v1 Announce Type: new Abstract: We give the first exponential quantum advantage in the general interactive three-party Numbers-on-Forehead (NOF) model for a decision problem. Previous separations hold…
arXiv:2606.30281v2 Announce Type: replace-cross Abstract: A central challenge in quantum algorithms and cryptography is reasoning about algorithms with oracle access to a random group element (e.g. a random function,…