Supartha Podder

Announcements:

• Undergraduate and Master’s research positions are available. 

Research 

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

• Quantum Speedups Through Function Extensions.
  Thomas Huffstutler, Upendra Kapshikar, Supartha Podder
  Submitted.
  
  

• Revisiting BQP with Non-Collapsing Measurements
  David Miloschewsky, Supartha Podder
  Submitted. [arXiv:2411.04085]
  
  

• The Role of Piracy in Quantum Proofs.
  Anne Broadbent, Alex B. Grilo, Supartha Podder, Jamie Sikora
  Submitted. [arXiv:2410.02228]
  
  

• Uncloneable Quantum States are Necessary as Proofs and Advice.
  Rohit Chatterjee, Srijita Kundu, Supartha Podder
  [arXiv:2410.11827]  [STOC 2025]
  
  

• On the Fine-Grained Query Complexity of Symmetric Functions.
  Supartha Podder, Penghui Yao, Zekun Ye
  [arXiv:2309.11279]  [Computational Complexity Journal 2025]  [ISAAC 2023]
  
  

• Symmetries, Graph Properties, and Quantum Speedups.
  Shalev Ben-David, Andrew M. Childs, András Gilyén, William Kretschmer, Supartha Podder, Daochen Wang
  [arXiv:2006.12760]  [SICOMP 2024]  [QIP 2021]  [FOCS 2020]  [Talk at PI]
  
  

• Decision Tree Complexity versus Block Sensitivity and Degree.
  Rahul Chugh, Supartha Podder, Swagato Sanyal
  [arXiv:2209.08042]  [FSTTCS 2023]
  
  

• Secure Software Leasing Without Assumptions.
  Anne Broadbent, Stacey Jeffery, Sébastien Lord, Supartha Podder and Aarthi Sundaram
  [arXiv:2101.12739]  [QIP 2021]  [TCC 2021]
  
  

• Communication Memento: Memoryless Communication Complexity.
  Srinivasan Arunachalam, Supartha Podder
  [arXiv:2005.04068]  [ITCS 2021]
  
  

• How Symmetric is Too Symmetric for Large Quantum Speedups?
  Shalev Ben-David, Supartha Podder
  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]
  
  

• Graph Properties in Node-Query Setting: Effect of Symmetry-Breaking.
  Nikhil Balaji, Samir Datta, Raghav Kulkarni, Supartha Podder
  [arxiv:1510.08267]  [MFCS 2016]
  
  

• Quantum Query Complexity of Subgraph Isomorphism and Homomorphism.
  Raghav Kulkarni, Supartha Podder
  [arXiv:1509.06361]  [STACS 2016]
  
  

• New Bounds for the Garden-Hose Model.
  Hartmut Klauck, Supartha Podder
  [arXiv:1412.4904]  [FSTTCS 2014]
  
  

• Two Results about Quantum Messages.
  Hartmut Klauck, Supartha Podder
  [arXiv:1402.4312]  [MFCS 2014] 
  
  
  

Group members

• Thomas Huffstutler (PhD candidate, since Jan 2023)

• Shabnam Jafarzadeh (PhD candidate, since Aug 2023)

• David Miloschewsky (PhD candidate, since Aug 2023)

• Samrudhdhi Suresh Pednekar (PhD candidate, AMS, since Jan 2025)

• Nicholas Santos (Undergrad CS Hons, since Jan 2025)

• Christos Psimadas (Undergrad CS Hons, since Jan 2025)

Past members:

• Sinan Oral (Masters student, Physics)

• Shreya Sinha (Masters, OPT)

• Naman Gupta (Masters, summer intern)

Teaching

Course webpage: courses.suparthapodder.com

CSE  550 - Quantum Computing and Applications: [S23, S22, F25]
CSE 540 - Graduate Theory of Computation [F24, S24, F25]
CSE 350 - Theory of Computation: Honors, [F24, F23]

Intro. to Linear Algebra: [F20 uOttawa]
Discrete Mathematics for Computing: [W19, W18 uOttawa] 

Service

Program committee member: TQC 2024, QCNC 2025

Reviewer for QIP, TQC, STOC, FOCS, ITCS, CCC, STAC, MFCS, FSTTCS, Qcrypt, EuroCrypt

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