The algorithm, called Bi-directional Multi-solution scalable Grover Search, or BMGS, was developed by Debanjan Konar, Zain Hafeez and Vaneet Aggarwal of Purdue University. Their starting point is a family of techniques known as partial Grover searches, which trade a small loss of certainty for a large gain in speed by searching blocks of the database rather than individual entries. Grover and Radhakrishnan showed in 2005 that a partial search combining local and global iterations can find a marked block in about (pi/4) times the square root of N times the square root of one minus one over b, where b is the branching factor describing how many blocks the database is divided into. Later work on depth-first Grover search extended this idea to databases containing an unknown number of solutions, but that approach carried a heavy price: a complicated amplitude interception step and a higher count of oracle calls that scaled as the square root of N times a factor approaching one, yielding a total complexity of O of s times the square root of N for s solutions, which is not optimal.

BMsG eliminates the amplitude interception step entirely and replaces it with something structurally simpler and more powerful: a multi-segment bidirectional search. The core idea is to split the r-qubit register representing the database into d equal segments, each containing roughly r divided by d qubits. Instead of searching the whole space from one direction, the algorithm launches partial Grover searches from both ends of the address simultaneously. A forward pass explores the leading bits of the solution address while a backward pass explores the trailing bits, and the two search frontiers advance in parallel until they meet at predetermined intercept points within each segment. Once both directions agree on their respective portions of the address, the full solution path is formed by simply concatenating the forward and backward results, with no expensive merging operation required.

Each layer of the search works on a small window of k qubits, where k equals the ceiling of the base-2 logarithm of the branching factor b. In their experiments the authors used a branching factor of four, meaning each partial search determines the next two bits of the solution address at a time. Auxiliary qubits record which bits have already been found and whether they have been checked, allowing the algorithm to track progress across segments. When a search interval shrinks to a width of at most b, a standard full Grover search pins down the exact address of the solution within it. The elegance of the scheme lies in its coordination: rather than running isolated Grover searches on independent subspaces, BMGS builds a layered, tree-like search over the entire space, amplifying the amplitudes of target blocks across all segments in parallel.

The theoretical analysis shows that for each solution, BMGS requires at most the square root of N times one minus the square root of one over b raised to the floor of r divided by dk oracle calls, where N equals two to the power r is the database size and d is the number of segments. For a single solution this reduces to the familiar O of the square root of N scaling, matching the fundamental lower bound that Bennett and colleagues proved no quantum algorithm can beat. More importantly, for multiple solutions the average complexity reaches O of the square root of s times N, which is optimal, provided the solutions are reasonably distributed across the search space and the number of segments is at least on the order of s. The authors are careful to note that this is an average-case result under assumptions of effective parallelism, not a strict worst-case improvement over Grover’s lower bound.

Perhaps the most striking practical advantage concerns circuit depth rather than query count. In a standard Grover search over r qubits, the oracle must flip the phase of one marked state among two to the r possibilities, which demands a multi-controlled NOT gate acting on all r control qubits. Such gates decompose into long chains of Toffoli operations, and their cost grows linearly or quadratically with r depending on whether ancilla qubits are available. BMGS sidesteps this entirely: because each local oracle acts on only k qubits, typically just two, it can be built from a single standard Toffoli gate of constant size. In a 20-qubit search space, a standard Grover oracle requires a 20-controlled gate, while BMGS uses a sequence of two-controlled gates, keeping the oracle size static no matter how large the database grows.

The simulation results are dramatic. Using the Qiskit Aer simulator on systems with eight cores and eight gigabytes of memory, the team benchmarked BMGS against depth-first Grover search and partial Grover search across databases ranging from 2 to 20 qubits, running up to 50 trials per configuration with 1024 measurement shots each. For a 20-qubit search space containing two solutions, partial Grover search needed 1608 iterations in the worst case, while depth-first Grover search completed the task in 20 iterations and BMGS in just 10. With three solutions the gap widened further: 2412 iterations for partial search, 30 for the depth-first method, and only 15 for BMGS. In the best case, where solutions overlap favorably, BMGS found two solutions in 6 iterations and three in 7. Even against the standard Grover algorithm the improvement is stark: an 8-qubit search that takes standard Grover 20 iterations requires only 2 with BMGS, and a 20-qubit search drops from roughly 804 iterations to 5.

Segmentation adds another tunable lever. Increasing the number of segments d reduces the effective depth each partial search must traverse, cutting runtime and oracle depth, at least while the product of d and k remains smaller than r. Pushing d to 10 in a 20-qubit search reduced the iteration count to a single iteration, though the authors caution that excessively large segment counts introduce auxiliary-qubit overhead and diminishing parallel efficiency. The complexity analysis confirms that the iteration count decreases monotonically with d only approximately, since floor effects and segment overhead prevent strict monotonicity in practice. The team also analyzed error probabilities, showing that because amplitudes remain globally coupled across the full Hilbert space, BMGS should be understood as a structured amplitude amplification process with segmented oracle implementation rather than a collection of independent probabilistic searches, and that its practical reliability exceeds that of partial Grover search in shallow segmented implementations.

The implications reach well beyond toy databases. Multi-solution search problems arise naturally in pattern recognition, optimization, and cryptanalysis, where several satisfactory answers may exist and finding any of them quickly matters. The authors point toward a particularly promising extension: integrating BMGS into Grover Adaptive Search, a framework for solving Quadratic Unconstrained Binary Optimization and Ising-model problems by repeatedly applying Grover search with a threshold oracle that marks candidate states better than the current best. Because oracle construction and large multi-controlled gates dominate the cost in such optimization workloads, replacing them with BMGS’s small, segmented Toffoli-based oracles could make adaptive quantum optimization far more tractable on near-term hardware.

For the noisy intermediate-scale quantum devices available today, where circuit depth is often the binding constraint, the distinction between asymptotic elegance and hardware feasibility is everything. BMGS does not break Grover’s fundamental square-root limit, and the authors are explicit about that. What it does achieve is a several-order-of-magnitude reduction in circuit depth, Toffoli depth, and iteration count for multi-solution searches, achieved through a hybrid quantum-classical workflow in which classical control coordinates parallel quantum searches over segments. With the Qiskit implementation freely available on GitHub, the algorithm offers experimentalists a concrete, resource-efficient template for running meaningful quantum searches on hardware that cannot yet sustain deep circuits, and it suggests that clever restructuring of established algorithms may deliver practical quantum advantages sooner than raw qubit counts alone would imply.

Subject of Research: A scalable bidirectional quantum search algorithm extending Grover's algorithm for efficient multi-solution database search with reduced oracle calls and circuit depth.

Article Title: A Bi-directional multi-solution scalable Grover search Algorithm

Article References: Konar, D., Hafeez, Z., & Aggarwal, V. (2026). A Bi-directional multi-solution scalable Grover search Algorithm. Quantum Information Processing, 25(9), Article 306. https://doi.org/10.1007/s11128-026-05328-5

Image Credits: AI Generated

DOI: 10.1007/s11128-026-05328-5

Keywords: Quantum Computing, Grover Search, Bi-directional Search, Partial Grover Search, Multi-solution Search, Qubit, Oracle Calls, Circuit Depth, NISQ Devices, Amplitude Amplification, Quantum Information Processing, Bi-directional

The Quantum Approximate Optimization Algorithm, known as QAOA, has become the workhorse of near-term quantum optimization. It works as a hybrid quantum-classical dance: a quantum processor prepares a candidate state, a classical optimizer tunes the circuit’s angles, and the two repeat until a good solution emerges. The catch is that QAOA’s performance hinges on a parameter called depth, denoted p, which counts how many alternating layers of problem and mixing operations the circuit contains. Deeper circuits generally produce better answers, but they demand more two-qubit gates, more classical optimization effort, and more tolerance of hardware noise. Until now, practitioners had to guess this depth in advance, with no reliable guidance.

Guessing wrong is costly in both directions. A circuit that is too shallow is underparameterized and cannot represent a high-quality solution, particularly as problems grow denser and more constrained. A circuit that is too deep burns scarce quantum resources on layers that add nothing, a serious problem on today’s noisy intermediate-scale quantum devices where every additional two-qubit gate multiplies the chance of error. The research team, led by Rakesh Saini with co-authors Nora Mohamed, Saif Al-Kuwari and Ahmed Farouk, set out to eliminate this guesswork entirely by letting the algorithm discover its own depth.

DDQAOA begins modestly, with a single QAOA layer, and monitors the optimization as it proceeds. The algorithm tracks the expectation value of the problem’s cost function, the quantity that measures how good the current quantum state is. When improvement stalls, the algorithm does not give up; instead it concludes that the current depth has exhausted its expressive capacity and adds one more layer. Two complementary convergence checks guard against false alarms. The first detects a plateau by verifying that the best energy has not improved beyond a small tolerance over a patience window of fifty iterations. The second examines the variance of recent energy values, distinguishing genuine convergence from mere oscillations around a local minimum. Only when one of these conditions is satisfied does the depth increase.

Crucially, when a new layer is added, the algorithm does not start its optimization from scratch. Building on the INTERP parameter-transfer protocol developed by Zhou and colleagues in 2020, DDQAOA interpolates the optimized parameters from the shallower circuit to seed the deeper one. For the transition from one to two layers, the team applies transfer coefficients of 1.2 for the cost angle gamma and 0.8 for the mixer angle beta, values motivated by the structure of adiabatic quantum evolution. For deeper transitions, the method constructs smooth interpolants, switching from linear interpolation to cubic splines once four or more layers are available. This warm-starting places each new optimization inside the basin of attraction of a good solution, dramatically accelerating convergence.

To test their method rigorously, the researchers turned to the Constrained Shortest Path Problem, an NP-hard challenge that asks for the cheapest route between two points in a network while respecting a limit on resource consumption, such as fuel or time. This problem is far more than an academic curiosity: it appears as a building block in air-cargo route planning, flight scheduling, airline crew pairing, and aircraft tail assignment. The team encoded the problem as a Quadratic Unconstrained Binary Optimization formulation, folding the source, target, flow-conservation and resource constraints into penalty terms, and then converted the result into an Ising Hamiltonian whose ground state encodes the optimal path.

The benchmark was substantial: 100 randomly generated problem instances each at the 10-qubit and 16-qubit scales, plus 20 additional instances requiring 22 qubits on complete five-node graphs. Against fixed-depth QAOA baselines at depths 3, 5, 10 and 15, DDQAOA delivered striking results. At 10 and 16 qubits it outperformed every fixed-depth baseline, achieving median approximation ratios of roughly 0.97 and 0.99 respectively, with the smallest variability of any method. At 22 qubits it matched the best deep circuits, statistically indistinguishable from depth-10 QAOA and within 0.1 percent of depth-15, while attaining the highest median success probability of all methods tested.

The resource savings are where the approach truly shines. Because CNOT gates are the dominant source of noise on real quantum hardware, cumulative two-qubit gate usage is the currency of practical quantum optimization. Standard QAOA at depth 15, which achieved results close to DDQAOA, consumed 217 percent, 159.3 percent and 315 percent more CNOT gates at the 10-, 16- and 22-qubit scales respectively. Measured per circuit, DDQAOA used 3.17, 2.59 and 4.15 times fewer cumulative CNOTs than the deepest baseline across the three problem sizes. The algorithm’s gate count grows stepwise, from a single layer’s worth of gates up to the depth-10 equivalent, allocating quantum resources only as the optimization landscape requires.

Perhaps the most scientifically satisfying finding concerns the parameters themselves. In fixed-depth QAOA, the optimized gamma and beta angles typically show no discernible pattern across layers. DDQAOA, by contrast, consistently produced monotonically increasing gamma values and beta values converging toward zero, exactly the structure predicted by adiabatic theory, in which the cost Hamiltonian’s influence grows and the mixer’s fades as the system approaches the ground state. Across 100 diverse problem instances, with the classical optimizer free to deviate after initialization, this adiabatic signature emerged reliably, suggesting the interpolation strategy guides the search toward structured, physically meaningful solution manifolds rather than random corners of parameter space.

The authors are careful to note the limits of the current work. All experiments ran on classical simulators using the PennyLane framework with the Adam optimizer, and the success probabilities, while far above the random-guessing baseline of one over two to the power N, remain small in absolute terms because sampling the exact ground state among exponentially many bitstrings is an inherently stringent criterion. Future work will target larger instances and validation on real quantum hardware, where noise resilience and connectivity constraints will provide the ultimate test. Still, by removing the need to choose circuit depth in advance while matching or beating hand-tuned deep circuits at a fraction of the gate cost, DDQAOA offers a practical, NISQ-aware route to applying quantum optimization to genuinely constrained industrial problems, and a compelling demonstration that sometimes the best way to go deep is to earn each layer.

Subject of Research: A dynamic-depth variant of the quantum approximate optimization algorithm for solving the NP-hard constrained shortest path problem on near-term quantum devices.

Article Title: Dynamic depth quantum approximate optimization algorithm for solving constrained shortest path problem

Article References: Saini, R., Mohamed, N., Al-Kuwari, S., & Farouk, A. (2026). Dynamic depth quantum approximate optimization algorithm for solving constrained shortest path problem. Quantum Machine Intelligence, 8(2), Article 104. https://doi.org/10.1007/s42484-026-00442-0

Image Credits: AI Generated

DOI: 10.1007/s42484-026-00442-0

Keywords: quantum computing, QAOA, DDQAOA, constrained shortest path problem, combinatorial optimization, NISQ devices, circuit depth, parameter transfer, Ising Hamiltonian, QUBO, adiabatic evolution, CNOT gates