Quantum-walk speedup of backtracking algorithms
From MaRDI portal
Recommendations
Cites work
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
- An overview of backtrack search satisfiability algorithms
- Any AND-OR formula of size \(N\) can be evaluated in time \(N^{1/2+o(1)}\) on a quantum computer
- Average-case quantum query complexity
- BKZ 2.0: Better lattice security estimates
- Efficient quantum walk on the grid with multiple marked elements
- Estimating the Efficiency of Backtrack Programs
- Exponential algorithmic speedup by a quantum walk
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 1929929 (Why is no real title available?)
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- On Approximation Algorithms for # P
- On the hitting times of quantum versus random walks
- Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games
- Quantum algorithms revisited
- Quantum Complexity Theory
- Quantum Query Complexity of State Conversion
- Quantum search of spatial regions
- Quantum Walk Algorithm for Element Distinctness
- Quantum walks can find a marked element on any graph
- Search via Quantum Walk
- Solving NP-Complete Problems with Quantum Search
- Strengths and Weaknesses of Quantum Computing
- The electrical resistance of a graph captures its commute and cover times
- The whole is less than the sum of its parts: constructing more efficient lattice-based AKEs
- Theory and Applications of Satisfiability Testing
Cited in
(19)- Nested quantum search and NP-hard problems
- Equivalence of Szegedy's and coined quantum walks
- Operational framework for recent advances in backtracking search optimisation algorithm: a systematic review and performance evaluation
- Quantum walk and its application domains: a systematic review
- Quantum circuits synthesis using Householder transformations
- Practical Implementation of a Quantum Backtracking Algorithm
- Quantum Walk Based Search Algorithms
- Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games
- scientific article; zbMATH DE number 7453153 (Why is no real title available?)
- A hybrid algorithm framework for small quantum computers with application to finding Hamiltonian cycles
- Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems
- Quantum walks and search algorithms
- Efficient implementation of LIMDDs for quantum circuit simulation
- Mind the gap: achieving a super-Grover quantum speedup by jumping to the end
- Concrete analysis of quantum lattice enumeration
- Quantum lattice enumeration in limited depth
- A unified framework of quantum walk search
- Quantum algorithms for Hopcroft's problem
- Quantum procedures for nested search problems -- with applications in cryptanalysis
This page was built for publication: Quantum-walk speedup of backtracking algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4612479)
