TCS+, the longest-running theoretical #computerscience seminar, will soon resume for the Fall. Let us know what you'd like to hear about (results, speakers, topics), and any suggestions you may have! sites.google.com/view/tcsplus... #TCSSky @tcsplus.bsky.social

Let's have a community discussion about the impact of LLMs on quantum information research, and how to react to it as a research community! 👩‍🔬⚛️🤖 🏛️ Head over to the IAQI forum 👇 discuss.iaqi.org/t/quantum-in... 🦋 Please share widely!

Quantum Information Processing research in the age of AI

Dear colleagues, Over the past weeks there have been more and more results in which AI models played a crucial role, not only in mathematics and theoretical computer science, but right at the heart o...

discuss.iaqi.org

Fantastic Quanta story about one of the greatest discoveries in QC this year!

Ben Brubaker@benbenbrubaker.bsky.social · last mo.

After 20 years, researchers finally have strong evidence that “quantum proofs” are more powerful than ordinary classical ones. The results suggest that at least in computation, there’s no way around the complexity of the quantum world. Read more in @quantamagazine.bsky.social:

The website and registration link for WoLA 2026, the Workshop on Local Algorithms, is up! Registration is free, and the workshop will take place on August 16-18 at Boston University. Details and registration: www.local-algorithms.com/WOLA2026/

5-year postdoctoral research fellowship in theoretical Computer Science (also 4 other research fields), a nice opportunity! Needs PhD to be awarded between 1/Aug/24 and 1/Oct/27. Please share with whoever may be suitable! www.asc.ox.ac.uk/post-doctora...

Oded Goldreich posted a very insightful digest of the interactive proofs of proximity paper by Rothblum, Vadhan, and Wigderson. This is one of my favourite TCS papers, and Oded's new exposition makes it even easier to appreciate its beauty and elegance. eccc.weizmann.ac.il/report/2026/...

Splendid news for TCS@Cambridge: Anuj Dawar @anujdawar.bsky.social has been elected Fellow of the Royal Society. A wonderful recognition for a towering figure in logic and computational complexity. Many congratulations, Anuj! www.cst.cam.ac.uk/news/royal-s...

OpenAI's claim that this is a central conjecture in discrete geometry is not an exaggeration. This will I think be looked back on as the first time that AI solved a major mathematics problem (defined as a problem that all experts in some subfield had thought about). openai.com/index/model-...

An OpenAI model has disproved a central conjecture in discrete geometry

An OpenAI model solved the 80-year-old unit distance problem, disproving a major conjecture in discrete geometry and marking a milestone in AI-driven mathematics.

openai.com

Superb exposition. Highly recommended!

Arthur Pesah@arthurpesah.bsky.social · 3mo ago

New blog post out! ✨ I give here a visual introduction to algebraic topology in the context of quantum error correction. You will learn about manifolds, cellulations, chain complexes, and their relation to CSS codes like the surface code. Enjoy! :) arthurpesah.me/blog/2026-05...

Congratulations to Scott Aaronson, awarded the inaugural Luca Trevisan Award for Expository Work in Theoretical Computer Science "for his sustained and high-impact inspirational efforts to explain and promote our field to broad audiences"! Read the commendation: sigact.org/prizes/trevi... #TCSSky

How did I miss this?! A recent (2025) survey by Rocco Servedio on PAC learning and its variants, and recent results in these learning models: arxiv.org/abs/2511.08791 (Anything by Rocco is worth reading!)

The Probably Approximately Correct Learning Model in Computational Learning Theory

This survey paper gives an overview of various known results on learning classes of Boolean functions in Valiant's Probably Approximately Correct (PAC) learning model and its commonly studied variants...

arxiv.org

Excited about this new paper: it subsumes the quadratic Goldreich-Levin [BC26] and algorithmic PFR [ACDG26] papers, and makes explicit a connection between quadratic Fourier analysis and symplectic geometry, as speculated by Green and Tao. arxiv.org/abs/2604.04547

Submissions are now open for RANDOM 2026: easychair.org/conferences/... Call for papers: randomconference.com/random-2026-... RANDOM 2026 will be held in Boston, MA, on August 19–21, 2026, together with APPROX 2026. We look forward to your submissions!

📢 Our next TCS+ talk of the season will be Wednesday, April 8 (10am PT, 1pm ET, 19:00 CEST): Rahul Ilango, from MIT, will tell us about Gödel in Cryptography! RSVP to receive the link (available one day prior to the talk): docs.google.com/forms/d/e/1F...

TCS+ RSVP: Rahul Ilango (2026/04/08)

Gödel in Cryptography: Zero-Knowledge Proofs With No Interaction, No Setup, and Perfect Soundness

docs.google.com

Postdoc position in Cambridge with the amazing Anuj Dawar!

Anuj Dawar अनुज दावर انُج داور@anujdawar.bsky.social · 4mo ago

There is a post-doctoral position available in my group. Funding is for two years in the first instance (with a possibility of an extension). Details on how to apply are at the link below. Please feel free to contact me with any enquiries. www.cam.ac.uk/jobs/researc...

I've created a couple of mathematical games, both based on word problems in groups or semigroups. One of them could lead to a Polymath project if enough people are interested in it, as it is connected with an open problem. More details in the linked blog post.

Group and semigroup puzzles and a possible Polymath project

An Artin-Tits group is a group with a finite set of generators $latex a_1,\dots a_k$ in which every relation is of the form $latex (ab)^r=(ba)^r$ or $latex (ab)^ra=(ba)^rb$ for some positive intege…

gowers.wordpress.com

Happy days! A perfect excuse to share my favourite quantum cryptography origin story, as recounted in Brassard’s paper: arxiv.org/pdf/quant-ph...

Association for Computing Machinery@acm.org · 5mo ago

Congratulations to Charles H. Bennett and Gilles Brassard on receiving the 2025 ACM A.M. Turing Award! They are recognized for their essential role in establishing the foundations of quantum information science and transforming secure communication and computing. awards.acm.org/turing @umontreal

A quantum computer here at Cambridge!

Cavendish Laboratory@cambridgephysics.bsky.social · 5mo ago

The Cavendish Laboratory will be home to the UK's most powerful quantum computer, as part of a major new @cam.ac.uk partnership with quantum technology company IonQ. Read the full story: buff.ly/s8cJJRl

I’ve been enjoying Dor Minzer’s new survey “The Lens of Abelian Embeddings”. It gives a clear, additive-combinatorics-flavoured perspective on inverse theorems for k-wise correlations, with applications in discrete maths/TCS and plenty of open problems. arxiv.org/abs/2602.22183

The Lens of Abelian Embeddings

We discuss a recent line of research investigating inverse theorems with respect to general k-wise correlations, and explain how such correlations arise in different contexts in mathematics. We outlin...

arxiv.org

Postdoc position in Cambridge with Julia Wolf: Julia is a phenomenal researcher and a wonderful collaborator. She is advertising a 2-year postdoc in additive combinatorics and model theory. Closing date: 16 March. Details: jobs.ac.uk/job/DQP803/postdoctoral-research-associate-fixed-term

Postdoctoral Research Associate (Fixed Term) at University of Cambridge

Explore an exciting academic career as a Postdoctoral Research Associate (Fixed Term). Don't miss out on other academic jobs. Click to apply and explore more opportunities.

jobs.ac.uk

The 2nd Quantum Cambridge–Oxford–Warwick (QCOW) Workshop will take place at Warwick on April 23–24. Theme: Quantum Learning Theory. The programme will feature tutorials and accessible in-depth talks on recent advances by leading experts. Speakers/updates: qcow.cs.ox.ac.uk/

The list of accepted papers at #STOC2026 is out: acm-stoc.org/stoc2026/acc... Congratulations to all authors!

Theoretical CS community! I have a small favor to ask. If you ever used, read, watched some of the (excellent IMO) exposition content by Ryan O'Donnell, would you mind filling this very short survey, and maybe say how useful to you it was? 📝 forms.gle/xrvc2mLRbMqK... Please spread this! #TCSSky

Congrats to Irit Dveer Dinur of the Institute for Advanced Study & Weizmann Insitute, #NASmember Subhash Khot of New York University, Guy Kindler of @hebrewuniversity.bsky.social, Dor Minzer of @mit.edu, and Muli Safra of Tel Aviv University, winners of the 2026 Michael and Sheila Held Prize! (1/2)

ICALP 2026 CFP is out. This year it’ll be at Royal Holloway (London area), July 7–10, 2026. Abstract registration: Feb 3 Paper deadline: Feb 6 Details: icalppodcspaa2026.cs.rhul.ac.uk/icalp/

New paper with the brilliant Dor Minzer, Guy Weissenberg, and Kai Zhe Zheng: we show a separation between RLDCs and LDCs via HDX-based PCPs. This one is special to me; it answers a question Oded Goldreich posed to me in my 1st PhD year, and it’s been on my mind ever since. arxiv.org/pdf/2512.129...

Reminder: Two weeks left to apply for the Assistant/Associate Professor positions in Theoretical Computer Science at Cambridge. Application deadline: 15 December 2025. Details and application portal: cst.cam.ac.uk/assistantass...

Wow! Yuansi Chen resolves 1 of the 2 remaining $1000 Talagrand problems (michel.talagrand.net/prizes/prize... ): If you take any f : {-1,+1}ⁿ → ℝ⁺ and apply the noise operator T_{.99}, the resulting function g = T_{.99} f satisfies a better-than-Markov inequality. That is, Pr[g > t E[g]] < o(1/t).

arXiv math.PR Probability@mathpr-bot.bsky.social · 8mo ago

Yuansi Chen: Talagrand's convolution conjecture up to loglog via perturbed reverse heat https://arxiv.org/abs/2511.19374 https://arxiv.org/pdf/2511.19374 https://arxiv.org/html/2511.19374

A new paper with the brilliant Guy Goldberg and Sidhant Saraogi (now on the job market!). We prove nearly tight lower bounds for relaxed LDCs via a new combinatorial notion of relaxed sunflowers with pseudorandom structure, obtained from new spread lemmas. eccc.weizmann.ac.il/report/2025/...

Join us for the first Quantum Cambridge–Oxford–Warwick Colloquium (Quantum COW, if you insist...), 11–12 December 2025 at the University of Oxford. This meeting focuses on Quantum Low-Depth Complexity, with talks, tutorials, and open discussions. Details: qcow.cs.ox.ac.uk