701 citations · 2k across the 13 of their papers we have counts for
16 papers
An efficient Hamiltonian-based quantum algorithm for characters of the symmetric group
Dikshant Rathore, Leo Zhou
Consider a quantum state vector proportional to any given column of the character table of the symmetric group (), corresponding to a superposition over the irreps weighted by…
Gibbs Sampling in the Shattered Phase by Decoded Quantum Interferometry
Leo Zhou, Noah Shutty, Mark Sellke +1
We apply Decoded Quantum Interferometry (DQI) to sample from the Gibbs measures of classical Ising spin Hamiltonians. We show that this Gibbs sampling problem reduces to a quantum…
Performance and limitations of the QAOA at constant levels on large sparse hypergraphs and spin glass models
Joao Basso, David Gamarnik, Song Mei +1
The Quantum Approximate Optimization Algorithm (QAOA) is a general purpose quantum algorithm designed for combinatorial optimization. We analyze its expected performance and prove…
Quantum Optimization of Maximum Independent Set using Rydberg Atom Arrays
Sepehr Ebadi, Alexander Keesling, Madelyn Cain +21
Realizing quantum speedup for practically relevant, computationally hard problems is a central challenge in quantum information science. Using Rydberg atom arrays with up to 289 qu…
The Quantum Approximate Optimization Algorithm at High Depth for MaxCut on Large-Girth Regular Graphs and the Sherrington-Kirkpatrick Model
Joao Basso, Edward Farhi, Kunal Marwaha +2
The Quantum Approximate Optimization Algorithm (QAOA) finds approximate solutions to combinatorial optimization problems. Its performance monotonically improves with its depth .…
Universal Hamiltonian simulators in one and two dimensions
Leo Zhou, Dorit Aharonov
A major quantum computing application is analog Hamiltonian simulations, in which the low-lying spectrum of a simulator Hamiltonian encodes the physics of a target Hamiltonian…
Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
Matthew P. Harrigan, Kevin J. Sung, Matthew Neeley +83
We demonstrate the application of the Google Sycamore superconducting qubit quantum processor to combinatorial optimization problems with the quantum approximate optimization algor…
Repulsive photons in a quantum nonlinear medium
Sergio H. Cantu, Aditya V. Venkatramani, Wenchao Xu +4
The ability to control strongly interacting light quanta (photons) is of central importance in quantum science and engineering. Recently it was shown that such strong interactions…
The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size
Edward Farhi, Jeffrey Goldstone, Sam Gutmann +1
The Quantum Approximate Optimization Algorithm (QAOA) is a general-purpose algorithm for combinatorial optimization problems whose performance can only improve with the number of l…
Entanglement bounds on the performance of quantum computing architectures
Zachary Eldredge, Leo Zhou, Aniruddha Bapat +4
There are many possible architectures of qubit connectivity that designers of future quantum computers will need to choose between. However, the process of evaluating a particular…
Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
Leo Zhou, Sheng-Tao Wang, Soonwon Choi +2
The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical variational algorithm designed to tackle combinatorial optimization problems. Despite its promis…
Computational complexity of the Rydberg blockade in two dimensions
Hannes Pichler, Sheng-Tao Wang, Leo Zhou +2
We discuss the computational complexity of finding the ground state of the two-dimensional array of quantum bits that interact via strong van der Waals interactions. Specifically,…
Hamiltonian sparsification and gap-simulations
Dorit Aharonov, Leo Zhou
Analog quantum simulations---simulations of one Hamiltonian by another---is one of the major goals in the noisy intermediate-scale quantum computation (NISQ) era, and has many appl…
Symmetry-protected dissipative preparation of matrix product states
Leo Zhou, Soonwon Choi, Mikhail D. Lukin
We propose and analyze a method for efficient dissipative preparation of matrix product states that exploits their symmetry properties. Specifically, we construct an explicit proto…
Error suppression in Hamiltonian based quantum computation using energy penalties
Adam D. Bookatz, Edward Farhi, Leo Zhou
We consider the use of quantum error detecting codes, together with energy penalties against leaving the codespace, as a method for suppressing environmentally induced errors in Ha…
Energy and centrality dependence of particle multiplicity in heavy ion collisions from = 20 to 2760 GeV
Leo Zhou, George S. F. Stephans
The centrality dependence of midrapidity charged-particle multiplicities at a nucleon-nucleon center-of-mass energy of 2.76 TeV from CMS are compared to PHOBOS data at 200 and 19.6…