Supartha Podder
Assistant Professor,
Department of Computer Science,
Stony Brook University
Office NCS 151
email: Supartha @ cs.stonybrook.edu
Before coming to Stony Brook, I was a postdoc with Anne Broadbent at the University of Ottawa and with Scott Aaronson at UT Austin. I received my PhD in computer science from the Centre for Quantum Technologies, National University of Singapore in Singapore, under the supervision of Hartmut Klauck.
I obtained my masters from École Normale Supérieure de Cachan (now known as ENS Paris Saclay) (thesis advisor: Iordanis Kerenidis) and from Chennai Mathematical Institute (CMI). (thesis advisor: Meena Mahajan).
Announcements:
A postdoc position is available in quantum complexity theory. Write to me if you are interested.
Research
Interests: Quantum computing, Complexity theory, Quantum cryptography, Analysis of Boolean functions.
Revisiting BQP with Non-Collapsing Measurements
David Miloschewsky, Supartha Podder
Are uncloneable proof and advice states strictly necessary?
Rohit Chatterjee, Srijita Kundu, Supartha Podder
The Role of piracy in quantum proofs.
Anne Broadbent, Alex B. Grilo, Supartha Podder, Jamie Sikora
On the fine-grained query complexity of symmetric functions.
Supartha Podder, Penghui Yao, Zekun Ye
34th International Symposium on Algorithms and Computation (ISAAC 2023)
Decision Tree Complexity versus Block Sensitivity and Degree.
Rahul Chugh, Supartha Podder, Swagato Sanyal
43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2023)
Secure Software Leasing Without Assumptions.
Anne Broadbent, Stacey Jeffery, Sébastien Lord, Supartha Podder and Aarthi Sundaram
Presented at the 24th Annual Conference on Quantum Information Processing (QIP 2021)
Nineteenth Theory of Cryptography Conference (TCC 2021)
arXiv:2101.12739 | Presentation by Stacey Jeffery
Symmetries, graph properties, and quantum speedups.
Shalev Ben-David, Andrew M. Childs, András Gilyén, William Kretschmer, Supartha Podder, Daochen Wang
61st Annual Symposium of Foundations of Computer Science (FOCS 2020)
Presented at the 24th Annual Conference on Quantum Information Processing (QIP 2021)
arXiv:2006.12760 | FOCS talk | Video from a talk at PI
Communication memento: Memoryless communication complexity.
Srinivasan Arunachalam, Supartha Podder
12th Innovations in Theoretical Computer Science (ITCS 2021)
How symmetric is too symmetric for large quantum speedups?
Shalev Ben-David, Supartha Podder
This work is subsumed by the latest work: symmetries, graph properties, and quantum speedups arxiv:2006.12760
Exploring Different Models of Query Complexity and Communication Complexity.
Supartha Podder
Ph.D. thesis, Supervisor: Hartmut Klauck.
Graph properties in node-query setting: effect of symmetry-breaking.
Nikhil Balaji, Samir Datta, Raghav Kulkarni, Supartha Podder
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
Quantum Query Complexity of Subgraph Isomorphism and Homomorphism.
Raghav Kulkarni, Supartha Podder
33rd International Symposium on Theoretical Aspects of Computer Science (STACS 2016)
Poster: The 19th Conference on Quantum Information Processing (QIP 2016)
Abstract | arXiv:1509.06361 | Other
New Bounds for the Garden-Hose Model.
Hartmut Klauck, Supartha Podder
34th International Conference on Foundation of Software Technology and Theoretical Computer Science, (FSTTCS 2014)
Abstract | arXiv:1412.4904 | Other
Two Results about Quantum Messages.
Hartmut Klauck, Supartha Podder
39th International Symposium on Mathematical Foundations of Computer Science 2014 (MFCS 2014)
Poster: The 18th Conference on Quantum Information Processing (QIP 2015)
Abstract | arXiv:1402.4312 | Other
Bounds For Classical And Quantum Communication Complexity.
Supartha Podder
MPRI Master Thesis, Supervisor: Iordanis Kerenidis.
Group members
Thomas Huffstutler (PhD candidate, 2nd year)
Shabnam Jafarzadeh (PhD candidate, 2nd year)
David Miloschewsky (PhD candidate, 2nd year)
Past members:
Sinan Oral (Masters student)
Shreya Sinha (Masters, OPT)
Naman Gupta (Masters, summer intern)
Teaching
Course webpage: courses.suparthapodder.com
CSE 540 - Graduate Theory of Computation Fall 2024, Spring 2024
CSE 350 - Theory of Computation: Honors, Fall 2024, Fall 2023
CSE 550 - Quantum Computing and Applications: Spring 2023, Spring 2022
Intro. to Linear Algebra: Fall 2020 (University of Ottawa)
Discrete Mathematics for Computing: Winter 2019, Winter 2018 (University of Ottawa)
Service
Program committee member: TQC 2024, QCNC 2025
Reviewer for QIP, STOC, FOCS, ITCS, CCC, STAC, MFCS, FSTTCS, Qcrypt, EuroCrypt etc.
Contact
Links: Google scholar, twitter, linkedin
Email: supartha @ cs.stonybrook.edu
Phone: +1 (631) 632 4132
Address: Office no NCS 151
New Computer Science Building,
Engineering Dr,
Stony Brook, NY 11794
Extras
I (along with my few old friends from my undergrad college) run a Charity Organization named AALO for helping underprivileged students in India. Write me an email or visit http://aalo.org.in/ if you wish to donate.