Research

Research questions in quantum science

Each question fixes a model, works through the mathematics, and separates what is established from what is not.

How a question is developed

Each question begins with a physical or computational problem, develops a mathematical model, and separates established results from unresolved issues. Follow a worked starting investigation before attempting the proposed extension.

Start by reproducing a small calculation. Then change an assumption, compare with the literature, and identify what a new result would establish. The proposed extensions describe starting directions for investigation.

Fields

01 · 4 questions

Foundations of Quantum Mechanics

What does quantum theory say about reality, and why does the world have its particular quantum structure?

  1. Why does a measurement have one outcome?

    Unitary dynamics predicts an entangled system and apparatus. What connects that description to a definite recorded result?

  2. Why are quantum correlations limited?

    Bell inequalities exclude local hidden-variable models, but no-signalling alone allows correlations stronger than quantum theory.

  3. How does a classical world emerge?

    Loss of local interference is only part of the story: stable, independently accessible records must also be explained.

  4. How can gravity and quantum theory be tested together?

    A branch-dependent gravitational phase offers a tractable starting point, but interpreting an entanglement signal requires explicit assumptions.

02 · 3 questions

Quantum Computation

Which problems can quantum systems solve efficiently, and what resources make that possible?

  1. What can quantum computers compute efficiently?

    Interference gives efficient algorithms for some problems, but the boundary of efficient quantum computation is not settled.

  2. When does simulating quantum matter become useful?

    Efficiently producing a quantum evolution is different from efficiently extracting a scientifically useful prediction.

  3. What does reliable quantum computation cost?

    Error correction changes the scaling of failure, but practical overhead depends on codes, noise, gates, and architecture together.

03 · 4 questions

Quantum Information

What can be transmitted, recovered, and transformed when information is encoded in quantum states?

  1. Is entanglement a reversible resource?

    Pure-state entanglement has a clean asymptotic currency. Mixed states reveal irreversibility and limits to that description.

  2. How much quantum information can noise transmit?

    Quantum channel capacity requires both a coding strategy and a converse bound; optimizing one use is not generally enough.

  3. When is lost quantum information recoverable?

    Recovery depends on what the environment learned, not simply on whether a noisy transformation has an algebraic inverse.

  4. What can three particles share that two cannot?

    A third particle removes the Schmidt decomposition, so tripartite entanglement comes in kinds rather than amounts. For three qubits the genuinely tripartite pure states fall into two classes that no local protocol interconverts.

04 · 3 questions

Quantum Technology

How can fragile quantum effects become reliable processors, networks, and measuring instruments?

  1. Can quantum devices remain controllable as they grow?

    A scalable device must preserve useful control and verifiable performance as calibration, connectivity, and correlated errors grow.

  2. Can quantum networks overcome distance and loss?

    Repeaters promise a different rate–distance trade-off, but loss, memory, and scheduling must be accounted for together.

  3. When does entanglement improve a measurement?

    The ideal Heisenberg scaling is a starting point; useful sensing advantage must survive noise and equal-resource comparisons.

Sources

Known results link to papers near the claims they support. Each question also has an annotated reading list. Model assumptions and theorem scope matter as much as the equation itself.

Browse the bibliography →

Theorem of the Day

One theorem from quantum mechanics, quantum computing, or quantum information theory: its statement, a complete proof, and a new result we derive from it.

5 November 2026 · Quantum information theoryThe no-cloning theorem New: Geodesic tradeoff for cloning two pure states.

All theorems →

People and contributions

Student projects and documented contributions to work at the Center.

Students and contributions →