Iterative-QAOA solves pangenome assembly instances on current quantum hardware by using a fixed-ramp QAOA schedule with warm-start updates and a new HUBO encoding that cuts variables from O(N^{2}) to O(N log N).
Quantum alternating operator ansatz (qaoa) beyond low depth with gradu- ally changing unitaries
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
fields
quant-ph 5roles
method 1polarities
use method 1representative citing papers
Introduces Λ-lr-QAOA and piecewise-ramp QAOA that promote penalty schedules to variational parameters and use a feasibility-driven loss on budget-constrained MWIS satellite planning instances.
Iterative orthogonal-basis interpolation constructs high-quality QAOA parameter schedules for depths exceeding 1000 layers, outperforming prior methods on SK, portfolio, and LABS benchmarks.
Iterative-QAOA warm-starts for the shipment selection problem yield hybrid logistics plans with up to 12% more shipments delivered on specific real instances while keeping operational cost flat.
Hybrid quantum-classical graph partitioning inside LS-DYNA reduces amortized wall-clock time for large FEA simulations by 5.9-14.6 percent on meshes up to 35 million elements.
citing papers explorer
-
Nonvariational quantum optimisation approaches to pangenome-guided sequence assembly
Iterative-QAOA solves pangenome assembly instances on current quantum hardware by using a fixed-ramp QAOA schedule with warm-start updates and a new HUBO encoding that cuts variables from O(N^{2}) to O(N log N).
-
Feasibility-driven QAOA with penalty scheduling
Introduces Λ-lr-QAOA and piecewise-ramp QAOA that promote penalty schedules to variational parameters and use a feasibility-driven loss on budget-constrained MWIS satellite planning instances.
-
Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm
Iterative orthogonal-basis interpolation constructs high-quality QAOA parameter schedules for depths exceeding 1000 layers, outperforming prior methods on SK, portfolio, and LABS benchmarks.
-
Hybrid Quantum-Classical Optimization Workflows for the Shipment Selection Problem
Iterative-QAOA warm-starts for the shipment selection problem yield hybrid logistics plans with up to 12% more shipments delivered on specific real instances while keeping operational cost flat.
-
End-to-end performance of quantum-accelerated large-scale linear algebra workflows
Hybrid quantum-classical graph partitioning inside LS-DYNA reduces amortized wall-clock time for large FEA simulations by 5.9-14.6 percent on meshes up to 35 million elements.