This reading group was formed in Fall 2022 by some mathematics, computer science and physics graduate students at UC Davis who are interested in various aspects of computational complexity and theoretical CS as relevant to quantum computing.

"PCPs" stands for probabilistically checkable proofs. One of our initial motivations was to understand the current literature on the quantum PCP conjecture although we're broadly interested in all aspects of computational complexity and computability.

The meeting format generally includes fairly open-ended group discussions and we individually give short talks on various topics that we've recently studied. Our meetings are generally held on Tuesdays 2:00pm - 3:30pm Pacific Time over Zoom. 

If you want to be added to our email list please contact Sanchayan Dutta (dutta@ucdavis.edu) or Daniel Tobias (dtobias@ucdavis.edu).

Recurring Zoom Link:  https://ucdavis.zoom.us/j/95412557397 

Complexity Zoo:  https://complexityzoo.net/Complexity_Zoo

Complexity Zoology: https://www.math.ucdavis.edu/~greg/zoology/

Current Members

Arkin Tikku (School of Physics, University of Sydney)

Daniel Tobias (Department of Computer Science, UC Davis)

Matthew Corbelli (Department of Mathematics, UC Davis)

Mina Lafiti (Department of Computer Science, UC Davis)

Sanchayan Dutta (Department of Mathematics, UC Davis)

Zijian Song (Department of Physics, UC Davis)