Subhasree Patro

Full Name: S. Patro
Function(s): PhD student

Email: Subhasree.Patro@cwi.nl
Telephone: +31 20 592 4116
Room: L218
Department(s): Algorithms and Complexity
Homepage: https://subhasree-patro.github.io/

Biography

I am a Ph.D. student in the Algorithms and Complexity Group at QuSoft, CWI supervised by Harry Buhrman and Florian Speelman. 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 the connections between them.

Publications

Buhrman, H.M, Loff Barreto, B. S, Patro, S, & Speelman, F. (2022). Memory compression with quantum random-access gates. In Leibniz International Proceedings in Informatics, LIPIcs. doi:10.4230/LIPIcs.TQC.2022.10
Buhrman, H.M, Loff Barreto, B. S, Patro, S, & Speelman, F. (2022). Limits of quantum speed-ups for computational geometry and other problems: Fine-grained complexity via quantum walks. In Proceedings of the 13th Innovations in Theoretical Computer Science Conference, ITCS 2022 (pp. 31.1–31.12). doi:10.4230/LIPIcs.ITCS.2022.31
Patro, S, & Piedrafita Postigo, A. (2020). An overview of quantum algorithms: From quantum supremacy to Shor factorization. In 2020 IEEE International Symposium on Circuits and Systems (pp. 1–5). doi:10.1109/ISCAS45731.2020.9180793

Current projects with external funding

Quantum Algorithms in a Practical Setting ()