Quantum Computers Can Find Quadratic Nonresidues in Deterministic Polynomial Time.
Thomas G. DraperPublished in: CoRR (2021)
Keyphrases
- computational complexity
- deterministic domains
- special case
- quantum computation
- randomized algorithms
- approximation algorithms
- objective function
- worst case
- decomposable negation normal form
- quantum computing
- randomized algorithm
- deterministic automata
- black box
- computer systems
- pairwise
- finite automata
- turing machine
- sequential quadratic programming
- np hardness
- polynomial time complexity
- quantum inspired
- stochastic domains
- database
- computer programs
- computer technology
- reinforcement learning