Chaithanya Rayudu
@the-chaits.bsky.social
PhD Student at University of New Mexico. Trying to understand what quantum computers can and can't do.
https://www.chaithanyarss.com/
https://www.chaithanyarss.com/
Reposted by Chaithanya Rayudu
Thoughtful (as always) blog post from Nicholas Carlini. "Are large language models worth it?" A nice read giving his perspective on risks of ML models.
Post: nicholas.carlini.com/writing/2025...
For people who prefer, this is the video of the talk from @colmweb.org www.youtube.com/watch?v=PngH...
Post: nicholas.carlini.com/writing/2025...
For people who prefer, this is the video of the talk from @colmweb.org www.youtube.com/watch?v=PngH...
November 19, 2025 at 4:56 PM
Thoughtful (as always) blog post from Nicholas Carlini. "Are large language models worth it?" A nice read giving his perspective on risks of ML models.
Post: nicholas.carlini.com/writing/2025...
For people who prefer, this is the video of the talk from @colmweb.org www.youtube.com/watch?v=PngH...
Post: nicholas.carlini.com/writing/2025...
For people who prefer, this is the video of the talk from @colmweb.org www.youtube.com/watch?v=PngH...
Reposted by Chaithanya Rayudu
Our team at IBM is looking for interns! If you are interested in researching fault-tolerant quantum algorithms, please apply here: ibmglobal.avature.net/en_US/career...
Intern 2026: Fault-tolerant quantum algorithms
ibmglobal.avature.net
November 12, 2025 at 11:22 PM
Our team at IBM is looking for interns! If you are interested in researching fault-tolerant quantum algorithms, please apply here: ibmglobal.avature.net/en_US/career...
New paper on arxiv: We show that a practical Markov chain for stoquastic XY Hamiltonians is fast mixing. This Markov chain is also known to empirically mix fast for Qmaxcut on bipartite graphs which if proven would resolve the complexity of Qmaxcut on bipartite graphs.
arxiv.org/abs/2509.21683
arxiv.org/abs/2509.21683
October 10, 2025 at 12:09 AM
New paper on arxiv: We show that a practical Markov chain for stoquastic XY Hamiltonians is fast mixing. This Markov chain is also known to empirically mix fast for Qmaxcut on bipartite graphs which if proven would resolve the complexity of Qmaxcut on bipartite graphs.
arxiv.org/abs/2509.21683
arxiv.org/abs/2509.21683
Reposted by Chaithanya Rayudu
The QIP 2026 call for papers is out! QIP 2026 will be held in Riga, Latvia from January 24–30, 2026. See you there!
qip2026.lu.lv
qip2026.lu.lv
August 6, 2025 at 12:44 AM
The QIP 2026 call for papers is out! QIP 2026 will be held in Riga, Latvia from January 24–30, 2026. See you there!
qip2026.lu.lv
qip2026.lu.lv
Reposted by Chaithanya Rayudu
Our *new paper* explores how flexibility in social categories like gender and race can undermine unfair norms. If we can't read an identity, we can't use it to underpin discrimination. We show even a little confusion can be powerful, and advocate identity play
philsci-archive.pitt.edu/26062/
philsci-archive.pitt.edu/26062/
Fairness and Signaling in Bargaining Games - PhilSci-Archive
philsci-archive.pitt.edu
July 31, 2025 at 6:57 PM
Our *new paper* explores how flexibility in social categories like gender and race can undermine unfair norms. If we can't read an identity, we can't use it to underpin discrimination. We show even a little confusion can be powerful, and advocate identity play
philsci-archive.pitt.edu/26062/
philsci-archive.pitt.edu/26062/
Reposted by Chaithanya Rayudu
This is surprisingly beautiful. McSweeney's is like The Onion, but with more layers.
"You are not your feelings.
You are the cracked cup holding them.
Still useful.
Still capable of holding tea. Or rage.
But preferably tea."
www.mcsweeneys.net/articles/if-... @mcsweeneys.net
"You are not your feelings.
You are the cracked cup holding them.
Still useful.
Still capable of holding tea. Or rage.
But preferably tea."
www.mcsweeneys.net/articles/if-... @mcsweeneys.net
If Charles Bukowski Wrote a Children’s Book About Emotional Regulation
Sometimes you feel like a fist.
Other times, you feel like the ashtray after a party
no one invited you to.
Both are fine.
Just don’t throw the fis...
www.mcsweeneys.net
June 12, 2025 at 2:13 AM
This is surprisingly beautiful. McSweeney's is like The Onion, but with more layers.
"You are not your feelings.
You are the cracked cup holding them.
Still useful.
Still capable of holding tea. Or rage.
But preferably tea."
www.mcsweeneys.net/articles/if-... @mcsweeneys.net
"You are not your feelings.
You are the cracked cup holding them.
Still useful.
Still capable of holding tea. Or rage.
But preferably tea."
www.mcsweeneys.net/articles/if-... @mcsweeneys.net
Reposted by Chaithanya Rayudu
Accepted papers at TQC 2025. tqc-conference.org/accepted-tal.... Many interesting-looking titles!
Accepted talks | TQC Conference 2025
tqc-conference.org
May 10, 2025 at 4:23 PM
Accepted papers at TQC 2025. tqc-conference.org/accepted-tal.... Many interesting-looking titles!
Reposted by Chaithanya Rayudu
Hello world! The quantum journal is now on BlueSky!
November 28, 2024 at 10:48 AM
Hello world! The quantum journal is now on BlueSky!
Does anyone know when and where TQC 2025 is happening?
January 17, 2025 at 10:05 PM
Does anyone know when and where TQC 2025 is happening?
Reposted by Chaithanya Rayudu
Interesting but perhaps not exactly breaking (at least as a headline). Richard Jozsa argued, over 25 years ago, that "doing nothing" is an essential ingredient for quantum speed-ups: arxiv.org/abs/quant-ph...
Quantum Effects in Algorithms
We discuss some seemingly paradoxical yet valid effects of quantum physics in information processing. Firstly, we argue that the act of ``doing nothing'' on part of an entangled quantum system is a hi...
arxiv.org
November 26, 2024 at 5:30 PM
Interesting but perhaps not exactly breaking (at least as a headline). Richard Jozsa argued, over 25 years ago, that "doing nothing" is an essential ingredient for quantum speed-ups: arxiv.org/abs/quant-ph...
Check out my recent paper on Fermionic generalization of the Independent Set problem. I define the problem and prove that it is QMA-hard. This problem is interesting for multiple reasons:
Chaithanya Rayudu
Fermionic Independent Set and Laplacian of an independence complex are QMA-hard
https://arxiv.org/abs/2411.03230
Fermionic Independent Set and Laplacian of an independence complex are QMA-hard
https://arxiv.org/abs/2411.03230
November 21, 2024 at 8:16 PM
Check out my recent paper on Fermionic generalization of the Independent Set problem. I define the problem and prove that it is QMA-hard. This problem is interesting for multiple reasons: