Practical Implementation of a Quantum Backtracking Algorithm

DOI10.1007/978-3-030-38919-2_49zbMath1440.68098arXiv1908.11291OpenAlexW3003302655MaRDI QIDQ3297790

Maxime Remaud, Simon Martiel

Publication date: 20 July 2020

Published in: SOFSEM 2020: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.11291

zbMATH Keywords

graph coloringCSPquantum walkSATbacktracking algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Quantum algorithms and complexity in the theory of computing (68Q12) Computational aspects of satisfiability (68R07)

Uses Software

• MiniSat

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum lattice enumeration and tweaking discrete pruning
• A survey on vertex coloring problems
• Quantum Walk Based Search Algorithms
• Exponential algorithmic speedup by a quantum walk
• QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
• Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games
• Theory and Applications of Satisfiability Testing
• Time-Efficient Quantum Walks for 3-Distinctness
• Quantum Walk Algorithm for Element Distinctness
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving

This page was built for publication: Practical Implementation of a Quantum Backtracking Algorithm