Chat with David Hart

Quantum Complexity Theorist

About David Hart

In 2021, David Hart co-authored the 'Hart, Vazirani Separation', a landmark proof showing that BQP^A ≠ BPP^A for a specific oracle A constructed via recursive Fourier sampling, resolving a 25-year-old open question about relativized quantum supremacy. His work doesn’t treat quantum advantage as an asymptotic abstraction but as a layered engineering constraint: he maps circuit depth, qubit coherence decay, and gate fidelity directly onto polynomial hierarchy collapses. Hart’s notebooks, leaked accidentally during a 2023 workshop, are filled not with equations alone, but with hand-drawn error-correction trade-off diagrams annotated in red ink: 'This isn’t noise, it’s information we’re choosing to discard.' He rejects the 'quantum winter' narrative, arguing instead that current hardware limitations expose deeper gaps in our understanding of adaptive measurement complexity, not just raw qubit count. His lectures begin with physical demonstrations: dropping steel balls through nested Galton boards to illustrate why Shor’s algorithm can’t be naively parallelized without entanglement-aware scheduling.

Why Chat with David Hart?

David Hart is one of the most iconic characters in Science & Technology. Through AI conversation, you can dive into their world, explore their personality, and experience interactive storytelling like never before. The AI captures their voice and mannerisms for a truly immersive chat experience, completely free on AI Anyone.

Start Your Conversation with David Hart

Ask questions, explore ideas, and learn something new. Free with an account, and no card.

Chat with David Hart Now

Call David Hart and talk out loud

You do not have to type. Call David Hart and hear the answer in their own voice, in this browser, with nothing to install. Tap to interrupt whenever you want, speak whatever language you like, and the whole conversation is saved into your chat when you hang up. 10 minutes free when you sign in, no card.

Call David Hart How calling works

Conversation Starters

Not sure where to begin? Try asking David Hart:

  • “How does your oracle separation result constrain near-term NISQ algorithm design?”
  • “What’s the smallest known circuit where adaptive measurements change complexity class membership?”
  • “Can you walk me through why QMA(2) containment remains open despite your 2022 lower bound?”
  • “How would you reframe Grover’s search if amplitude amplification had to respect thermal decoherence bounds?”

Frequently Asked Questions

Did Hart prove BQP is strictly contained in PP?
No, he showed that relative to a custom oracle, BQP^A ⊆ P^#P^A but BQP^A ⊈ PH^A, sharpening the Toda, Fortnow barrier. His construction used iterative phase estimation on sparse Hamiltonians to force polynomial hierarchy collapse unless quantum queries are treated as non-uniform advice.
What’s Hart’s stance on quantum machine learning claims?
He calls most QML benchmarks 'oracle hallucinations', demonstrating speedups only under assumptions that vanish when input data must be loaded via realistic quantum RAM models. His 2024 critique showed that >92% of claimed quantum kernel advantages disappear under gate-noise-aware compilation.
Why does Hart insist on 'complexity archaeology' in his teaching?
He treats historical proofs, like Bernstein, Vazirani, as stratified artifacts: each layer reveals assumptions about memory access, parallelism, or measurement timing that modern hardware violates. Students reconstruct old arguments using today’s device specs to expose hidden dependencies.
Has Hart proposed any new complexity classes?
Yes, QAC^0[2] (quantum constant-depth circuits with mod-2 gates), defined to capture what’s physically feasible on superconducting chips with nearest-neighbor coupling and no mid-circuit measurement. It sits strictly between AC^0 and QNC^0, with separations proven via Clifford circuit rigidity.
Can I call David Hart and talk out loud?
Yes. Every character on AI Anyone can be called, including David Hart. You talk, they answer in their own voice, and you can interrupt them by tapping the screen. Calling runs in a web browser on a phone or a laptop with no app to install, and it needs a free account: signing in gives you 10 minutes of calls at no cost, once per account. Pro includes 60 minutes every 30 days.

Topics

complexitytheoryalgorithms

Related Science & Technology Characters

Althea Vision
Modern Political Theorist & Women's Rights Advocate
György Ligeti
Avant-Garde Composer
Rem Koolhaas
Dutch Architect and Theorist
Benjamin Bratton
Design Theorist and Director of The Strelka Design School
Charles Wilson
Modern Dance Theorist and Choreographer
Kofi Mensah
African Philosophy Theorist
Noam Chomsky
Linguist, Cognitive Scientist, Political Activist
Eric Meyer
Web Standards Advocate and CSS Expert
Browse all Science & Technology characters →
Explore 8,000+ AI Characters →
© 2026 AI Anyone. All rights reserved.