40.2k citations
- Centre National de la Recherche ScientifiqueFR1k papers
- University of Maryland, College ParkUS937 papers
- Massachusetts Institute of TechnologyUS887 papers
- University of MichiganUS776 papers
- University of OxfordGB676 papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR670 papers
- Oak Ridge National LaboratoryUS662 papers
- Brookhaven National LaboratoryUS612 papers
- University of CambridgeGB601 papers
- Columbia UniversityUS568 papers
- University of New MexicoUS533 papers
- Université Paris-SaclayFR528 papers
47 papers · 2 filters
Increasing the Hardness of Posiform Planting Using Random QUBOs for Programmable Quantum Annealer Benchmarking
Elijah Pelofske, Georg Hahn, Hristo Djidjev
Posiform planting is a method for constructing QUBO problems with a single unique planted solution that can be tailored to arbitrary connectivity graphs. In this study we investiga…
Efficient quantum-enhanced classical simulation for patches of quantum landscapes
Sacha Lerch, Ricard Puig, Manuel S. Rudolph +5
Understanding the capabilities of classical simulation methods is key to identifying where quantum computers are advantageous. Not only does this ensure that quantum computers are…
Biased Degenerate Ground-State Sampling of Small Ising Models with Converged QAOA
Elijah Pelofske
The Quantum Alternating Operator Ansatz, a generalization of the Quantum Approximate Optimization Algorithm (QAOA), is a quantum algorithm used for approximately solving combinator…
Tighter Lower Bounds on Quantum Annealing Times
Luis Pedro García-Pintos, Mrunmay Sahasrabudhe, Christian Arenz
We derive lower bounds on the time needed for a quantum annealer to prepare the ground state of a target Hamiltonian. These bounds do not depend on the annealing schedule and can t…
Analyzing the quantum approximate optimization algorithm: ansätze, symmetries, and Lie algebras
Sujay Kazi, Martín Larocca, Marco Farinati +3
The Quantum Approximate Optimization Algorithm (QAOA) has been proposed as a method to obtain approximate solutions for combinatorial optimization tasks. In this work, we study the…
Simplified projection on total spin zero for state preparation on quantum computers
Evan Rule, Ionel Stetcu, Joseph Carlson
We introduce a simple algorithm for projecting on states of a many-body system by performing a series of rotations to remove states with angular momentum projections greater…