arXiv AI August 18, 2026 By Debanjan Konar, Zain Hafeez, Vaneet Aggarwal

A Bi-directional Multi-solution Scalable Grover Search Algorithm

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.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv AI.

benchmarks

arXiv Machine Learning

Jul 15

Qubit-Efficient Quantum Search for Hyperdimensional Decomposition via Logarithmic Encoding

arXiv:2607. 11936v1 Announce Type: new Abstract: Hyperdimensional Computing (HDC) represents symbols using high-dimensional hypervectors of dimension $D$.

By Sanggeon Yun, Hyunwoo Oh, Ryozo Masukawa, Raheeb Hassan, Mohsen Imani

robotics

arXiv AI

Jul 23

DQAOA-GPT: AI-Accelerated Distributed Quantum Optimization for Combinatorial Problems

arXiv:2607. 20225v1 Announce Type: cross Abstract: While combinatorial optimization problems are central to many scientific and engineering applications, their solution remains challenging due to exponentially large search spaces.

By Seongmin Kim, Abhinav Rijal, Yuri Alexeev, Nora Bauer, Martin Roetteler, Mina Yoon, George Siopsis, In-Saeng Suh

llms benchmarks

arXiv Machine Learning

2d ago

Quantum Multi-Armed Bandits and Linear Bandits: Lower Bounds and Algorithms

arXiv:2608. 14319v1 Announce Type: new Abstract: We study quantum multi-armed bandits (QMAB) and quantum linear bandits (QLB) in the model of Wan et al.

By Maoli Liu, Zhuohua Li, John C. S. Lui

rag reinforcement-learning safety

arXiv Machine Learning

Aug 10

Sub-Quadratic Bisimulation Metrics via Approximate Nearest Neighbors: Coverage-Augmented Guarantees and Computable Two-Sided Certificates

arXiv:2608. 06762v1 Announce Type: new Abstract: Bisimulation metrics quantify behavioral similarity in Markov decision processes, but their Wasserstein fixed-point operator updates every state pair and incurs quadratic pairwise work.

By Ibne Farabi Shihab, Joyanta Jyoti Mondal

rag reinforcement-learning benchmarks

arXiv Machine Learning

Jun 11

Higher-Order Token Interactions via Quantum Attention

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.

By Jian Xu, Chao Li, Delu Zeng, John Paisley, Qibin Zhao

rag benchmarks

arXiv Machine Learning

Jul 27

QC-PHAST Search: Classical--Quantum Query Benchmarks for Finite-Pool Rare-Regime Discovery

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.

By Harsh Milind Tirhekar, Chandrajit Bajaj

benchmarks

Related stories

Qubit-Efficient Quantum Search for Hyperdimensional Decomposition via Logarithmic Encoding

DQAOA-GPT: AI-Accelerated Distributed Quantum Optimization for Combinatorial Problems

Quantum Multi-Armed Bandits and Linear Bandits: Lower Bounds and Algorithms

Sub-Quadratic Bisimulation Metrics via Approximate Nearest Neighbors: Coverage-Augmented Guarantees and Computable Two-Sided Certificates

Higher-Order Token Interactions via Quantum Attention

QC-PHAST Search: Classical--Quantum Query Benchmarks for Finite-Pool Rare-Regime Discovery