60 citations · 178 across the 36 of their papers we have counts for
5 papers · 1 filter
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…
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…
A mixed-integer program for circuit execution time minimization with precedence constraints
Mostafa Atallah, James Ostrowski, Rebekah Herrman
We present a mixed-integer programming (MIP) model for scheduling quantum circuits to minimize execution time. Our approach maximizes parallelism by allowing non-overlapping gates…
Decomposition of Sparse Amplitude Permutation Gates with Application to Preparation of Sparse Clustered Quantum States
Igor Gaidai, Rebekah Herrman
In this work we consider a novel heuristic decomposition algorithm for -qubit gates that implement specified amplitude permutations on sparse states with non-zero amplitudes…