activity
20172025
most citedA randomized quantum algorithm for statistical phase estimation

92 citations · 330 across the 13 of their papers we have counts for

collaborators

13 papers

quant-ph2025

Quantum simulation of electronic structure via quantum fast multipole method

Dominic W. Berry, Kianna Wan, Andrew D. Baczewski +3

Here we describe an approach for simulating electronic structure on quantum computers with significantly lower asymptotic complexity than prior work. The approach uses a real-space…

quant-ph2024★ 6 cited

Exponential learning advantages with conjugate states and minimal quantum memory

Robbie King, Kianna Wan, Jarrod McClean

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 othe…

quant-ph2022★ 83 cited

Matchgate Shadows for Fermionic Quantum Simulation

Kianna Wan, William J. Huggins, Joonho Lee +1

"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]. He…

quant-ph2021★ 47 cited

Nearly Optimal Quantum Algorithm for Estimating Multiple Expectation Values

William J. Huggins, Kianna Wan, Jarrod McClean +3

Many quantum algorithms involve the evaluation of expectation values. Optimal strategies for estimating a single expectation value are known, requiring a number of state preparatio…

quant-ph2021★ 92 cited

A randomized quantum algorithm for statistical phase estimation

Kianna Wan, Mario Berta, Earl T. Campbell

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 distincti…

quant-ph2021★ 15 cited

New bounds on adaptive quantum metrology under Markovian noise

Kianna Wan, Robert Lasenby

We analyse the problem of estimating a scalar parameter that controls the Hamiltonian of a quantum system subject to Markovian noise. Specifically, we place bounds on the growt…

quant-ph2020★ 32 cited

Fault-tolerant qubit from a constant number of components

Kianna Wan, Soonwon Choi, Isaac H. Kim +2

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 i…

quant-ph2020★ 1 cited

Distributing bipartite quantum systems under timing constraints

Kfir Dolev, Alex May, Kianna Wan

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…

quant-ph2020★ 14 cited

Exponentially faster implementations of Select(H) for fermionic Hamiltonians

Kianna Wan

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\el…

quant-ph2020★ 9 cited

Fast digital methods for adiabatic state preparation

Kianna Wan, Isaac H. Kim

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 simul…

quant-ph2018★ 4 cited

Quantum adiabatic optimization without heuristics

Michael Jarret, Brad Lackey, Aike Liu +1

Quantum adiabatic optimization (QAO) is performed using a time-dependent Hamiltonian with spectral gap . Assuming the existence of an oracle such that $γ_\min = Θ\…

quant-ph2017★ 10 cited

Improved quantum backtracking algorithms using effective resistance estimates

Michael Jarret, Kianna Wan

We investigate quantum backtracking algorithms of a type previously introduced by Montanaro (arXiv:1509.02374). These algorithms explore trees of unknown structure, and in certain…

cond-mat.str-el2017★ 17 cited

Exact diagonalization of Heisenberg and AKLT chains using the full symmetry

Kianna Wan, Pierre Nataf, Frédéric Mila

We present a method for the exact diagonalization of the Heisenberg interaction Hamiltonian, using Young tableaux to work directly in each irreducible representati…