scientific article; zbMATH DE number 7009614
From MaRDI portal
Publication:4612479
DOI10.4086/toc.2018.v014a015zbMath1417.68046arXiv1509.02374OpenAlexW2963551170MaRDI QIDQ4612479
Publication date: 31 January 2019
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.02374
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Quantum computation (81P68) Random walks on graphs (05C81) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items
Quantum walk and its application domains: a systematic review ⋮ Efficient implementation of LIMDDs for quantum circuit simulation ⋮ Equivalence of Szegedy's and coined quantum walks ⋮ Quantum circuits synthesis using Householder transformations ⋮ Unnamed Item ⋮ Practical Implementation of a Quantum Backtracking Algorithm ⋮ Operational framework for recent advances in backtracking search optimisation algorithm: a systematic review and performance evaluation ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure
- Quantum walks can find a marked element on any graph
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- The electrical resistance of a graph captures its commute and cover times
- An overview of backtrack search satisfiability algorithms
- On the hitting times of quantum versus random walks
- Average-case quantum query complexity
- The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs
- Search via Quantum Walk
- Any AND-OR Formula of Size N Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- BKZ 2.0: Better Lattice Security Estimates
- Exponential algorithmic speedup by a quantum walk
- On Approximation Algorithms for # P
- Estimating the Efficiency of Backtrack Programs
- Quantum algorithms revisited
- Quantum Complexity Theory
- Strengths and Weaknesses of Quantum Computing
- Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games
- Theory and Applications of Satisfiability Testing
- Quantum Walk Algorithm for Element Distinctness
- Solving NP-Complete Problems with Quantum Search
- Quantum Query Complexity of State Conversion
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
