Sagnik Chatterjee
@chatsagnik.bsky.social
Quantum Computing, Learning Theory, Boolean functions. PhD@IIITD.
Website: https://chatsagnik.github.io/
Blog: https://theoretickles.netlify.app/
Website: https://chatsagnik.github.io/
Blog: https://theoretickles.netlify.app/
Today on X: Came across a post by someone I deeply respected as a researcher.
The context in this post is illegal immigration to "first world countries".
I mean wtf?
I get that people in the "Global North" don't want illegal immigration. That's fair.
WTF though?
The context in this post is illegal immigration to "first world countries".
I mean wtf?
I get that people in the "Global North" don't want illegal immigration. That's fair.
WTF though?
July 12, 2025 at 3:32 PM
Today on X: Came across a post by someone I deeply respected as a researcher.
The context in this post is illegal immigration to "first world countries".
I mean wtf?
I get that people in the "Global North" don't want illegal immigration. That's fair.
WTF though?
The context in this post is illegal immigration to "first world countries".
I mean wtf?
I get that people in the "Global North" don't want illegal immigration. That's fair.
WTF though?
📜🚨Excited to report arxiv.org/abs/2504.15265!
We give a microwave-only, parametric framework (GCR) that directly enables entanglement on the 1–2 subspace (inaccessible via CR) and achieves gate fidelities up to 99.73%, alongside 99.06%-fidelity Bell state in 514ns (beating cross-Kerr SOTA).
We give a microwave-only, parametric framework (GCR) that directly enables entanglement on the 1–2 subspace (inaccessible via CR) and achieves gate fidelities up to 99.73%, alongside 99.06%-fidelity Bell state in 514ns (beating cross-Kerr SOTA).
Realization of maximally-entangling two-qutrit gates using the Cross-Resonance scheme
In this letter, we introduce the generalized cross-resonance scheme (GCR) which is a comprehensive theoretical framework that generalize the qubit-centric cross-resonance (CR) interaction beyond the 0...
arxiv.org
June 11, 2025 at 4:53 PM
📜🚨Excited to report arxiv.org/abs/2504.15265!
We give a microwave-only, parametric framework (GCR) that directly enables entanglement on the 1–2 subspace (inaccessible via CR) and achieves gate fidelities up to 99.73%, alongside 99.06%-fidelity Bell state in 514ns (beating cross-Kerr SOTA).
We give a microwave-only, parametric framework (GCR) that directly enables entanglement on the 1–2 subspace (inaccessible via CR) and achieves gate fidelities up to 99.73%, alongside 99.06%-fidelity Bell state in 514ns (beating cross-Kerr SOTA).
The QED at the end really cements this analogy.
This is the quantum version of "Our Father who art in heaven,
hallowed be thy name..."
hallowed be thy name..."
States 𝜌 are psd matrices with unit trace; measurements E_k are psd and ∑_k E_k = Id; probability of outcome k is Tr(E_k 𝜌); Dynamics are unitary matrices acting by conjugation. Computations start in some state, |0⟩⟨0|^⊗n, apply local unitaries and output is a measurement in the standard basis. QED
May 17, 2025 at 7:29 AM
The QED at the end really cements this analogy.
Reposted by Sagnik Chatterjee
Excited to share my 5-lecture mini-course 🎬 on "Quantum Recursive Programming"! An elegant way to program complicated quantum algorithms ⚛️
*No prior QC or PL knowledge is needed!
Given during my visit to DIMACS at Rutgers University.
(www.youtube.com/playlist?lis...)
(1/4)
*No prior QC or PL knowledge is needed!
Given during my visit to DIMACS at Rutgers University.
(www.youtube.com/playlist?lis...)
(1/4)
Quantum recursive programs - YouTube
Talks given at DIMACS, Rutgers University during April and May 2025 by Zhicheng Zhang, a PhD student at University of Technology Sydney
www.youtube.com
April 29, 2025 at 5:55 PM
Excited to share my 5-lecture mini-course 🎬 on "Quantum Recursive Programming"! An elegant way to program complicated quantum algorithms ⚛️
*No prior QC or PL knowledge is needed!
Given during my visit to DIMACS at Rutgers University.
(www.youtube.com/playlist?lis...)
(1/4)
*No prior QC or PL knowledge is needed!
Given during my visit to DIMACS at Rutgers University.
(www.youtube.com/playlist?lis...)
(1/4)
Reposted by Sagnik Chatterjee
Today #quantum arXiv selection: quantum error correction (QEC) for trapped ions, quantum simulation of open quantum system, noise-specific QEC, variational quantum algorithm, quantum annealing with error mitigation, and data encoding.
More details and links below:
More details and links below:
March 31, 2025 at 3:32 PM
Today #quantum arXiv selection: quantum error correction (QEC) for trapped ions, quantum simulation of open quantum system, noise-specific QEC, variational quantum algorithm, quantum annealing with error mitigation, and data encoding.
More details and links below:
More details and links below:
Reposted by Sagnik Chatterjee
Hooray, I received a Vici grant from the Dutch science foundation!
Heads up for current PhD students in learning theory: I will have two postdoc positions available in Amsterdam on "learning theory for interpretable/explainable AI" in the coming years.
www.uva.nl/shared-conte...
Heads up for current PhD students in learning theory: I will have two postdoc positions available in Amsterdam on "learning theory for interpretable/explainable AI" in the coming years.
www.uva.nl/shared-conte...
NWO Vici grants awarded to six UvA/AMC researchers
Six UvA and AMC academics have been awarded Vici grants worth up to €1.5 million by the Dutch Research Council (NWO), to pursue research into topics ranging from black holes to combatting obesity. The...
www.uva.nl
March 1, 2025 at 2:16 PM
Hooray, I received a Vici grant from the Dutch science foundation!
Heads up for current PhD students in learning theory: I will have two postdoc positions available in Amsterdam on "learning theory for interpretable/explainable AI" in the coming years.
www.uva.nl/shared-conte...
Heads up for current PhD students in learning theory: I will have two postdoc positions available in Amsterdam on "learning theory for interpretable/explainable AI" in the coming years.
www.uva.nl/shared-conte...
Today I was kicked off a paper, I had conceived, led for a year, and done most of the lifting for.
Why? I objected to the fact that someone got added with no contribution, simply by virtue of being my collaborator's advisor.
One of those things that you cannot believe can happen; until it does.
Why? I objected to the fact that someone got added with no contribution, simply by virtue of being my collaborator's advisor.
One of those things that you cannot believe can happen; until it does.
February 12, 2025 at 2:13 PM
Today I was kicked off a paper, I had conceived, led for a year, and done most of the lifting for.
Why? I objected to the fact that someone got added with no contribution, simply by virtue of being my collaborator's advisor.
One of those things that you cannot believe can happen; until it does.
Why? I objected to the fact that someone got added with no contribution, simply by virtue of being my collaborator's advisor.
One of those things that you cannot believe can happen; until it does.
A good start to the new year!
📜Our paper "Generalization Bounds for Dependent Data using Online-to-Batch Conversion" was accepted to AISTATS 2025!
In this work, we give generalization bounds for statistical learners trained on non-i.i.d. data using the Online-to-Batch conversion framework. (1/3)
📜Our paper "Generalization Bounds for Dependent Data using Online-to-Batch Conversion" was accepted to AISTATS 2025!
In this work, we give generalization bounds for statistical learners trained on non-i.i.d. data using the Online-to-Batch conversion framework. (1/3)
January 23, 2025 at 6:08 AM
A good start to the new year!
📜Our paper "Generalization Bounds for Dependent Data using Online-to-Batch Conversion" was accepted to AISTATS 2025!
In this work, we give generalization bounds for statistical learners trained on non-i.i.d. data using the Online-to-Batch conversion framework. (1/3)
📜Our paper "Generalization Bounds for Dependent Data using Online-to-Batch Conversion" was accepted to AISTATS 2025!
In this work, we give generalization bounds for statistical learners trained on non-i.i.d. data using the Online-to-Batch conversion framework. (1/3)
A video summarising the first time I tried opening a window in Europe.
December 22, 2024 at 1:24 PM
A video summarising the first time I tried opening a window in Europe.
Reposted by Sagnik Chatterjee
*PLS SHARE*
Open position for an *Associate Professor* in Machine Learning at our department (@enginyeria-upf.bsky.social / @upf.edu), via the Serra Hunter programme.
DEADLINE: January 13th 2025
www.upf.edu/web/personal...
Open position for an *Associate Professor* in Machine Learning at our department (@enginyeria-upf.bsky.social / @upf.edu), via the Serra Hunter programme.
DEADLINE: January 13th 2025
www.upf.edu/web/personal...
Professor Agregat Serra Húnter. Departament d'Enginyeria
Convocatòria 2024-30 PDI Serra Húnter Obert Convocatòria 2024-30
Adscripció: Department: Enginyeria Profile: Machine Learning Termini de
sol·licituds: 13/01/2025 Data de publicació a la web:...
www.upf.edu
December 21, 2024 at 6:08 PM
*PLS SHARE*
Open position for an *Associate Professor* in Machine Learning at our department (@enginyeria-upf.bsky.social / @upf.edu), via the Serra Hunter programme.
DEADLINE: January 13th 2025
www.upf.edu/web/personal...
Open position for an *Associate Professor* in Machine Learning at our department (@enginyeria-upf.bsky.social / @upf.edu), via the Serra Hunter programme.
DEADLINE: January 13th 2025
www.upf.edu/web/personal...
Reposted by Sagnik Chatterjee
Announcing the accepted papers for ALT 2025! It was a very competitive year, and we were able to accept only 51 of 144 submissions. Thanks to my co-chair Po-Ling Loh and the entire program committee for their hard work!
See you in Milan in February!
algorithmiclearningtheory.org/alt2025/acce...
See you in Milan in February!
algorithmiclearningtheory.org/alt2025/acce...
December 20, 2024 at 2:57 PM
Announcing the accepted papers for ALT 2025! It was a very competitive year, and we were able to accept only 51 of 144 submissions. Thanks to my co-chair Po-Ling Loh and the entire program committee for their hard work!
See you in Milan in February!
algorithmiclearningtheory.org/alt2025/acce...
See you in Milan in February!
algorithmiclearningtheory.org/alt2025/acce...
Reposted by Sagnik Chatterjee
Making a #gamedev starterpack for (mostly) solo game developers working on cool projects. I've added a bunch of friends of mine you should all check out.
Leave a comment below if you're a solo #indiedev and want to be added!
go.bsky.app/15UnZcn
Leave a comment below if you're a solo #indiedev and want to be added!
go.bsky.app/15UnZcn
December 19, 2024 at 4:21 PM
Making a #gamedev starterpack for (mostly) solo game developers working on cool projects. I've added a bunch of friends of mine you should all check out.
Leave a comment below if you're a solo #indiedev and want to be added!
go.bsky.app/15UnZcn
Leave a comment below if you're a solo #indiedev and want to be added!
go.bsky.app/15UnZcn
Reposted by Sagnik Chatterjee
At QTML 2024, I spoke about recent work with Robert Huang on "Learning shallow quantum circuits with many-qubit gates" (a.k.a. efficient learning of QAC^0 unitaries). In this ~15min talk I discuss the project motivation, key results, and high-level proof ideas.
www.youtube.com/watch?v=iRiJ...
www.youtube.com/watch?v=iRiJ...
Learning shallow quantum circuits with many-qubit gates - Francisca Vasconcelos
YouTube video by QTML Conference
www.youtube.com
December 18, 2024 at 6:16 PM
At QTML 2024, I spoke about recent work with Robert Huang on "Learning shallow quantum circuits with many-qubit gates" (a.k.a. efficient learning of QAC^0 unitaries). In this ~15min talk I discuss the project motivation, key results, and high-level proof ideas.
www.youtube.com/watch?v=iRiJ...
www.youtube.com/watch?v=iRiJ...
Reposted by Sagnik Chatterjee
It seems like a tradition is emerging here, and it is out duty to maintain it. So here is my part announcing the publication of our review in semidefinite programming for characterizing quantum correlations @dulwichquantum.bsky.social
journals.aps.org/rmp/abstract...
journals.aps.org/rmp/abstract...
December 14, 2024 at 4:07 PM
It seems like a tradition is emerging here, and it is out duty to maintain it. So here is my part announcing the publication of our review in semidefinite programming for characterizing quantum correlations @dulwichquantum.bsky.social
journals.aps.org/rmp/abstract...
journals.aps.org/rmp/abstract...
Reposted by Sagnik Chatterjee
Reposted by Sagnik Chatterjee
"This visitor program serves to connect mathematicians* from diverse corners of the 🌍 to engage in meaningful discussion, exchange knowledge and ideas, and establish lasting connections w/ researchers in Australia"
*At all career stages!
mathematical-research-institute.sydney.edu.au/internationa...
*At all career stages!
mathematical-research-institute.sydney.edu.au/internationa...
December 16, 2024 at 9:01 AM
"This visitor program serves to connect mathematicians* from diverse corners of the 🌍 to engage in meaningful discussion, exchange knowledge and ideas, and establish lasting connections w/ researchers in Australia"
*At all career stages!
mathematical-research-institute.sydney.edu.au/internationa...
*At all career stages!
mathematical-research-institute.sydney.edu.au/internationa...
December 14, 2024 at 6:12 PM
Return of my favourite account 🤣
December 11, 2024 at 1:23 PM
Return of my favourite account 🤣
Reposted by Sagnik Chatterjee
Algorithmic Foundations of ML -- A lecture series supported by Walmart Center for Tech Excellence at CSA, Indian Institute of Science (IISc).
Webpage: events.csa.iisc.ac.in/afml/index.h...
(see for the schedule and online live-streaming link)
Webpage: events.csa.iisc.ac.in/afml/index.h...
(see for the schedule and online live-streaming link)
December 9, 2024 at 5:26 PM
Algorithmic Foundations of ML -- A lecture series supported by Walmart Center for Tech Excellence at CSA, Indian Institute of Science (IISc).
Webpage: events.csa.iisc.ac.in/afml/index.h...
(see for the schedule and online live-streaming link)
Webpage: events.csa.iisc.ac.in/afml/index.h...
(see for the schedule and online live-streaming link)
Reposted by Sagnik Chatterjee
We absorb information from those who are 2 years ahead of us. We help those who are 2 years behind us.
December 9, 2024 at 4:39 PM
We absorb information from those who are 2 years ahead of us. We help those who are 2 years behind us.
I am undergoing one of the strangest review periods at AISTATS right now. We got 4 truly excellent reviews, something that is a rarity nowadays. However, it has been close to 8 days since we posted our clarifications, and there has been *zero* engagement from any reviewer since then.
1/3
1/3
December 8, 2024 at 6:42 PM
I am undergoing one of the strangest review periods at AISTATS right now. We got 4 truly excellent reviews, something that is a rarity nowadays. However, it has been close to 8 days since we posted our clarifications, and there has been *zero* engagement from any reviewer since then.
1/3
1/3
Reposted by Sagnik Chatterjee
🚨Applications for LANL's 2025 Quantum Computing Summer School are open!
Please apply here
👇
lanl-summer-school-programs.wizehive.app/program/quan...
Reposts appreciated!
Please apply here
👇
lanl-summer-school-programs.wizehive.app/program/quan...
Reposts appreciated!
Program
lanl-summer-school-programs.wizehive.app
December 5, 2024 at 4:04 PM
🚨Applications for LANL's 2025 Quantum Computing Summer School are open!
Please apply here
👇
lanl-summer-school-programs.wizehive.app/program/quan...
Reposts appreciated!
Please apply here
👇
lanl-summer-school-programs.wizehive.app/program/quan...
Reposts appreciated!
Reposted by Sagnik Chatterjee
I wrote a survey article on computationally efficient methods for "robust" mean estimation, including robustness to contamination, heavy-tailed data, or in the sense of differential privacy.
The same ideas are useful for all 3 (seemingly-different) forms of robustness! 1/2
arxiv.org/abs/2412.02670
The same ideas are useful for all 3 (seemingly-different) forms of robustness! 1/2
arxiv.org/abs/2412.02670
December 4, 2024 at 2:11 PM
I wrote a survey article on computationally efficient methods for "robust" mean estimation, including robustness to contamination, heavy-tailed data, or in the sense of differential privacy.
The same ideas are useful for all 3 (seemingly-different) forms of robustness! 1/2
arxiv.org/abs/2412.02670
The same ideas are useful for all 3 (seemingly-different) forms of robustness! 1/2
arxiv.org/abs/2412.02670
Reposted by Sagnik Chatterjee
Chi-Fang Chen, Jeongwan Haah, Jonas Haferkamp, Yunchao Liu, Tony Metger, Xinyu Tan
Incompressibility and spectral gaps of random circuits
https://arxiv.org/abs/2406.07478
Incompressibility and spectral gaps of random circuits
https://arxiv.org/abs/2406.07478
December 3, 2024 at 1:01 PM
Chi-Fang Chen, Jeongwan Haah, Jonas Haferkamp, Yunchao Liu, Tony Metger, Xinyu Tan
Incompressibility and spectral gaps of random circuits
https://arxiv.org/abs/2406.07478
Incompressibility and spectral gaps of random circuits
https://arxiv.org/abs/2406.07478