Supartha Podder


I am currently doing my 2nd postdoc with Anne Broadbent at the University of Ottawa in Ottawa, Canada. Previously, I was a postdoc with Scott Aaronson at UT Austin in Austin, TX, United States.

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

Before coming to CQT I obtained my MPRI (Parisian Master of Research in Computer Science) from École Normale Supérieure de Cachan (ENS de Cachan) in Paris, France. My Master thesis advisor was Iordanis Kerenidis. Even before that, I was at Chennai Mathematical Institute (CMI) in Chennai, India. There, my thesis advisor was Meena Mahajan.




Academic Interests 

I am interested in theoretical computer science. In particular I am interested in classical and quantum complexity theory. Currently I am focusing on query complexity, communication complexity and different aspects of quantum computation.


Papers


  Symmetries, graph properties, and quantum speedups
        Shalev Ben-David, Andrew M. Childs, András Gilyén, William Kretschmer, Supartha Podder, Daochen Wang
        To appear in 61st Annual Symposium of Foundations of Computer Science (FOCS 2020)
        arxiv:2006.12760


  Communication memento: Memoryless communication complexity
        Srinivasan Arunachalam, Supartha Podder
        arxiv:2005.04068


  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


  Power of Unbounded-Width Polynomial-Size Permutation Branching Programs.
        
Hartmut Klauck, Supartha Podder
        Abstract  |  arxiv  |  Other


  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
  






Ph.D. Thesis

Exploring Different Models of Query Complexity and Communication Complexity.
   
Supartha Podder
   Supervisor: Hartmut Klauck.
   Link to the file  |  Other



MPRI Master Thesis

Bounds For Classical And Quantum Communication Complexity.
  
Supartha Podder
   Supervisor: Iordanis Kerenidis.
   Link to the file  |  Other



Teaching

Upcoming: MAT1341 E - Intro. to Linear Algebra (Fall 2020)
Discrete Mathematics for Computing (Winter 2019)
Discrete Mathematics for Computing (Winter 2018)




Summer Student

Alexander Kerzner (B.Sc. Maths final year, McMaster University)  (May - August 2018)



Contact


Address:



Current : Department of Mathematics and Statistics,
University of Ottawa,
626, 150 Louis-Pasteur,
Ottawa, ON, Canada K1N 6N5


Office :
Phone:

626 STEM Complex
+1 (613) 562 5800 ext. 3498
 
Email: it is my first name at google's free email service.





Extras

We (few friends from my undergrad college) run a Charity Organization named AALO for helping poor students in India. Go to http://aalo.org.in/ if you wish to donate.


Follow me on Twitter if you like.