Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Cedric Yen-Yu Lin"'
Autor:
Alexander M. Dalzell, B. David Clader, Grant Salton, Mario Berta, Cedric Yen-Yu Lin, David A. Bader, Nikitas Stamatopoulos, Martin J. A. Schuetz, Fernando G. S. L. Brandão, Helmut G. Katzgraber, William J. Zeng
Publikováno v:
PRX Quantum, Vol 4, Iss 4, p 040325 (2023)
We study quantum interior-point methods (QIPMs) for second-order cone programming (SOCP), guided by the example use case of portfolio optimization (PO). We provide a complete quantum circuit-level description of the algorithm from problem input to pr
Externí odkaz:
https://doaj.org/article/4829c40142644d01bdd4f645f19bacde
Publikováno v:
Quantum, Vol 6, p 677 (2022)
Variational quantum algorithms are ubiquitous in applications of noisy intermediate-scale quantum computers. Due to the structure of conventional parametrized quantum gates, the evaluated functions typically are finite Fourier series of the input par
Externí odkaz:
https://doaj.org/article/0d3f3e1b5fbb4900a19f8d71d3af83e2
Publikováno v:
npj Quantum Information, Vol 3, Iss 1, Pp 1-7 (2017)
Quantum Software from Quantum States One of the hallmarks of quantum computation is the storage and extraction of information within quantum systems. Recently, Lloyd, Mohseni and Rebentrost created a protocol to treat multiple identical copies of a q
Externí odkaz:
https://doaj.org/article/991483e91eb14e1bb598a6138ba66485
Publikováno v:
Scopus-Elsevier
Web of Science
Web of Science
$\textit{Normalizer circuits}$ [1,2] are generalized Clifford circuits that act on arbitrary finite-dimensional systems $\mathcal{H}_{d_1}\otimes ... \otimes \mathcal{H}_{d_n}$ with a standard basis labeled by the elements of a finite Abelian group $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1ded7bc53356f9913bb4c7c4f10d7c70
https://doi.org/10.26421/qic16.5-6-1
https://doi.org/10.26421/qic16.5-6-1
Autor:
Cedric Yen-Yu Lin, Han-Hsuan Lin
Publikováno v:
Theory of Computing. 12:1-35
Inspired by the Elitzur-Vaidman bomb testing problem [arXiv:hep-th/9305002], we introduce a new query complexity model, which we call bomb query complexity $B(f)$. We investigate its relationship with the usual quantum query complexity $Q(f)$, and sh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d2565a5955d4c3e214c2603614ccfb35
https://doi.org/10.4086/toc.2016.v012a018
https://doi.org/10.4086/toc.2016.v012a018
Publikováno v:
Harrow, A W, Lin, C Y Y & Montanaro, A 2017, Sequential measurements, disturbance and property testing . in 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017 . Society for Industrial and Applied Mathematics, pp. 1598-1611, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, 16/01/17 . https://doi.org/10.1137/1.9781611974782.105
We describe two procedures which, given access to one copy of a quantum state and a sequence of two-outcome measurements, can distinguish between the case that at least one of the measurements accepts the state with high probability, and the case tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7afe19d9576094e02c01a58b882fb57b
http://arxiv.org/abs/1607.03236
http://arxiv.org/abs/1607.03236
Publikováno v:
npj Quantum Information, Vol 3, Iss 1, Pp 1-7 (2017)
We investigate the sample complexity of Hamiltonian simulation: how many copies of an unknown quantum state are required to simulate a Hamiltonian encoded by the density matrix of that state? We show that the procedure proposed by Lloyd, Mohseni, and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fd7fa469f895889899f83a9c0ec89e08