Brayden Goldstein-Gelb
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Brayden Goldstein-Gelb has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Hengyun Zhou
Harvard University
1 shared publication - John M. Martyn
Physical and Computational Sciences, Pacific Northwest National Laboratory
1 shared publication - Kun Liu
Yale University, New Haven, Connecticut, USA
1 shared publication - Phillip C. Lotshaw
Oak Ridge National Laboratory
1 shared publication - Yongshan Ding
Yale University, New Haven, Connecticut, USA
1 shared publication - Yuan Liu
North Carolina State University
1 shared publication
Latest Publications
- Open Access
- 8 September 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Quantum Computing
Convergence guarantee for linearly-constrained combinatorial optimization with a quantum alternating operator ansatz
We present a quantum alternating operator ansatz (QAOA + ) that solves a class of linearly constrained optimization problems by evolving a quantum state within a Hilbert subspace of feasible problem solutions. Our main focus is on a class of problems with a linear constraint containing sequential integer coefficients. For problems in this class, we devise QAOA + circuits that provably converge to the optimal solution as the number of circuit layers increases, generalizing previous guarantees for solving unconstrained problems or problems with symmetric constraints. Our approach includes asymmetric “mixing” Hamiltonians that drive transitions between feasible states, as well as a method to incorporate an arbitrary known feasible solution as the initial state, each of which can be applied beyond the specific linear constraints considered here. This analysis extends QAOA + performance guarantees to a more general set of linearly-constrained problems and provides tools for future generalizations.
- 8 September 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Quantum Computing
Open AccessConvergence guarantee for linearly-constrained combinatorial optimization with a quantum alternating operator ansatz
We present a quantum alternating operator ansatz (QAOA + ) that solves a class of linearly constrained optimization problems by evolving a quantum state within a Hilbert subspace of feasible problem solutions. Our main focus is on a class of problems with a linear constraint containing sequential integer coefficients. For problems in this class, we devise QAOA + circuits that provably converge to the optimal solution as the number of circuit layers increases, generalizing previous guarantees for solving unconstrained problems or problems with symmetric constraints. Our approach includes asymmetric “mixing” Hamiltonians that drive transitions between feasible states, as well as a method to incorporate an arbitrary known feasible solution as the initial state, each of which can be applied beyond the specific linear constraints considered here. This analysis extends QAOA + performance guarantees to a more general set of linearly-constrained problems and provides tools for future generalizations.
- Open Access
- 22 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 426-441
COMPAS: A Distributed Multi-Party SWAP Test for Parallel Quantum Algorithms
- 22 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 426-441
Open AccessCOMPAS: A Distributed Multi-Party SWAP Test for Parallel Quantum Algorithms