2 citations · 2 across the 3 of their papers we have counts for
14 papers
Strategic Plan for Neutral Atom Quantum Computation
Adrian J. Menssen, Tout Wang, Michael Gullans +54
We present a strategic plan for neutral atom quantum computation, bringing together hardware development and theory advancements to achieve the goal of practical quantum advantage.…
Optimal Lower Bounds for Hamiltonian Simulation
Alexander Zlokapa, Richard R. Allen, Aram W. Harrow
For Hamiltonian , we prove asymptotically tight lower bounds on the gate and query complexities of simulating time evolution on a quantum computer. Our bounds hold…
Phase estimation with partially randomized time evolution
Jakob Günther, Freek Witteveen, Alexander Schmidhuber +3
Quantum phase estimation combined with Hamiltonian simulation is the most promising algorithmic framework to computing ground state energies on quantum computers. Its main computat…
Quantum Purity Amplification for Arbitrary Eigenstates and Multiple Outputs
Zhaoyi Li, Elias Theil, Aram W. Harrow +1
Quantum purity amplification (QPA) is the task of coherently transforming copies of a mixed state into high-fidelity copies of a chosen eigenstate. We solve QPA in the general…
An Exponential Sample-Complexity Advantage for Coherent Quantum Inference
Zhaoyi Li, Elias Theil, Aram W. Harrow +1
Standard quantum inference converts quantum data into classical outputs. We study an alternative inference setting in which the desired output is quantum, preserving coherence. Suc…
Plethysm is in #BQP
Matthias Christandl, Aram W. Harrow, Greta Panova +2
Some representation-theoretic multiplicities, such as the Kostka and the Littlewood-Richardson coefficients, admit a combinatorial interpretation that places their computation in t…