Quantum Computing, Quantum Machine Learning.
algorithms. NP-Complete problems are of interest as their optimal solutions can efficiently solve all NP problems in the same family. Quantum computers solve problems in BQP (bound error, quantum, polynomial time), equivalent to BPP (‘bound error, probabilistic, polynomial time’) on classical