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

Results 191 - 200 of 24651

Workshop Talk
|
Sept. 23, 2026

Spectral gap of 1D quantum Gibbs samplers

Recently, quantum analogs of classical Gibbs samplers have been introduced—quantum Markov chains that generalize Glauber or Metropolis dynamics, and serve as models of nature’s thermalization process. In this work, we show that every one-dimensional quantum Hamiltonian with short-range interactions admits a quantum Gibbs sampler with a system-size–independent, optimal spectral gap at all finite temperatures.

Event
|
Sept. 24, 2026
A Goldreich-Levin reduction for two entangled parties

Goldreich-Levin reductions are ubiquitous in cryptography: they convert an algorithm capable of guessing mod 2, for a hidden string m and a random challenge r, into one that is capable of extracting the entirety of m. Here, I will describe a...

Video
|
Sept. 23, 2026
Discrete Isoperimetric Inequalities via Curvature
Video
|
Sept. 23, 2026
Strong Spatial Mixing for Colorings on Trees and its Algorithmic Applications
Video
|
Sept. 23, 2026
Sampling elements of a finite group: efficiency of the product replacement algorithm with...
Video
|
Sept. 23, 2026
Curvatures of graphs
Workshop Talk
|
Sept. 22, 2026

Field dynamics and its applications

In this talk, I will talk about field dynamics, explaining its definition and why I like it. Field dynamics is a continuous analogue of the down-up walk on a simplicial complex. It has a lot of applications in discrete sampling, including sampling from the hardcore model (i.e., independent sets) on graphs of unbounded degree, up to and at the critical point.

Workshop Talk
|
Sept. 22, 2026

Entropic independence

In this talk, we will review entropic independence, the analog of spectral independence when replacing variance with entropy, and show how to use entropic independence to derive tight bounds for the mixing time of Markov chains.

Workshop Talk
|
Sept. 22, 2026

Random unitary circuits with constant spectral gap

I will review the Knabe method for spectral gap lower bounds and show its application to random unitary circuits. This leads to the optimal (up to a constant) estimate of the spectral gap of the 1d brickwork unitary random circuit over qubits.

Based on the joint work with Tim Baer.

Workshop Talk
|
Sept. 22, 2026

Aldous-type Spectral Gaps in Unitary Groups

Aldous’ spectral-gap conjecture, proved by Caputo, Liggett and Richthammer, states that the interchange process on the symmetric group and the underlying random walk have the same spectral gap. We formulate a unitary analogue: a weighted hypergraph generates a random walk on the unitary group U(n) by Haar-randomizing the coordinate subspaces associated with its hyperedges. The resulting spectrum is surprisingly rich: it contains the spectra of all the associated discrete KMP processes, with arbitrary numbers of particles, as well as the entire spectrum of the corresponding symmetric-group walk, and much more. We show that the spectral gap can nevertheless be sought entirely in the torus-invariant, or zero-weight, parts of mixed tensor powers having equally many standard and dual factors. We furthermore conjecture that the spectral gap of the unitary walk always equals that of the two-particle KMP process. We prove the conjecture in the mean-field and codimension-one cases. Joint work with Doron Puder.

Pagination

  • Previous page Previous
  • Page 18
  • Page 19
  • Current page 20
  • Page 21
  • Page 22
  • 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