6 papers
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…
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…