arXiv:2607. 12780v1 Announce Type: cross Abstract: Quantum circuit optimization for fault-tolerant computing requires exact functional equivalence while minimizing expensive non-Clifford resources such as T gates.
arXiv:2606. 11673v1 Announce Type: cross Abstract: Standard dot-product self-attention computes, in a single layer, only pairwise (order-2) interactions between tokens; representing a generic order-$k$ interaction is known to require either super-quadratic resources in one layer or composition across depth.
arXiv:2605. 30952v2 Announce Type: replace Abstract: Two recent results have reshaped quantum Gaussian processes (QGPs).
Quantum circuit optimization for fault-tolerant computing requires exact functional equivalence while minimizing expensive non-Clifford resources such as T gates. We study this problem using a compact 44.
arXiv:2404. 15616v2 Announce Type: replace-cross Abstract: Grover's search algorithms, including various Partial Grover Searches (PGS), suffer from scaling issues when multiple solutions are sought, as the number of iterations scales with the number of solutions or marked states, making implementation more computationally expensive.
The study evaluates quantum machine learning (QML) models for network intrusion detection against well-tuned classical baselines across four standard datasets, using a leakage-controlled protocol and noise simulation. It introduces a quantum-attribution audit to determine whether any performance gains are truly due to quantum effects. While most tuned classical models match or surpass QML, two quantum approaches— a quantum-kernel SVM and a small hybrid circuit—show statistically significant advantages on specific metrics and tasks.
arXiv:2607. 20377v1 Announce Type: cross Abstract: Quantum-kernel methods encode a dataset's geometry in a Gram matrix, so learning claims on hardware kernels assume the intended geometry survives execution.
arXiv:2607. 18340v1 Announce Type: cross Abstract: We report genuine-un-compiled, textbook-faithful-quantum cryptanalysis of symmetric-cipher structures executed on real IBM quantum hardware (ibm\_kingston, Heron generation).
The paper investigates the role of quantum computing in network‑security classification through two experiments. First, it evaluates near‑term quantum‑kernel support vector machines on datasets such as KDD Cup 1999, CICIDS2017, and BoT‑IoT, finding that quantum kernels can match or sometimes improve classical baselines, though classical RBF kernels often remain stronger. Second, it explores long‑term memory efficiency using quantum oracle sketching (QOS), showing that quantum methods can achieve comparable accuracy with a smaller effective memory footprint than explicit storage, suggesting a potential advantage in memory‑efficient data access for streaming classification tasks.
arXiv:2607. 21995v1 Announce Type: cross Abstract: Rare-regime discovery in parameterized dynamical systems is an active-search problem: find one verified parameter at which a scientifically defined qualitative threshold is crossed, even when acceptable candidates are rare, nonconvex, or fragmented.
arXiv:2602. 23409v3 Announce Type: replace-cross Abstract: Angle-encoded variational quantum circuits admit a truncated Fourier series representation of their output, but approximating functions with maximum frequency $\omega_{\max}$ using fixed unary encoding requires $\mathcal{O}(\omega_{\max})$ encoding gates.
arXiv:2608. 11066v1 Announce Type: cross Abstract: We prove inference-time quantum coordination advantages for specified AI state-tracking tasks.