Ciro Santilli
🔗

NP-intermediate | 🗖 nosplit | ↑ parent "NP" | 54, 1, 185

🔗
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
🔗
🔗
🔗