Showing quant-phShow all
3 papers · 1 filter
quant-ph2022
Quantum-Inspired Approximations to Constraint Satisfaction Problems
S. Andrew Lanham
Two contrasting algorithmic paradigms for constraint satisfaction problems are successive local explorations of neighboring configurations versus producing new configurations using…
quant-ph2021
A Quantum-Inspired Classical Solver for Boolean k-Satisfiability Problems
S. Andrew Lanham, Brian R. La Cour
In this paper we detail a classical algorithmic approach to the k-satisfiability (k-SAT) problem that is inspired by the quantum amplitude amplification algorithm. This work falls…
quant-ph2019
Parallel Quantum Computing Emulation
Brian R. La Cour, S. Andrew Lanham, Corey I. Ostrove
Quantum computers provide a fundamentally new computing paradigm that promises to revolutionize our ability to solve broad classes of problems. Surprisingly, the basic mathematical…