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

Ancestors

🔗