Ansis Rosmanis

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