Subhasree Patro
About me
I completed my PhD in February 2023 from QuSoft, CWI which is also known as the Algorithms and Complexity group at CWI. Currently I am on two postdoc positions; 80% percent of my time in the Coding Theory and Cryptology group at Eindhoven University of Technology (TU/e) with Tanja Lange and the rest 20% of my time at QuSoft with Stacey Jeffery. I will be continuing at TU/e as a tenure tracker from 1 January 2025. Prior to that, I was a postdoc at Utrecht University jointly shared between the computer science and physics department at Utrecht University with Hans Bodlaender and Marjolein Dijkstra, respectively. I am broadly interested in the area of quantum computational complexity theory. More specifically, in quantum fine-grained complexity. In addition to that, I am also interested in classical decision tree complexity and quantum query complexity of Boolean relations, and their connections.I am also a mother of an adorable 6-year old.
Name: | Subhasree Patro |
Affiliation: | Eindhoven University of Technology and Centrum Wiskunde & Informatica, QuSoft |
Work address(es): | 6.146, MetaForum |
5612 AZ Eindhoven | |
The Netherlands | |
L218, CWI | |
Science Park 123 | |
1098 XG Amsterdam | |
The Netherlands | |
Email: | patrofied at gmail dot com |
Links: | CV, Google Scholar, dblp |
Publications and preprints
-
Quantum Sabotage Complexity with Arjan Cornelissen and Nikhil S. Mande
- To appear in the proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)
- Full version available at arXiv:2408.12595
-
QSETH Strikes Again: Finer Quantum Lower Bounds for Lattice Problem, Strong Simulation, Hitting Set Problem, and More with Yanlin Chen, Yilei Chen, Rajendra Kumar, Florian Speelman
- Full version available at arXiv:2309.16431
-
Teleportation of Quantum Coherence with Sohail, Arun K Pati, Vijeth Aradhya, Indranil Chakrabarty
- Published in journal of Physical Review A 108, 042620
- Full version available at arXiv:2302.11499
-
Matching Triangles and Triangle Collection: Hardness based on a Weak Quantum Conjecture with Andris Ambainis, Harry Buhrman, Koen Leijnse, Florian Speelman
- Full version available at arXiv:2207.11068
-
Memory Compression using Quantum Random-Access Gates with Harry Buhrman, Bruno Loff, Florian Speelman
- Published in proceedings of the 17th Theory of Quantum Computation, Communication, and Cryptography (TQC 2022)
- Full version available at arXiv:2203.05599
-
Improved Quantum Query Upper Bounds Based on Classical Decision Trees with Arjan Cornelissen and Nikhil S. Mande
- Presented at the non-proceedings track of Theory of Quantum Computation, Communication, and Cryptography (TQC 2022)
- Published in proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)
- Full version available at arXiv:2203.02968
-
Limits of quantum speed-ups for computational geometry and other problems: Fine-Grained Complexity via Quantum Walks with Harry Buhrman, Bruno Loff, Florian Speelman
- Presented at the 25th Annual Conference on Quantum Information Processing (QIP 2022)
- Published in proceedings of the 13th Innovations in Theoretical Computer Science Conference (ITCS 2022)
- Presented at the non-proceedings track of Theory of Quantum Computation, Communication, and Cryptography (TQC 2021)
- Full version available at arXiv:2106.02005
-
A Framework of Quantum Strong Exponential-Time Hypotheses
with Harry Buhrman and Florian Speelman
- Published in proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)
- Presented at the non-proceedings track of Theory of Quantum Computation, Communication, and Cryptography (TQC 2020)
- Full version available at arXiv:1911.05686
-
Impossibility of cloning of quantum coherence
with Dhrumil Patel, Chiranjeevi Vanarasa, Indranil Chakrabarty, and Arun Kumar Pati
- Published in journal of Physical Review A 103, 022422
- Full version available at arXiv:1806.05706
-
Non-negativity of conditional von Neumann entropy and global unitary operations
with Indranil Chakrabarty and Nirman Ganguly
- Published in journal of Physical Review A 96, 062102
- Full version available at arXiv:1703.01059
-
An overview of quantum algorithms: From quantum supremacy to shor factorization
with Alvaro Piedrafita
- Published in IEEE International Symposium on Circuits and Systems (ISCAS 2020)
Talks and Poster Presentations
- Invited talk on Quantum Algorithms at European Quantum Technology Summer School at Strasbourg 2024
-
Quantum Fine-Grained Complexity
- Invited talk at the DAMTP seminar at Cambridge University 2023
- Invited talk at Fine-Grained Cryptography Workshop at FSTTCS 2022
- Invited (virtual) talk at Quantum Innovators Workshop IQC 2022
-
Improved Quantum Query Upper Bounds Based on Classical Decision Trees
- Invited (virtual) talk at European Quantum Software Institute (EQSI) on October 10, 2023
- At FSTTCS on December 20, 2022
-
Matching Triangles and Triangle Collection: Hardness based on a Weak Quantum Conjecture
- Invited talk at Hon-Hai Research Institute on October 7, 2022
-
Memory Compression with Quantum Random-Access Gates
- Invited talk at IIIT-Hyderabad, India on August 4, 2022
- At TQC in July 2022
- Invited (virtual) talk at Stanford University on May 26, 2022
- Invited talk at IRIF, Paris in April 2022 (youtube video)
-
Fine-Grained Complexity via Quantum Walks
- At QIP on March 11, 2022
- At ITCS on January 31, 2022 (youtube video)
- At TQC on June 29, 2021 (youtube video)
- Invited (virtual) talk at IRIF, Paris on June 24, 2021 (youtube video)
- Invited (virtual) talk at NUS, Singapore on August 30, 2021
- Invited (virtual) talk at University of Bristol on November 10, 2021
-
A Framework of Quantum Strong Exponential-Time Hypotheses
- At TQC on June 12, 2020 (youtube video)
- At STACS on March 9, 2021 (youtube video)
- Poster presentation at QIP (pdf)
- Invited (virtual) talk at CQT, Singapore on February 2, 2021 (youtube video)
- Invited (virtual) talk at QuSoft, CWI on Dec 21, 2020 (youtube video)
- Invited talk at IIIT-Hyderabad, India on January 7, 2020
- Quantum Fine-Grained Complexity (in layperson’s terms) at the Scientific Meeting of CWI (link to the video)
- Quantum Walks and its Applications at IIIT Hyderabad, India on October 24, 2020 (youtube video)
- Non-Negativity of Conditional von Neumann Entropy and Global Unitary Operations at QuSoft, CWI (November 2, 2018)
Education
-
PhD in Quantum Computing at University of Amsterdam (October 2018 – December 2022)
Supervisors: Harry Buhrman and Florian Speelman
PhD thesis: Quantum Fine-Grained Complexity
Defence ceremony: link to the video -
MS by Research in Computer Science at International Institute of Information Technology Hyderabad, India (2015 – 2018)
Supervisors: Indranil Chakrabarty and Kannan Srinathan
Masters thesis: A few limits to Quantum Information Theory -
BTech in Computer Science at International Institute of Information Technology Hyderabad, India (2006 – 2010)
Teaching, Supervising and other Work Experiences
-
Masters project of Daan Schoneveld (2024)
Role: Co-superviser
-
Masters project of Koen Leijnse (2022)
Role: Co-superviser
-
Bachelors project of Daan Schoneveld (2022)
Role: Co-superviser
-
Introduction to Quantum Computing at University of Amsterdam (2019)
Role: Teaching Assistant
-
Discrete Mathematics and Linear Algebra at IIIT Hyderabad, India (2016 – 2018)
Role: Teaching Assistant
-
Microsoft IDC (2012 – 2015)
Role: Build Engineer - System Center - Virtual Machine Manager Team: Responsibilities included Functional Testing and Unit Test Automation
- WinSE Build and Packaging Team: Responsibilities included maintaining and optimizing the build and packaging automation for the updates to be shipped for Windows operating systems like Vista, Win7
-
C Programming and Data Structures at KIIT University, India (2010 – 2011)
Role: Lecturer
Awards and Recognitions
- Received Pat-On-The-Back award from Microsoft IDC in the first year of joining
- Secured an all India rank of 1301 in AIEEE’06 exam, an entrance test taken by about eight hundred thousand students all over the country
- Qualified State Level Maths Olympiad in Grade 11, 2004, secured an all India rank of 42 in National Cyber Olympiad in Grade 10, 2003
Other professional services
- I will serve on the program committee of QIP 2025
- I served on the program committee of TQC 2024
- Part of the WIQD organizing committee (January – October 2021)
- Subreviewer for FOCS, SODA, STOC, MFCS, QIP, ITCS, TQC, ICALP, SOFSEM, FSTTCS, ESA Algo, EPJ QT
- Co-organizer for QuSoft seminars from (2019 – 2021)