Quantum Time Lower Bounds
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Quantum Time Lower Bounds by Permutation Invariance
arXiv:2606.05099v1 Announce Type: cross Abstract: Tight bounds on quantum sample complexity and quantum query complexity have been known for various computational problems in the literature, whereas tight bounds on quantum time complexity (i.e., the size of quantum circuits) remain unresolved. In this paper, we provide a framework to establish lower bounds on the quantum time complexity for testing permutation-invariant properties of quantum states, via a reduction from quantum sample...
Collision Resistance of Single-Layer Neural Nets
arXiv:2606.03807v1 Announce Type: new Abstract: We initiate the study of the algorithmic complexity of finding collisions in single-layer binary neural networks. Given a random matrix $\mathbf{A} \in \mathbb{R}^{m\times n}$, an input $\mathbf{x} \in \{-1,1\}^n$ is mapped to a binary output vector $\varphi(\mathbf{A}\mathbf{x})\in \{-1,1\}^m$, where $\varphi$ is an activation function with constant behavior on $[\kappa, \infty)$ for some threshold $\kappa \geq 0$. We identify the threshold...
Quantum Algorithms for Triangle Cut Sparsification
arXiv:2606.06287v1 Announce Type: cross Abstract: Triangles capture higher-order structures in graphs and are fundamental to applications such as clustering and network analysis. To enable efficient use of such structures at scale, we study the problem of \emph{triangle cut sparsification}, which aims to reduce the graph size while approximately preserving triangle counts across every cut. We investigate \emph{quantum algorithms} for this problem, using triangle listing as our main technical...
Quantum Algorithms for Triangle Cut Sparsification
arXiv:2606.06287v2 Announce Type: replace-cross Abstract: Triangles capture higher-order structures in graphs and are fundamental to applications such as clustering and network analysis. To enable efficient use of such structures at scale, we study the problem of triangle cut sparsification, which aims to reduce the graph size while approximately preserving triangle counts across every cut. We investigate quantum algorithms for this problem, using triangle listing as our main technical...
Light-induced quantum friction of carbon nanotubes in water
Abstract Friction slows down moving objects at both macroscopic and microscopic scales1. At the electronic level, quantum friction describes direct transfer of momentum between a liquid and the electrons of a solid2. Owing to its microscopic nature, this phenomenon remains experimentally challenging to capture3.
Fast TetraBFT: Optimizing Latency Where It Matters
Announce Type: new Abstract: Unauthenticated Byzantine consensus protocols achieve optimal failure resilience while relying only on authenticated point-to-point channels, not authenticated messages. They are an attractive building block for blockchains that do not mandate symmetric trust assumptions as well as for future post-quantum settings. We consider unauthenticated Byzantine consensus in partially synchronous networks and focus on optimizing its good-case latency - the worst-case time...
Superintelligence: The Idea That Eats Smart People (2016)
This is the text version of a talk I gave on October 29, 2016, at Web Camp Zagreb [video] (45 mins) SuperintelligenceThe Idea That Eats Smart People | | | In 1945, as American physicists were preparing to test the atomic bomb, it occurred to someone to ask if such a test could set the atmosphere on fire. This was a legitimate concern.