Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Wan, Kianna"'
The ability of quantum computers to directly manipulate and analyze quantum states stored in quantum memory allows them to learn about aspects of our physical world that would otherwise be invisible given a modest number of measurements. Here we inve
Externí odkaz:
http://arxiv.org/abs/2403.03469
"Classical shadows" are estimators of an unknown quantum state, constructed from suitably distributed random measurements on copies of that state [Nature Physics 16, 1050-1057]. Here, we analyze classical shadows obtained using random matchgate circu
Externí odkaz:
http://arxiv.org/abs/2207.13723
Autor:
Huggins, William J., Wan, Kianna, McClean, Jarrod, O'Brien, Thomas E., Wiebe, Nathan, Babbush, Ryan
Many quantum algorithms involve the evaluation of expectation values. Optimal strategies for estimating a single expectation value are known, requiring a number of state preparations that scales with the target error $\varepsilon$ as $\mathcal{O}(1/\
Externí odkaz:
http://arxiv.org/abs/2111.09283
Publikováno v:
Phys. Rev. Lett. 129, 030503 (2022)
Phase estimation is a quantum algorithm for measuring the eigenvalues of a Hamiltonian. We propose and rigorously analyse a randomized phase estimation algorithm with two distinctive features. First, our algorithm has complexity independent of the nu
Externí odkaz:
http://arxiv.org/abs/2110.12071
Autor:
Wan, Kianna, Lasenby, Robert
Publikováno v:
Phys. Rev. Research 4, 033092 (2022)
We analyse the problem of estimating a scalar parameter $g$ that controls the Hamiltonian of a quantum system subject to Markovian noise. Specifically, we place bounds on the growth rate of the quantum Fisher information with respect to $g$, in terms
Externí odkaz:
http://arxiv.org/abs/2108.11390
Publikováno v:
PRX Quantum 2, 040345 (2021)
With gate error rates in multiple technologies now below the threshold required for fault-tolerant quantum computation, the major remaining obstacle to useful quantum computation is scaling, a challenge greatly amplified by the huge overhead imposed
Externí odkaz:
http://arxiv.org/abs/2011.08213
Publikováno v:
J. Phys. A: Math. Theor. 54 145301 (2021)
In many quantum information processing protocols, entangled states shared among parties are an important resource. In this article, we study how bipartite states may be distributed in the context of a quantum network limited by timing constraints. We
Externí odkaz:
http://arxiv.org/abs/2011.00936
Autor:
Wan, Kianna
Publikováno v:
Quantum 5, 380 (2021)
We present a simple but general framework for constructing quantum circuits that implement the multiply-controlled unitary $\text{Select}(H) \equiv \sum_\ell |\ell\rangle\langle\ell|\otimes H_\ell$, where $H = \sum_\ell H_\ell$ is the Jordan-Wigner t
Externí odkaz:
http://arxiv.org/abs/2004.04170
Autor:
Wan, Kianna, Kim, Isaac H.
We present a quantum algorithm for adiabatic state preparation on a gate-based quantum computer, with complexity polylogarithmic in the inverse error. Our algorithm digitally simulates the adiabatic evolution between two self-adjoint operators $H_0$
Externí odkaz:
http://arxiv.org/abs/2004.04164
Autor:
Wan, Kianna1,2 (AUTHOR) kianna.wan@gmail.com, Huggins, William J.1 (AUTHOR), Lee, Joonho1,3,4 (AUTHOR), Babbush, Ryan1 (AUTHOR)
Publikováno v:
Communications in Mathematical Physics. Dec2023, Vol. 404 Issue 2, p629-700. 72p.
