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 | 9, 313, 8
- Complexity class | 0, 313, 10
- Computational problem | 15, 923, 20
- Computer science | 240, 2k, 69
- Computer | 136, 21k, 538
- Technology | 0, 34k, 774
- Ciro Santilli's Homepage | 238, 154k, 2k
- Discrete logarithm | 34
- Integer factorization | 94, 185, 1
- NP-hard cryptosystems | 91