Supartha Podder

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


Assistant Professor,

Department of Computer Science,

Stony Brook University

Office NCS 151

email: Supartha @ cs.stonybrook.edu


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).

Research 

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



On the fine-grained query complexity of symmetric functions.

        Supartha Podder, Penghui Yao, Zekun Ye

         34th International Symposium on Algorithms and Computation (ISAAC 2023)

arxiv:2309.11279


 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)

        arxiv:2209.08042 


  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)

        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

            arxiv:2001.09642


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

       arxiv:1510.08267 


  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 





Group members

Thomas Huffstutler (PhD candidate)

David Miloschewsky (PhD candidate)

Shabnam Jafarzadeh (PhD candidate)

Sinan Oral (Masters student)

Past members:

Shreya Sinha (Masters, OPT)

Naman Gupta (Masters, summer intern)





Teaching

CSE 540 - Graduate Theory of Computation Spring 2024, and (upcoming) Fall 2024

CSE 350 - Theory of Computation: Honors, Fall 2023, and (upcoming) Fall 2024

CSE  550 - Quantum Computing and Applications: Spring 2023, Spring 2022

Intro. to Linear Algebra: Fall 2020, Discrete Mathematics for Computing: Winter 2019, Winter 2018 (University of Ottawa)



Service

Program committee member: TQC 2024

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

      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.