Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Minko, Romy"'
Autor:
Sun, Zhu, Boyd, Gregory, Cai, Zhenyu, Jnane, Hamza, Koczor, Balint, Meister, Richard, Minko, Romy, Pring, Benjamin, Benjamin, Simon C., Stamatopoulos, Nikitas
We explore the important task of applying a phase $exp(i f(x))$ to a computational basis state $\left| x \right>$. The closely related task of rotating a target qubit by an angle depending on $f(x)$ is also studied. Such operations are key in many qu
Externí odkaz:
http://arxiv.org/abs/2409.04587
Autor:
Mann, Ryan L., Minko, Romy M.
Publikováno v:
PRX Quantum 5, 010305 (2024)
We establish a general framework for developing approximation algorithms for a class of counting problems. Our framework is based on the cluster expansion of abstract polymer models formalism of Koteck\'y and Preiss. We apply our framework to obtain
Externí odkaz:
http://arxiv.org/abs/2306.08974
Publikováno v:
Quantum 7, 1208 (2023)
We give a novel procedure for approximating general single-qubit unitaries from a finite universal gate set by reducing the problem to a novel magnitude approximation problem, achieving an immediate improvement in sequence length by a factor of 7/9.
Externí odkaz:
http://arxiv.org/abs/2203.10064
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
We give a novel procedure for approximating general single-qubit unitaries from a finite universal gate set by reducing the problem to a novel magnitude approximation problem, achieving an immediate improvement in sequence length by a factor of 7/9.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d444f81e155493e80215e9ca720bd9b4
Publikováno v:
Lecture notes in computer science, 12006 LNCS
The security proofs for isogeny-based undeniable signature schemes have been based primarily on the assumptions that the One-Sided Modified SSCDH problem and the One-More SSCDH problem are intractable. We challenge the validity of these assumptions,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2101::da22da222cadf09499e38ff7a98044f5
http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/321901
http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/321901