Topic
Computational Complexity
3 questions · 0 investigations · 0 notes
Questions
What this subject opens.
How do P, NP, and BQP relate to one another?
I know the informal definitions of these classes. I want to understand how they are related and which relationships are known.
Which kinds of problems could benefit from quantum computing?
If quantum computation offers an advantage, what features of a problem make that advantage possible, and how broadly does it apply?
What determines the power and speed of a computational model?
Which features of a model change what it can compute, and which change the resources it needs to do so?