Supartha Podder

(Name pronunciation: Su-per-tho Pod-dar, he/him)

About me

Assistant Professor,

Computer Science Department,

Stony Brook University

Office NCS 151

email: supartha @

Before November 2021, 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 (ENS de Cachan) (thesis advisor: Iordanis Kerenidis) and from Chennai Mathematical Institute (CMI). (thesis advisor: Meena Mahajan).

Advertisement: Looking for PhD and masters students. Write to me if you are interested.


Interests: Quantum computing, Complexity theory, Quantum cryptography, Analysis of Boolean functions.

Decision Tree Complexity versus Block Sensitivity and Degree.

Rahul Chugh, Supartha Podder, Swagato Sanyal


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)

To appear in the 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)

arxiv:2005.04068 | ITCS talk

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.

Link to the file

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.

Link to the file


CSE 550 - Quantum Computing and Applications (Spring 2022) at Stony Brook (Upcoming)

Intro. to Linear Algebra (Fall 2020) at University of Ottawa

Discrete Mathematics for Computing (Winter 2019) at University of Ottawa

Discrete Mathematics for Computing (Winter 2018) at University of Ottawa


Links: Google scholar, twitter,

Email: it is my first name

Phone: +1 (631) 632 4132

Address: Office no NCS 151

Computer Science Building,

Engineering Dr,

Stony Brook, NY 11794


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 if you wish to donate.