Ansis Rosmanis

Designated Assistant Professor
Nagoya University
Graduate School of Mathematics

Nagoya University
School of Science, building A
Furo-cho, Chikusa-ku, Nagoya
464-8601, Japan

Room A241





The following list occasionally gets outdated, so my Google Scholar page might be more up to date.

N. Lindzey and A. Rosmanis.
A Tight Lower Bound For Non-Coherent Index Erasure,
arXiv:1902.07336. Accepted for ITCS 2020.

Y. Hamoudi, P. Rebentrost, A. Rosmanis, and M. Santha
Quantum and classical algorithms for approximate submodular function minimization,
Quantum Information & Computation, Vol.19, No.15&16, pages 1325–1349, December, 2019.

F. Le Gall, H. Nishimura, and A. Rosmanis.
Quantum Advantage for the LOCAL Model in Distributed Computing,
Proceedings of 36th International Symposium on Theoretical Aspects of Computer Science, pages 49:1–49:14, 2019.

A. Belovs and A. Rosmanis.
Quantum Lower Bounds for Tripartite Versions of the Hidden Shift and the Set Equality Problems,
Proceedings of 13th Conference on the Theory of Quantum Computation, Communication, and Cryptography, pages 3:1–3:15, July, 2018.

A. Belovs and A. Rosmanis.
Adversary lower bounds for the collision and the set equality problems,
Quantum Information & Computation, Vol.18, No.3&4, pages 198–222, March, 2018.

G. Gutoski, A. Rosmanis, and J. Sikora.
Fidelity of quantum strategies with applications to cryptography,
Proceedings of 12th Conference on the Theory of Quantum Computation, Communication, and Cryptography, pages 8:1–8:13, February, 2018.

A. Ambainis, A. Rosmanis, and D. Unruh.
Quantum Attacks on Classical Proof Systems: The Hardness of Quantum Rewinding,
Proceedings of the IEEE 55th Symposium on Foundations of Computer Science, pages 474–483, October, 2014.

A. Rosmanis.
Quantum Adversary Lower Bound for Element Distinctness with Small Range,
Chicago Journal of Theoretical Computer Science, Article 04, pages 1–27, July, 2014.

A. Belovs and A. Rosmanis.
On the power of non-adaptive learning graphs,
Proceedings of the IEEE 28th Conference on Computational Complexity, pages 44–55, September, 2013.

A. Rosmanis.
Fixed space of positive trace-preserving super-operators,
Linear Algebra and its Applications, 437(7), pages 1704–1721, October, 2012.

A. Rosmanis.
Quantum snake walk on graphs,
Physical Review A 83, 022304, February, 2011.

A. Belovs, A. Rosmanis, and J. Smotrovs.
Multi-letter reversible and quantum finite automata,
Proceedings of the 11th International Conference “Developments in Language Theory”, pages 60–71, July, 2007.

M. Ozols, L. Mančinska, I. Dzelme-Bērziņa, R. Agadžanjans, and A. Rosmanis.
Principles of optimal probabilistic decision tree construction,
Proceedings of the 6th International Conference on Foundations of Computer Science, pages 116–122, June, 2006.

Teaching (National University of Singapore)

QT5201Q, Quantum Algorithms (Academic year 2018/2019, Semester 1)

PhD Thesis

Lower Bounds on Quantum Query and Learning Graph Complexities, University of Waterloo, 2014 (PDF, Errata)