3.4k citations · 12.4k across the 106 of their papers we have counts for
6 papers · 2 filters
Rapid mixing of path integral Monte Carlo for 1D stoquastic Hamiltonians
Elizabeth Crosson, Aram W. Harrow
Path integral quantum Monte Carlo (PIMC) is a method for estimating thermal equilibrium properties of stoquastic quantum spin systems by sampling from a classical Gibbs distributio…
Quantum Computational Supremacy
Aram W Harrow, Ashley Montanaro
The field of quantum algorithms aims to find ways to speed up the solution of computational problems by using a quantum computer. A key milestone in this field will be when a unive…
Approximate unitary -designs by short random quantum circuits using nearest-neighbor and long-range gates
Aram Harrow, Saeed Mehraban
We prove that -depth local random quantum circuits with two qudit nearest-neighbor gates on a -dimensional lattice with n qudits are approximate -desig…
How many qubits are needed for quantum computational supremacy?
Alexander M. Dalzell, Aram W. Harrow, Dax Enshan Koh +1
Quantum computational supremacy arguments, which describe a way for a quantum computer to perform a task that cannot also be done by a classical computer, typically require some so…
Supervised learning with quantum enhanced feature spaces
Vojtech Havlicek, Antonio D. Córcoles, Kristan Temme +4
Machine learning and quantum computing are two technologies each with the potential for altering how computation is performed to address previously untenable problems. Kernel metho…
Algorithms, Bounds, and Strategies for Entangled XOR Games
Adam Bene Watts, Aram W. Harrow, Gurtej Kanwar +1
We study the complexity of computing the commuting-operator value of entangled XOR games with any number of players. We introduce necessary and sufficient criteria for an XOR…