Theo dõi
Ansis Rosmanis
Ansis Rosmanis
Designated Assistant Professor, Graduate School of Mathematics, Nagoya University
Email được xác minh tại math.nagoya-u.ac.jp
Tiêu đề
Trích dẫn bởi
Trích dẫn bởi
Năm
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
2002014
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
422019
On the power of non-adaptive learning graphs
A Belovs, A Rosmanis
computational complexity 23 (2), 323-354, 2014
322014
A power-efficient self-calibrating smart lighting system
Y Aussat, A Rosmanis, S Keshav
Energy and Buildings 259, 111874, 2022
312022
Multi-letter reversible and quantum finite automata
A Belovs, A Rosmanis, J Smotrovs
International Conference on Developments in Language Theory, 60-71, 2007
302007
Fidelity of quantum strategies with applications to cryptography
G Gutoski, A Rosmanis, J Sikora
Quantum 2, 89, 2018
262018
Fidelity of quantum strategies with applications to cryptography
G Gutoski, A Rosmanis, J Sikora
Quantum 2, 89, 2018
262018
Quantum Coupon Collector
S Arunachalam, A Belovs, AM Childs, R Kothari, A Rosmanis, R de Wolf
arXiv preprint arXiv:2002.07688, 2020
202020
Hybrid quantum-classical search algorithms
A Rosmanis
ACM Transactions on Quantum Computing 5 (2), 1-18, 2024
192024
Quantum and Classical Algorithms for Approximate Submodular Function Minimization
Y Hamoudi, P Rebentrost, A Rosmanis, M Santha
arXiv preprint arXiv:1907.05378, 2019
152019
Adversary lower bounds for the collision and the set equality problems.
A Belovs, A Rosmanis
Quantum Information & Computation 18 (3&4), 200-224, 2018
13*2018
Tight Bounds for Inverting Permutations via Compressed Oracle Arguments
A Rosmanis
arXiv preprint arXiv:2103.08975, 2021
112021
Quantum adversary lower bound for element distinctness with small range
A Rosmanis
Chicago Journal of Theoretical Computer Science 4, 2014, 2014
10*2014
Tight Quantum Lower Bound for Approximate Counting with Quantum States
A Belovs, A Rosmanis
arXiv preprint arXiv:2002.06879, 2020
82020
Quantum snake walk on graphs
A Rosmanis
Physical Review A 83 (2), 022304, 2011
82011
A Tight Lower Bound For Non-Coherent Index Erasure
N Lindzey, A Rosmanis
11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 2020
72020
Quantum Search with Noisy Oracle
A Rosmanis
arXiv preprint arXiv:2309.14944, 2023
52023
Fixed space of positive trace-preserving super-operators
A Rosmanis
Linear Algebra and Its Applications 437 (7), 1704-1721, 2012
52012
Non-trivial lower bound for 3-coloring the ring in the quantum LOCAL model
FL Gall, A Rosmanis
arXiv preprint arXiv:2212.02768, 2022
32022
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
22006
Hệ thống không thể thực hiện thao tác ngay bây giờ. Hãy thử lại sau.
Bài viết 1–20