Skip to main content

Utility navigation

  • Calendar
  • Contact
  • Login
  • MAKE A GIFT
Berkeley University of California
Home Home

Main navigation

  • Programs & Events
    • Research Programs
    • Workshops & Symposia
    • Public Lectures
    • Research Pods
    • Internal Program Activities
    • Algorithms, Society, and the Law
  • Participate
    • Apply to Participate
    • Propose a Program
    • Postdoctoral Research Fellowships
    • Law and Society Fellowships
    • Science Communicator in Residence Program
    • Circles
    • Breakthroughs Workshops and Goldwasser Exploratory Workshops
  • People
    • Scientific Leadership
    • Staff
    • Current Long-Term Visitors
    • Research Fellows
    • Postdoctoral Researchers
    • Scientific Advisory Board
    • Governance Board
    • Affiliated Faculty
    • Science Communicators in Residence
    • Law and Society Fellows
    • Chancellor's Professors
  • News, Publications, and Videos
    • News
    • Videos
    • AI + TCS Working Group
  • Support for the Institute
    • Annual Fund
    • All Funders
    • Institutional Partnerships
  • For Visitors
    • Visitor Guide
    • Plan Your Visit
    • Location & Directions
    • Accessibility
    • Building Access
    • IT Guide
  • About

Error message

Could not retrieve the oEmbed resource.

Results 31 - 40 of 24600

Workshop Talk
|
Oct. 1, 2026

Asymptotically good large-alphabet LDCs with polylogarithmic query complexity

No abstract available.

Workshop Talk
|
Oct. 1, 2026

Algebraic Expander Codes

No abstract available.

Simons Institute Law and Society Fellowship  

Contact Details








Contact Information

Long-Term Visitor Application 

Contact Details








Contact Information

Event
|
Oct. 1, 2026
A quantum oracle separation between QMA(2) and QMA

We find a quantum oracle relative to which QMA = QMA(2). As a consequence, we resolve the nodisentanglers conjecture of Watrous: for every ε + δ < 1, any (ε, δ)-disentangler requires input size exponential in the number of output qubits. Our proof combines...

Video
|
Oct. 1, 2026
The Quest for Explicit Constructions in Coding Theory
Video
|
Oct. 1, 2026
Binary code rate bounds via classical--quantum channels
Video
|
Oct. 1, 2026
Space-efficient list decoding (in person only)
Video
|
Oct. 1, 2026
Symmetric Self-Dual Quantum Codes on High Dimensional Expanders with Single-Orbit Low-Weight Checks
Video
|
Oct. 1, 2026
Fault-Tolerant Quantum Computation with Adversarial Errors

Pagination

  • Previous page Previous
  • Page 2
  • Page 3
  • Current page 4
  • Page 5
  • Page 6
  • Next page Next
Home
The Simons Institute for the Theory of Computing is the world's leading venue for collaborative research in theoretical computer science.

Footer

  • Programs & Events
  • Participate
  • Workshops & Symposia
  • Contact Us
  • Calendar
  • Accessibility

Footer social media

  • Twitter
  • Facebook
  • Youtube
© 2013–2026 Simons Institute for the Theory of Computing. All Rights Reserved.
link to homepage

Main navigation

  • Programs & Events
    • Research Programs
    • Workshops & Symposia
    • Public Lectures
    • Research Pods
    • Internal Program Activities
    • Algorithms, Society, and the Law
  • Participate
    • Apply to Participate
    • Propose a Program
    • Postdoctoral Research Fellowships
    • Law and Society Fellowships
    • Science Communicator in Residence Program
    • Circles
    • Breakthroughs Workshops and Goldwasser Exploratory Workshops
  • People
    • Scientific Leadership
    • Staff
    • Current Long-Term Visitors
    • Research Fellows
    • Postdoctoral Researchers
    • Scientific Advisory Board
    • Governance Board
    • Affiliated Faculty
    • Science Communicators in Residence
    • Law and Society Fellows
    • Chancellor's Professors
  • News, Publications, and Videos
    • News
    • Videos
    • AI + TCS Working Group
  • Support for the Institute
    • Annual Fund
    • All Funders
    • Institutional Partnerships
  • For Visitors
    • Visitor Guide
    • Plan Your Visit
    • Location & Directions
    • Accessibility
    • Building Access
    • IT Guide
  • About

Utility navigation

  • Calendar
  • Contact
  • Login
  • MAKE A GIFT
link to homepage