Haiqu AgenticOS helps design novel quantum optimization algorithm scheme

Haiqu AgenticOS helped turn a research question into a tested algorithm that combines Digitized Cyclic Annealing with classical population-based search, producing better optimization results under the same sampling budget 

Better optimization methods could help industries use energy, infrastructure, and computing resources more effectively. Applications range from routing delivery fleets and scheduling factories to designing communication networks and balancing power grids. Quantum computing may offer new ways to explore these large solution spaces. However, turning that potential into practical improvements requires algorithms that can operate within real sampling and hardware constraints.

Further adoption of quantum optimization methods also depends on how these approaches fit into typical end-to-end optimization workflows. Classical solvers often run multiple searches and let them exchange promising solutions. Could quantum searches benefit from the same strategy? Could a discovery made by one optimizer help others explore more effectively, without increasing the quantum sampling budget?

We used Haiqu AgenticOS to investigate this question by combining our recently proposed Digitized Cyclic Annealing algorithm with classical Population-Based Search. 

On a simulated 100-spin benchmark, coordination reduced the remaining distance from the known optimum by approximately 60% compared with independent searches under the same sampling budget. This initial result provides a direction for further research and offers a concrete example of how AgenticOS helps scientists turn ideas for quantum applications into testable algorithms and evidence.

1. Why Investigate Coordinated Quantum Optimization?

Many real decisions come down to choosing the best option from an enormous number of possibilities: which devices should relay network traffic, which route a delivery fleet should take, or how jobs should be scheduled. Each choice breaks into yes-or-no decisions, and the number of combinations doubles with every extra decision, so even a fast computer cannot try them all. Problems like these are called combinatorial optimization problems [2]. Choosing the smallest set of devices that keeps a wireless sensor network connected, known as a virtual backbone, is one example [3]. Practical solvers settle for good answers, and they often get stuck on answers that look best locally but are not the best overall.

Haiqu’s Digitized Cyclic Annealing (DCA) is a quantum algorithm for problems of this kind, and its original paper addresses virtual backbone problems [1]. DCA searches by running a quantum circuit many times, and today’s hardware allows only a limited number of runs, called shots. That raises a practical question: given a fixed number of shots, is it better to spend them on one long search or to split them across several copies of the optimizer that run side by side?

The rest of this blog explains how AgenticOS helped the researcher turn that question into an experiment comparing independent searches with several ways of sharing discoveries.

2. What Was the Input?

We provided AgenticOS with a concrete starting point:

1. The DCA paper [1] and related literature, describing the algorithm and its scientific foundations.
2. An existing single-search implementation, providing a baseline to reproduce and extend.
3. A research question: how should multiple DCA searches share discoveries, and would coordination improve their results under a fixed sampling budget?

The initial plan covered a single search, several independent searches, and searches that could adopt the best solution found by the group. Each copy, called a replica, would run the same underlying DCA circuit. The investigation would change how replicas exchanged candidate solutions between cycles.

The task for AgenticOS: build a reusable multi-replica implementation, preserve the original DCA behavior, and design controlled experiments to compare independent and coordinated searches.

This required connecting the literature to an executable research plan: defining the communication rules, implementing them consistently, and deciding how to measure their effects. The researcher reviewed the proposed directions and steered which methods and experiments to pursue.

3. How Did AgenticOS Turn the Idea into a Trustworthy Experiment?

AgenticOS organized the investigation into connected research and engineering modules. Outputs from literature analysis informed the prototype design; the implementation then fed into experiments and further revisions. The researcher reviewed the proposed directions and steered the work throughout.

Define what the experiment must establish.
The research and design modules translated the question into concrete requirements: preserve the underlying DCA algorithm, support different communication rules, and compare their effects under equal sampling budgets. The investigation needed to distinguish improvements caused by coordination from those caused by additional samples or changes to the quantum circuit.

Build from a reproduced baseline.
AgenticOS reproduced the existing single-search implementation before extending it into a population of replicas. It developed a reusable architecture in which the communication policy could change while the underlying DCA search remained consistent. Architecture reviews examined assumptions and data flows, including how random sampling would operate across replicas.

The framework supported different population sizes, shot allocations, and coordination policies. A matrix product state simulation path, which represents quantum states compactly when their entanglement allows it, enabled experiments with 100 spins.

Design controlled comparisons.
Experiment modules developed comparisons between independent searches and communicating populations. They tracked sampling budgets, kept results from different methods separate, and supported repeated runs with different random seeds. Diagnostics also examined population diversity, helping the researcher investigate whether sharing spread useful discoveries or concentrated the searches too early.

Audit, correct, and check again.
Verification continued as the implementation evolved. The project records describe audits that caught incorrect averaging, a sampling-budget check that could not detect a mismatch, an indexing error, and reuse of stale cached results. The researcher approved each correction before AgenticOS applied it and reran the relevant checks.

The resulting framework lets the researcher test alternative coordination strategies, inspect their behavior, and revise the experiments. The contribution from AgenticOS connected the scientific question to executable methods and checks that made the results interpretable.

4. What Did Coordinated Searches Achieve?

The strongest results came from population annealing: a classical selection rule that makes lower-cost solutions more likely to become reference points for subsequent searches. This allowed promising discoveries to spread across the population while each replica continued running the same DCA circuit.

The main comparison used a 100-spin antiferromagnetic chain, whose exact optimum is known: an energy of −99. This provided a controlled benchmark for measuring how far each method remained from the best possible solution.

Both methods ran 10 replicas, with 50 shots per replica per cycle, for 100 cycles. Results were averaged over 15 random seeds. Under this equal sampling budget, the coordinated population finished closer to the optimum:

The remaining distance fell by approximately 60%. This measures improved solution quality; it does not describe a reduction in runtime or circuit executions. The replicas belong to 15 repeated runs, and sharing makes their outcomes correlated.

Smaller benchmarks made the effect of sharing easier to see. On a 20-node weighted MaxCut instance, the coordinated population brought every replica to the optimum in all 10 repeated runs. Independent searches achieved that population-wide outcome in only one run. However, the first replica often discovered the optimum at a similar time in both methods. The clearest benefit was spreading useful discoveries and improving the population’s collective solution quality.

These results support further investigation of coordinated DCA. The 100-spin chain is straightforward to solve classically, and the MaxCut examples are small. Their role here was to test the extension under controlled conditions. 

With AgenticOS, we obtained a working experimental framework and evidence to guide the next tests on harder problems and quantum hardware.

5. Conclusions and Outlook

This brief research project produced a promising extension of Digitized Cyclic Annealing and a reusable framework for testing it. Coordination improved the population’s solution quality under a fixed sampling budget, providing a reason to investigate the approach on harder problems.

AgenticOS helped turn an open question into an experiment that can be inspected, revised, and built on. The work connected literature analysis with algorithm design, simulation software, and experimental controls. The researcher set the direction and judged the evidence; AgenticOS helped carry those decisions through implementation and verification. 

This offers a practical R&D starting point. A research team can retain a familiar classical or quantum framework and investigate whether a modified or extended algorithm improves its performance. AgenticOS can help formulate that comparison, develop the prototype, and evaluate the evidence before committing to a larger hardware study. 

The broader opportunity for AgenticOS is to help scientists pursue more of these questions: taking a proposed mechanism through a working implementation, challenging its apparent gains, and producing evidence that guides the next research decision.

Book a Demo