Ansis Rosmanis
Ansis Rosmanis
Designated Assistant Professor, Graduate School of Mathematics, Nagoya University
Verified email at
Cited by
Cited by
Quantum attacks on classical proof systems: The hardness of quantum rewinding
A Ambainis, A Rosmanis, D Unruh
Foundations of Computer Science (FOCS), 2014 IEEE 55th Annual Symposium on …, 2014
On the power of non-adaptive learning graphs
A Belovs, A Rosmanis
computational complexity 23 (2), 323-354, 2014
Multi-letter reversible and quantum finite automata
A Belovs, A Rosmanis, J Smotrovs
International Conference on Developments in Language Theory, 60-71, 2007
Fidelity of quantum strategies with applications to cryptography
G Gutoski, A Rosmanis, J Sikora
Quantum 2, 89, 2018
Fidelity of quantum strategies with applications to cryptography
G Gutoski, A Rosmanis, J Sikora
Quantum 2, 89, 2018
Adversary lower bounds for the collision and the set equality problems.
A Belovs, A Rosmanis
Quantum Information & Computation 18 (3&4), 200-224, 2018
Quantum advantage for the LOCAL model in distributed computing
F Le Gall, H Nishimura, A Rosmanis
36th International Symposium on Theoretical Aspects of Computer Science …, 2019
Quantum adversary lower bound for element distinctness with small range
A Rosmanis
Chicago Journal of Theoretical Computer Science 4, 2014, 2014
Quantum Coupon Collector
S Arunachalam, A Belovs, AM Childs, R Kothari, A Rosmanis, R de Wolf
arXiv preprint arXiv:2002.07688, 2020
A Tight Lower Bound For Non-Coherent Index Erasure
N Lindzey, A Rosmanis
11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 2020
Quantum and Classical Algorithms for Approximate Submodular Function Minimization
Y Hamoudi, P Rebentrost, A Rosmanis, M Santha
arXiv preprint arXiv:1907.05378, 2019
Fixed space of positive trace-preserving super-operators
A Rosmanis
Linear Algebra and Its Applications 437 (7), 1704-1721, 2012
Tight Quantum Lower Bound for Approximate Counting with Quantum States
A Belovs, A Rosmanis
arXiv preprint arXiv:2002.06879, 2020
Quantum snake walk on graphs
A Rosmanis
Physical Review A 83 (2), 022304, 2011
Tight Bounds for Inverting Permutations via Compressed Oracle Arguments
A Rosmanis
arXiv preprint arXiv:2103.08975, 2021
Lower Bounds on Quantum Query and Learning Graph Complexities
A Rosmanis
University of Waterloo, 2014
Principles of Optimal Probabilistic Decision Tree Construction
M Ozols, L Mancinska, I Dzelme-Berzina, R Agadzanjans, A Rosmanis
International Conference on Foundations of Computer Science. Las Vegas …, 2006
Quantum lower bounds for tripartite versions of the hidden shift and the set equality problems
A Belovs, A Rosmanis
LIPIcs-Leibniz International Proceedings in Informatics 111, 2018
Adversary Bound for Inverting Permutations via Representation Theory
FL Gall, A Rosmanis
IEICE Technical Report; IEICE Tech. Rep., 0
The system can't perform the operation now. Try again later.
Articles 1–19