This is the most interesting class of problems for BQP as we haven't proven that they are neither:
- P: would be boring on quantum computer
- NP-complete: would likely be impossible on a quantum computer
- NP | 11, 325, 8
- Complexity class | 0, 465, 12
- Computational problem | 17, 1k, 22
- Computer science | 260, 3k, 72
- Computer | 138, 24k, 589
- Technology | 15, 39k, 911
- Ciro Santilli's Homepage | 262, 182k, 3k
- Discrete logarithm | 40
- Integer factorization | 96, 189, 1
- NP-hard cryptosystems | 93