REVIEW 32 cited by
A Quantum Algorithm for Finding the Minimum
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original 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.
Forward citations
Cited by 32 Pith papers
-
High-rate qLDPC processors
Non-abelian "mitten" qLDPC codes achieve 20% encoding rate with distances 10-24 on 150-975 qubits, and simulations indicate fault-tolerant processors sustaining ~10^10 logical operations at 0.1% physical error rate.
-
Faster Algorithms for Multimarginal Optimal Transport
New algorithms approximate multimarginal optimal transport with near-linear classical time and sublinear quantum time in the tensor dimension, plus matching query lower bounds.
-
Constraint-Aware Quantum Optimization of Defect Configurations in Doped ZrO2: XY-Mixer QAOA and Grover Adaptive Search
Presents an end-to-end constraint-aware quantum optimization pipeline using XY-mixer QAOA and Grover Adaptive Search for low-energy defect configurations in doped ZrO2, with QAOA validated against exact enumeration on...
-
Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier
Quantum divide-and-conquer with structured set-partition state preparation solves general TSP in O*(1.866^n) time, the first quantum algorithm claimed to beat the classical O*(2^n) barrier.
-
Quantum enhanced rare event discovery and sampling
A quantum algorithm discovers and samples rare events with optimal quantum scaling without prior knowledge of the events, yielding quadratic speedup for heavy-tailed systems and polynomial speedup for stationary processes.
-
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.
-
QuantumMind: Constraint-Grounded Agentic Reasoning for Speedup Analysis in Quantum Computing
A structured AI agent with typed steps and deterministic checks beats prompting and agentic baselines for producing auditable quantum-speedup hypotheses, scoring 53.1 versus 35.8 mean ODS on 582 tasks.
-
Model Predictive Path Integral Control as a Quantum Query Problem
The finite-ensemble MPPI control update is expressed as a ratio of bounded expectations and estimated by quantum amplitude estimation with O(m/(ε√a)) queries, a quadratic improvement over Monte Carlo.
-
Quantum-Accelerated Self-Consistent Field: A Hybrid Algorithm
GAS-SCF uses Grover adaptive search and quantum arithmetic to mark and amplify improving Fock states, offering a theoretical quadratic speedup for SCF optimization, shown via classical simulations up to 26 qubits and ...
-
Coupling-Grouped XY-QAOA for Joint Anomaly-Feature Selection
Coupling-Grouped XY-QAOA enables joint anomaly-feature selection via a constraint-preserving grouped-angle QAOA variant, achieving 45.9-61.3% circuit depth reduction and larger feasible executions (64 qubits at p=2) o...
-
Efficient and Expressive Boundary Conditions in Quantum Lattice Boltzmann Methods
New boundary condition approach for QLBM using one coherent operation on the full boundary, claimed to use fewer resources asymptotically and practically for bounce-back and specular reflection.
-
A Grover-compatible manifold optimization algorithm for quantum search
A Riemannian gradient-ascent method with oracle/diffusion-only 'Grover-compatible' retractions converges to the marked state in O(√N log(1/ε)) iterations, matching Grover's quadratic speedup.
-
A Bit of Freedom Goes a Long Way: Classical and Quantum Algorithms for Reinforcement Learning under a Generative Model
Improved classical and quantum regret bounds for reinforcement learning with a generative model, including a new expected-regret measure under which quantum algorithms achieve polylogarithmic regret for infinite-horiz...
-
A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits
A quantum dynamic programming circuit prepares the uniform superposition of all Hamiltonian cycles in polynomial gates, reducing Grover-based TSP search complexity to O(sqrt((N-1)!).
-
Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz
Non-variational QAOA with fixed angles solves QRAO's relaxed MaxCut Hamiltonian with performance close to optimized parameters and about three times fewer qubits than standard QAOA.
-
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.
-
Phase-Selective Amplitude Amplification for Constrained Optimization
A phase-encoding Grover variant with stabilizer and blade qubits is proposed for constrained optimization, but its boosting mechanism is unproven and, as wired, the blade qubits act as inert spectators.
-
Principles of Quantum Optimization for Constrained Problems
Computational slowdown in constrained quantum optimization is attributed to the speed of entanglement restructuring, and the paper shows how constraints create (or avoid) the narrow spectral gaps where this restructur...
-
CARVE-Q: Quantum-Proposed, Classically Certified Interactive Driving Repair
CARVE-Q applies Durr-Hoyer quantum minimum finding to a black-box repair lattice in interactive driving while preserving classical verifier authority for certificates.
-
Energy-selective quantum search with Ising Hamiltonian phase oracles
The work shows that Ising Hamiltonian phase oracles enable energy-selective quantum search with Grover-type amplification, achieving standard quadratic scaling for Gaussian spectra and proposing corrections for random...
-
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%.
-
Quantum Algorithms for Projection-Free Sparse Convex Optimization
Quantum Frank-Wolfe algorithms reduce dimension dependence in sparse convex optimization, from O(d) to O(sqrt d) function queries for vectors and from O(d^2) to O(d) per update step for matrices under certain assumptions.
-
Protein folding with an all-to-all trapped-ion quantum computer
BF-DCQO on IonQ's trapped-ion processors solves dense HUBO instances (protein folding up to 33 qubits, MAX 4-SAT and spin-glasses at 36 qubits) when followed by classical post-processing.
-
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.
-
Quantum iterative approach to the Traveling Salesman Problem
The paper outlines a quantum framework combining QPE and Grover-style amplification for TSP, demonstrates it on a small instance, and gives an expected complexity scaling with error tolerance epsilon.
-
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.
-
Demonstration of a quantum comparator on an ion-trap quantum device
An ion-trap quantum computer correctly compared 9-bit integers with 95% output success and 69% ancilla-inclusive success.
-
Efficient Maximum Clique Detection via Grover's Algorithm with Real-time Global Size Tracking
A proposed Grover-based maximum clique solver claims O(sqrt(2^n)) iterations and O(1) measurements by pre-encoding the clique size, but the pre-encoding itself costs exponentially many gates and is excluded from the h...
-
An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits
A quantum min/max search that uses exact Grover-Long search instead of probabilistic Grover search, with oracle circuit simplifications and small IBM Q demonstrations.
-
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.
-
Setting angles in quantum approximate optimization at utility-scale
The paper benchmarks approximation techniques and transfer learning for setting QAOA angles at utility scale and extracts operational guidance from hardware-validated results.
- Automated Auxiliary Qubit Allocation in High-Level Quantum Programming
Discussion (0). Continue with ORCID to comment.