Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Patrick Rall"'
Autor:
Willers Yang, Patrick Rall
Publikováno v:
IEEE Transactions on Quantum Engineering, Vol 5, Pp 1-10 (2024)
In superconducting architectures, limited connectivity remains a significant challenge for the synthesis and compilation of quantum circuits. We consider models of entanglement-assisted computation where long-range operations are achieved through inj
Externí odkaz:
https://doaj.org/article/06721945587f4f48b0d960c6fc28d9de
Autor:
Elisa Bäumer, Vinay Tripathi, Derek S. Wang, Patrick Rall, Edward H. Chen, Swarnadeep Majumder, Alireza Seif, Zlatko K. Minev
Publikováno v:
PRX Quantum, Vol 5, Iss 3, p 030339 (2024)
Quantum simulation traditionally relies on unitary dynamics, inherently imposing efficiency constraints on the generation of intricate entangled states. In principle, these limitations can be superseded by nonunitary, dynamic circuits. These circuits
Externí odkaz:
https://doaj.org/article/2f23070c97534d84954bae31cbe98daa
Publikováno v:
Journal of High Energy Physics, Vol 2022, Iss 6, Pp 1-57 (2022)
Abstract We introduce a fully constructive characterisation of holographic quantum error-correcting codes. That is, given a code and an erasure error we give a recipe to explicitly compute the terms in the RT formula. Using this formalism, we employ
Externí odkaz:
https://doaj.org/article/b830cdb5dd3744f39eda12c6bde8ada9
Publikováno v:
Quantum, Vol 7, p 1132 (2023)
A promising avenue for the preparation of Gibbs states on a quantum computer is to simulate the physical thermalization process. The Davies generator describes the dynamics of an open quantum system that is in contact with a heat bath. Crucially, it
Externí odkaz:
https://doaj.org/article/8684662a4b644eeaa835bdfafcc55161
Autor:
Patrick Rall, Bryce Fuller
Publikováno v:
Quantum, Vol 7, p 937 (2023)
Amplitude estimation algorithms are based on Grover's algorithm: alternating reflections about the input state and the desired outcome. But what if we are given the ability to perform arbitrary rotations, instead of just reflections? In this situatio
Externí odkaz:
https://doaj.org/article/e2cb933b26fd4fd19b8fa2a181325992
Autor:
Patrick Rall
Publikováno v:
Quantum, Vol 5, p 566 (2021)
We consider performing phase estimation under the following conditions: we are given only one copy of the input state, the input state does not have to be an eigenstate of the unitary, and the state must not be measured. Most quantum estimation algor
Externí odkaz:
https://doaj.org/article/f41f280c6f614bb3b81dbd5f65687c3b
Publikováno v:
Journal of High Energy Physics
We introduce a fully constructive characterisation of holographic quantum error-correcting codes. That is, given a code and an erasure error we give a recipe to explicitly compute the terms in the RT formula. Using this formalism, we employ quantum c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::72ec76dc08bb2d96c4b1c23471b94c97
http://arxiv.org/abs/2110.14691
http://arxiv.org/abs/2110.14691
Autor:
Patrick Rall
We present quantum algorithms for the estimation of n-time correlation functions, the local and non-local density of states, and dynamical linear response functions. These algorithms are all based on block-encodings - a versatile technique for the ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::428fd0ef35c729ed6bff30ae795f916d
http://arxiv.org/abs/2004.06832
http://arxiv.org/abs/2004.06832
Autor:
Patrick Rall, Scott Aaronson
In 1998, Brassard, Hoyer, Mosca, and Tapp (BHMT) gave a quantum algorithm for approximate counting. Given a list of $N$ items, $K$ of them marked, their algorithm estimates $K$ to within relative error $\varepsilon$ by making only $O\left( \frac{1}{\
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::79f61b8411b7e20eb6ee154b29fa5871
https://doi.org/10.1137/1.9781611976014.5
https://doi.org/10.1137/1.9781611976014.5
Autor:
Logan Hillberry, Nicole Yunger Halpern, Ning Bao, Simone Montangero, Matthew T. Jones, Lincoln D. Carr, Patrick Rall, Simone Notarnicola, David L. Vargas
Publikováno v:
Quantum Science and Technology
Cellular automata are interacting classical bits that display diverse emergent behaviors, from fractals to random-number generators to Turing-complete computation. We discover that quantum cellular automata (QCA) can exhibit complexity in the sense o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a9895850e02c8cef15b3917743dd37c5
https://doi.org/10.1088/2058-9565/ac1c41
https://doi.org/10.1088/2058-9565/ac1c41