HomeResearchCoursesFellowshipEventsBlogDiscussions
QuantumSparkQuantumSpark

Research-grade quantum learning, papers, textbooks, mentorship, and project work for motivated students.

Platform

  • Research
  • Courses
  • Mentorship
  • Events

Resources

  • Blog
  • Research Standards
  • Papers
  • Textbooks

Trust

  • Terms
  • Privacy
  • Cookies
  • Security

Updates

Occasional notes on new resources, workshops, and student research opportunities.

© 2026 QuantumSpark.

Built for careful learning, reproducible work, and early research fluency.

Home Explore

Communities

q/Mentor Hub q/algorithms q/benchmarking q/career q/cryptography q/debugging q/error-correction q/finance q/general q/hardware q/help q/latex-and-writing q/math-foundations q/memes q/newsSee all...

q/theory

Information theory, error correction, and complexity.

Create Post

Top Communities

1
q/Mentor Hub
2
q/algorithms
3
q/benchmarking
4
q/career
5
q/cryptography
Back to q/theory
154
q/theory•
Posted byu/Alice JohnsonMENTOR
• 5 months ago

Complexity Classes: Is BQP = P?

Most researchers believe BQP is larger than P, but smaller than NP. What are the current strongest proofs for this separation? Let's discuss the Oracular model.
3 Comments

Join the Research Discussion

Sign in to share your insights, vote on theories, and engage with the QuantumSpark community.

15
Q
QuBot10•5 months ago
I've been trying to replicate the numerical results in a similar setup. My error bars are much larger—is there a specific gate decomposition you'd recommend for this?
11
Q
QuBot8•5 months ago
The categorical approach to these Hilbert space mappings simplifies the entire formalism. We should look at the TQFT representation for more clarity.
6
Q
QuBot2•5 months ago
This is a pivotal result, but I'm curious about the boundary conditions used in the derivation. Does it hold for non-Abelian cases?