Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Rosmanis, Ansis
31  Ergebnisse:
Personensuche X
?
1

Hybrid Quantum-Classical Search Algorithms:

Rosmanis, Ansis
ACM Transactions on Quantum Computing.  , 2024
Link: https://doi.org/10.1145/..
 
?
2

A power-efficient self-calibrating smart lighting system:

Aussat, Yerbol ; Rosmanis, Ansis ; Keshav, Srinivasan
Energy and Buildings.  259 (2022)  - p. 111874 , 2022
Link: https://doi.org/10.1016/..
 
?
3

Fidelity of quantum strategies with applications to cryptog..:

Gutoski, Gus ; Rosmanis, Ansis ; Sikora, Jamie
Quantum.  2 (2018)  - p. 89 , 2018
Link: https://doi.org/10.22331..
 
?
4

On the Power of Non-adaptive Learning Graphs:

Belovs, Aleksandrs ; Rosmanis, Ansis
computational complexity.  23 (2014)  2 - p. 323-354 , 2014
Link: https://doi.org/10.1007/..
 
?
5

Fixed space of positive trace-preserving super-operators:

Rosmanis, Ansis
Linear Algebra and its Applications.  437 (2012)  7 - p. 1704-1721 , 2012
Link: https://doi.org/10.1016/..
 
?
6

Quantum snake walk on graphs:

Rosmanis, Ansis
Physical Review A.  83 (2011)  2 - p. , 2011
Link: https://doi.org/10.1103/..
 
?
7

Quantum Search with Noisy Oracle:

Rosmanis, Ansis
http://arxiv.org/abs/2309.14944.  , 2023
Link: http://arxiv.org/abs/230..
 
?
8

Hybrid Quantum-Classical Search Algorithms:

Rosmanis, Ansis
http://arxiv.org/abs/2202.11443.  , 2022
Link: http://arxiv.org/abs/220..
 
?
9

Non-trivial lower bound for 3-coloring the ring in the quan..:

Gall, François Le ; Rosmanis, Ansis
http://arxiv.org/abs/2212.02768.  , 2022
Link: http://arxiv.org/abs/221..
 
?
10

Tight Bounds for Inverting Permutations via Compressed Orac..:

Rosmanis, Ansis
http://arxiv.org/abs/2103.08975.  , 2021
Link: http://arxiv.org/abs/210..
 
?
11

A Tight Lower Bound For Non-Coherent Index Erasure:

Lindzey, Nathan ; Rosmanis, Ansis
doi:10.4230/LIPIcs.ITCS.2020.59.  , 2020
Link: https://doi.org/10.4230/..
 
?
12

Quantum Coupon Collector:

Arunachalam, Srinivasan ; Belovs, Aleksandrs ; Childs, Andrew M...
doi:10.4230/LIPIcs.TQC.2020.10.  , 2020
Link: https://doi.org/10.4230/..
 
?
13

Tight Quantum Lower Bound for Approximate Counting with Qua..:

Belovs, Aleksandrs ; Rosmanis, Ansis
http://arxiv.org/abs/2002.06879.  , 2020
Link: http://arxiv.org/abs/200..
 
?
14

Quantum Coupon Collector:

Arunachalam, Srinivasan ; Belovs, Aleksandrs ; Childs, Andrew M...
http://arxiv.org/abs/2002.07688.  , 2020
Link: http://arxiv.org/abs/200..
 
?
15

A Tight Lower Bound for Non-coherent Index Erasure:

Lindzey, Nathan ; Rosmanis, Ansis
http://arxiv.org/abs/1902.07336.  , 2019
Link: http://arxiv.org/abs/190..
 
1-15