Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Ansis Rosmanis"'
Publikováno v:
Quantum, Vol 2, p 89 (2018)
We introduce a definition of the fidelity function for multi-round quantum strategies, which we call the $\textit{strategy fidelity}$, that is a generalization of the fidelity function for quantum states. We provide many properties of the strategy fi
Externí odkaz:
https://doaj.org/article/2533bc20409e4096a4b496ed322a5c18
Publikováno v:
Quantum Information and Computation. 19:1325-1349
Submodular functions are set functions mapping every subset of some ground set of size $n$ into the real numbers and satisfying the diminishing returns property. Submodular minimization is an important field in discrete optimization theory due to its
Publikováno v:
Energy and Buildings. 259:111874
Autor:
Nathan Lindzey, Ansis Rosmanis
The Index-Erasure problem is a quantum state generation problem that asks a quantum computer to prepare a uniform superposition over the image of an injective function given by an oracle. We prove a tight $\Omega(\sqrt{n})$ lower bound on the quantum
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7b91fd765a766eeb08d985d332858bc5
Publikováno v:
FOCS
Quantum zero-knowledge proofs and quantum proofs of knowledge are inherently difficult to analyze because their security analysis uses rewinding. Certain cases of quantum rewinding are handled by the results by Watrous (SIAM J Comput, 2009) and Unruh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5c681835e89948ae9471ae256509fcbc
Autor:
Aleksandrs Belovs, Ansis Rosmanis
Publikováno v:
IEEE Conference on Computational Complexity
We introduce a notion of the quantum query complexity of a certificate structure. This is a formalisation of a well-known observation that many quantum query algorithms only require the knowledge of the disposition of possible certificates in the inp
Autor:
Ansis Rosmanis, Aleksandrs Belovs
We prove tight $\Omega(n^{1/3})$ lower bounds on the quantum query complexity of the Collision and the Set Equality problems, provided that the size of the alphabet is large enough. We do this using the negative-weight adversary method. Thus, we repr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dd9a5576fa1cdf62b602dcdfee0b7e7d
Autor:
Ansis Rosmanis
We examine the fixed space of positive trace-preserving super-operators. We describe a specific structure that this space must have and what the projection onto it must look like. We show how these results, in turn, lead to an alternative proof of th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::835faac39fbd43290980b093ddf4a9dd
http://arxiv.org/abs/1106.3380
http://arxiv.org/abs/1106.3380
Autor:
Ansis Rosmanis
I introduce a new type of continuous-time quantum walk on graphs called the quantum snake walk, the basis states of which are fixed-length paths (snakes) in the underlying graph. First I analyze the quantum snake walk on the line, and I show that, ev
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::73377056957038f6f30adfdb4037833c
Publikováno v:
Scopus-Elsevier
Developments in Language Theory ISBN: 9783540732075
Developments in Language Theory
Developments in Language Theory ISBN: 9783540732075
Developments in Language Theory
The regular language (a+b)*a (the words in alphabet {a, b} having a as the last letter) is at the moment a classical example of a language not recognizable by a one-way quantum finite automaton (QFA). Up to now, there have been introduced many differ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ef328ffc0156605ff63f83c9c8ff4a98
http://www.scopus.com/inward/record.url?eid=2-s2.0-34548098712&partnerID=MN8TOARS
http://www.scopus.com/inward/record.url?eid=2-s2.0-34548098712&partnerID=MN8TOARS