5 papers
Partitioned-Constraint QAOA (PC-QAOA): Structural State Preparation and Penalty Enforcement for Quantum Optimization
Anthony Wilkie, Alexander DeLise, Andrew Del Real +2
Constrained combinatorial optimization remains challenging for quantum algorithms because feasibility must be explicitly enforced, typically through penalty terms or problem-specif…
Efficient circuits for leaf-separable state preparation
Sunil Vittal, Anthony Wilkie, Nika Rastegari +2
Efficient state preparation is a challenging and important problem in quantum computing. In this work, we present a recursive state preparation algorithm that combines logarithmic-…
An Exclusive-Sum-of-Products Pipeline for QAOA
Matthew Brunet, Shilpi Shah, Mostafa Atallah +2
The quantum approximate optimization algorithm is commonly used to solve combinatorial optimization problems. While unconstrained problems map naturally into the algorithm, incorpo…
Quantum approximate optimization algorithm with random and subgraph phase operators
Anthony Wilkie, Igor Gaidai, James Ostrowski +1
The quantum approximate optimization algorithm (QAOA) is a promising quantum algorithm that can be used to approximately solve combinatorial optimization problems. The usual QAOA a…
An angle rounding parameter initialization technique for ma-QAOA
Anthony Wilkie, James Ostrowski, Rebekah Herrman
The multi-angle quantum approximate optimization algorithm (ma-QAOA) is a recently introduced algorithm that gives at least the same approximation ratio as the quantum approximate…