Ansis Rosmanis

Publication Activity (10 Years)

Years Active: 2006-2022
Publications (10 Years): 14

Top Topics

Adaptive Learning

Sufficiently Accurate

Quantum Computing

Top Venues

Quantum Inf. Comput.

Chic. J. Theor. Comput. Sci.

Publications

Nathan Lindzey, Ansis Rosmanis
A tight lower bound for non-coherent index erasure. Quantum Inf. Comput. 22 (7&8) (2022)
François Le Gall, Ansis Rosmanis
Non-trivial lower bound for 3-coloring the ring in the quantum LOCAL model. CoRR (2022)
Ansis Rosmanis
Tight Bounds for Inverting Permutations via Compressed Oracle Arguments. CoRR (2021)
Srinivasan Arunachalam, Aleksandrs Belovs, Andrew M. Childs, Robin Kothari, Ansis Rosmanis, Ronald de Wolf
Quantum Coupon Collector. CoRR (2020)
Srinivasan Arunachalam, Aleksandrs Belovs, Andrew M. Childs, Robin Kothari, Ansis Rosmanis, Ronald de Wolf
Quantum Coupon Collector. TQC (2020)
Nathan Lindzey, Ansis Rosmanis
A Tight Lower Bound For Non-Coherent Index Erasure. ITCS (2020)
François Le Gall, Harumichi Nishimura, Ansis Rosmanis
Quantum Advantage for the LOCAL Model in Distributed Computing. STACS (2019)
Yassine Hamoudi, Patrick Rebentrost, Ansis Rosmanis, Miklos Santha
Quantum and classical algorithms for approximate submodular function minimization. Quantum Inf. Comput. 19 (15&16) (2019)
Yassine Hamoudi, Patrick Rebentrost, Ansis Rosmanis, Miklos Santha
Quantum and Classical Algorithms for Approximate Submodular Function Minimization. CoRR (2019)
Nathan Lindzey, Ansis Rosmanis
A Tight Lower Bound for Index Erasure. CoRR (2019)
François Le Gall, Harumichi Nishimura, Ansis Rosmanis
Quantum Advantage for the LOCAL Model in Distributed Computing. CoRR (2018)
Aleksandrs Belovs, Ansis Rosmanis
Quantum Lower Bounds for Tripartite Versions of the Hidden Shift and the Set Equality Problems. TQC (2018)
Aleksandrs Belovs, Ansis Rosmanis
Adversary lower bounds for the collision and the set equality problems. Quantum Inf. Comput. 18 (3&4) (2018)
Gus Gutoski, Ansis Rosmanis, Jamie Sikora
Fidelity of Quantum Strategies with Applications to Cryptography. TQC (2017)
Ansis Rosmanis
Quantum Adversary Lower Bound for Element Distinctness with Small Range. Chic. J. Theor. Comput. Sci. 2014 (2014)
Andris Ambainis, Ansis Rosmanis, Dominique Unruh
Quantum Attacks on Classical Proof Systems: The Hardness of Quantum Rewinding. FOCS (2014)
Andris Ambainis, Ansis Rosmanis, Dominique Unruh
Quantum Attacks on Classical Proof Systems - The Hardness of Quantum Rewinding. IACR Cryptol. ePrint Arch. 2014 (2014)
Aleksandrs Belovs, Ansis Rosmanis
On the Power of Non-adaptive Learning Graphs. Comput. Complex. 23 (2) (2014)
Andris Ambainis, Ansis Rosmanis, Dominique Unruh
Quantum Attacks on Classical Proof Systems - The Hardness of Quantum Rewinding. CoRR (2014)
Aleksandrs Belovs, Ansis Rosmanis
On the Power of Non-adaptive Learning Graphs. Computational Complexity Conference (2013)
Aleksandrs Belovs, Ansis Rosmanis, Juris Smotrovs
Multi-letter Reversible and Quantum Finite Automata. Developments in Language Theory (2007)
Ansis Rosmanis, Ilze Dzelme-Berzina
Mixed States in Quantum Cryptography. FCS (2006)
Laura Mancinska, Maris Ozols, Ilze Dzelme-Berzina, Rubens Agadzanjans, Ansis Rosmanis
Principles of Optimal Probabilistic Decision Tree Construction. FCS (2006)