Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Yuval R Sanders"'
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:
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
Autor:
Mária Kieferová, Yuval R. Sanders
Publikováno v:
Harvard Data Science Review (2022)
Externí odkaz:
https://doaj.org/article/8bcc2ebb04114605bd46a5af144be4cc
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:
PRX Quantum. 3
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
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
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
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 cont
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
Autor:
Mária Kieferová, Craig Gidney, Nathan Wiebe, Artur Scherer, Guang Hao Low, Yuval R. Sanders, Dominic W. Berry, Ryan Babbush
Publikováno v:
npj Quantum Information, Vol 4, Iss 1, Pp 1-7 (2018)
Modeling low energy eigenstates of fermionic systems can provide insight into chemical reactions and material properties and is one of the most anticipated applications of quantum computing. We present three techniques for reducing the cost of prepar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e1bd70cf0b99d8851eb4e0cd654c43a5
https://hdl.handle.net/10453/161201
https://hdl.handle.net/10453/161201