Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Yuval R Sanders"'
Autor:
Mária Kieferová, Yuval R. Sanders
Publikováno v:
Harvard Data Science Review (2022)
Externí odkaz:
https://doaj.org/article/8bcc2ebb04114605bd46a5af144be4cc
Publikováno v:
PRX Quantum, Vol 3, Iss 4, p 040303 (2022)
Recently, several approaches to solving linear systems on a quantum computer have been formulated in terms of the quantum adiabatic theorem for a continuously varying Hamiltonian. Such approaches have enabled near-linear scaling in the condition numb
Externí odkaz:
https://doaj.org/article/aac63c52c5f14bf1a12845844b52bcd7
Publikováno v:
PRX Quantum, Vol 3, Iss 2, p 020364 (2022)
We devise a quasilinear quantum algorithm for generating an approximation for the ground state of a quantum field theory (QFT). Our quantum algorithm delivers a superquadratic speedup over the state-of-the-art quantum algorithm for ground-state gener
Externí odkaz:
https://doaj.org/article/fb1ef656796f4bd9a503fc1cad787591
Publikováno v:
New Journal of Physics, Vol 23, Iss 8, p 083025 (2021)
Discord, originally notable as a signature of bipartite quantum correlation, in fact can be nonzero classically, i.e. arising from noisy measurements by one of the two parties. Here we redefine classical discord to quantify channel distortion, in con
Externí odkaz:
https://doaj.org/article/e570c92faa244d439a40a4d82bd32a55
Autor:
Yuval R. Sanders, Dominic W. Berry, Pedro C.S. Costa, Louis W. Tessler, Nathan Wiebe, Craig Gidney, Hartmut Neven, Ryan Babbush
Publikováno v:
PRX Quantum, Vol 1, Iss 2, p 020312 (2020)
Here we explore which heuristic quantum algorithms for combinatorial optimization might be most practical to try out on a small fault-tolerant quantum computer. We compile circuits for several variants of quantum-accelerated simulated annealing inclu
Externí odkaz:
https://doaj.org/article/51214959c55e4c839b2aba970f0da8f8
Publikováno v:
New Journal of Physics, Vol 22, Iss 6, p 063014 (2020)
We introduce unitary-gate randomized benchmarking (URB) for qudit gates by extending single- and multi-qubit URB to single- and multi-qudit gates. Specifically, we develop a qudit URB procedure that exploits unitary 2-designs. Furthermore, we show th
Externí odkaz:
https://doaj.org/article/fe82a05860e5464cb08827f58401463c
Publikováno v:
PRX Quantum. 2
Today's quantum computers are comprised of tens of qubits interacting with each other and the environment in increasingly complex networks. In order to achieve the best possible performance when operating such systems, it is necessary to have accurat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fcd841288dea33c1c7143cd56451f2db
https://doi.org/10.1103/prxquantum.2.040343
https://doi.org/10.1103/prxquantum.2.040343
Autor:
Pedro C. S. Costa, Dominic W. Berry, Ryan Babbush, Louis Tessler, Yuval R. Sanders, Nathan Wiebe, Craig Gidney, Hartmut Neven
Here we explore which heuristic quantum algorithms for combinatorial optimization might be most practical to try out on a small fault-tolerant quantum computer. We compile circuits for several variants of quantum accelerated simulated annealing inclu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::60906f3654a83a3d89fd0a70ea11081d
Publikováno v:
New Journal of Physics, Vol 18, Iss 1, p 012002 (2015)
Remarkable experimental advances in quantum computing are exemplified by recent announcements of impressive average gate fidelities exceeding 99.9% for single-qubit gates and 99% for two-qubit gates. Although these high numbers engender optimism that
Externí odkaz:
https://doaj.org/article/7043468e3f104fba997306eb8ffe41af
Black-box quantum state preparation is an important subroutine in many quantum algorithms. The standard approach requires the quantum computer to do arithmetic, which is a key contributor to the complexity. Here we present a new algorithm that avoids
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d187139552bff72faf0f01e223bf6456
https://hdl.handle.net/10453/162333
https://hdl.handle.net/10453/162333