Riemannian modified Newton optimization on quantum search achieves quadratic convergence and O(√(N/M) log log(1/ε)) complexity when M/N is known.
hub
A Quantum Algorithm for Finding the Minimum
10 Pith papers cite this work. Polarity classification is still indexing.
10
Pith papers citing it
abstract
We give a quantum algorithm to find the index y in a table T of size N such that in time O(c sqrt N), T[y] is minimum with probability at least 1-1/2^c.
hub tools
verdicts
UNVERDICTED 10representative citing papers
A coherent quantum rollout oracle is built from O(Nw)-gate rank-select circuits with proven optimality, delivering O(sqrt(k)/eps) query complexity for planning problems and formally verified in Lean.
Quantum algorithms achieve O(1.9140^n) time for chromatic number with QRAM and O(1.9575^n) for 20-coloring in polynomial space by combining quantum dynamic programming with Grover search on branching algorithms.
BoolXLLM augments an existing Boolean rule learner with LLMs for feature selection, discretization thresholds, and natural-language rule translation to improve interpretability while preserving accuracy.
A quantum-native MLD detector using Grover adaptive search with search space reduction achieves optimal performance in overloaded MIMO random access channels while cutting Grover rotations by up to 65%.
Authors present a multiclass tree tensor network algorithm demonstrated on IBM quantum processor and a neural network approach for noise-robust quantum state tomography.
Explicit gate-based Grover oracle for densest k-subgraph using Dicke states and QFT for edge counting, shown via numerical simulations to give quadratic speedup over brute force.
A Grover-search-based quantum model for CVRPTW that encodes constraints with only linear additional decision qubits relative to TSP formulations.
Quantum algorithm for k-minima with O(sqrt(k N)) query complexity via threshold search and generalized amplitude amplification.
A hybrid quantum approach is proposed to achieve quadratic speedups in influence estimation and edge removal optimization for malware containment modeled as a network influence minimisation problem.
citing papers explorer
-
Achieving double-logarithmic precision dependence in optimization-based quantum unstructured search
Riemannian modified Newton optimization on quantum search achieves quadratic convergence and O(√(N/M) log log(1/ε)) complexity when M/N is known.
-
Coherent Rollout Oracles for Finite-Horizon Sequential Decision Problems
A coherent quantum rollout oracle is built from O(Nw)-gate rank-select circuits with proven optimality, delivering O(sqrt(k)/eps) query complexity for planning problems and formally verified in Lean.
-
Exponential-time quantum algorithms for graph coloring problems
Quantum algorithms achieve O(1.9140^n) time for chromatic number with QRAM and O(1.9575^n) for 20-coloring in polynomial space by combining quantum dynamic programming with Grover search on branching algorithms.
-
BoolXLLM: LLM-Assisted Explainability for Boolean Models
BoolXLLM augments an existing Boolean rule learner with LLMs for feature selection, discretization thresholds, and natural-language rule translation to improve interpretability while preserving accuracy.
-
Quantum-Native Maximum Likelihood Detection in Random Access Channel with Overloaded MIMO
A quantum-native MLD detector using Grover adaptive search with search space reduction achieves optimal performance in overloaded MIMO random access channels while cutting Grover rotations by up to 65%.
-
Machine learning methods in quantum computing theory
Authors present a multiclass tree tensor network algorithm demonstrated on IBM quantum processor and a neural network approach for noise-robust quantum state tomography.
-
Explicit Quantum Search Algorithm for the Densest k-Subgraph Problem
Explicit gate-based Grover oracle for densest k-subgraph using Dicke states and QFT for edge counting, shown via numerical simulations to give quadratic speedup over brute force.
-
Quantum Model for CVRPTW
A Grover-search-based quantum model for CVRPTW that encodes constraints with only linear additional decision qubits relative to TSP formulations.
-
A Quantum Algorithm for Finding $k$-Minima
Quantum algorithm for k-minima with O(sqrt(k N)) query complexity via threshold search and generalized amplitude amplification.
-
Towards Quantum Optimised Malware Containment
A hybrid quantum approach is proposed to achieve quadratic speedups in influence estimation and edge removal optimization for malware containment modeled as a network influence minimisation problem.