Kabir Dubey
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Kabir Dubey has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Adrien Suau
Qraftware, Toulouse, France
1 shared publication - Arabella Schelpe
Independent Researcher, UK
1 shared publication - Austin G. Fowler
Google Research, Mountain View, CA, USA
1 shared publication - Benjamin Hall
Quantum Software, Infleqtion
1 shared publication Brendan Reid
PsiQuantum, Palo Alto, California, USA
1 shared publication- Changhao Li
Global Technology Applied Research, JPMorgan Chase, New York, USA
1 shared publication
Latest Publications
- Open Access
- 10 April 2027
- Published by Association for Computing Machinery (ACM)
- p. 1004-1020
Trident: Efficient Load Verification for Yoked Surface Codes using a Three-Level Memory Hierarchy
- 10 April 2027
- Published by Association for Computing Machinery (ACM)
- p. 1004-1020
Open AccessTrident: Efficient Load Verification for Yoked Surface Codes using a Three-Level Memory Hierarchy
- Open Access
- 1 April 2026
- Published by The Open Journal in Journal of Open Source Software
- Vol. 11 (120)
tqec: A Python package for topological quantum error correction
- 1 April 2026
- Published by The Open Journal in Journal of Open Source Software
- Vol. 11 (120)
Open Accesstqec: A Python package for topological quantum error correction
- Open Access
- 2 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Quantum Computing
Q-CHOP: Quantum constrained Hamiltonian optimization
Combinatorial optimization problems that arise in science and industry typically have constraints. Yet the presence of constraints makes them challenging to tackle using both classical and quantum optimization algorithms. We propose a new quantum algorithm for constrained optimization, which we call quantum constrained Hamiltonian optimization (Q-CHOP). Our algorithm leverages the observation that for many problems, while the best solution is difficult to find, the worst feasible (constraint-satisfying) solution is known. The basic idea of Q-CHOP is to enforce a Hamiltonian constraint at all times, thereby restricting evolution to the subspace of feasible states, and slowly “rotate” an objective Hamiltonian to trace an adiabatic path from the worst feasible state to the best feasible state. Q-CHOP thereby assigns qualitatively distinct roles to the constraint and objective functions of a constrained optimization problem. We additionally propose a version of Q-CHOP that can start in any feasible state. Finally, we benchmark Q-CHOP against the commonly-used adiabatic algorithm of quantum annealing with an objective function that penalizes constraint violation, and find that Q-CHOP consistently performs significantly better on a wide range of problems, including textbook graph problems, knapsack problems, combinatorial auctions, and a real-world financial use case of bond exchange-traded fund basket optimization.
- 2 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Quantum Computing
Open AccessQ-CHOP: Quantum constrained Hamiltonian optimization
Combinatorial optimization problems that arise in science and industry typically have constraints. Yet the presence of constraints makes them challenging to tackle using both classical and quantum optimization algorithms. We propose a new quantum algorithm for constrained optimization, which we call quantum constrained Hamiltonian optimization (Q-CHOP). Our algorithm leverages the observation that for many problems, while the best solution is difficult to find, the worst feasible (constraint-satisfying) solution is known. The basic idea of Q-CHOP is to enforce a Hamiltonian constraint at all times, thereby restricting evolution to the subspace of feasible states, and slowly “rotate” an objective Hamiltonian to trace an adiabatic path from the worst feasible state to the best feasible state. Q-CHOP thereby assigns qualitatively distinct roles to the constraint and objective functions of a constrained optimization problem. We additionally propose a version of Q-CHOP that can start in any feasible state. Finally, we benchmark Q-CHOP against the commonly-used adiabatic algorithm of quantum annealing with an objective function that penalizes constraint violation, and find that Q-CHOP consistently performs significantly better on a wide range of problems, including textbook graph problems, knapsack problems, combinatorial auctions, and a real-world financial use case of bond exchange-traded fund basket optimization.