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 dominant technology in the current generation of quantum computers relies on superconducting circuits, tiny electrical oscillators that, when cooled sufficiently, carry current without resistance. These devices have enabled impressive demonstrations of quantum computation, but they come with a fundamental weakness. Superconducting qubits are exquisitely sensitive to electromagnetic noise and to stray electrical charges, the kind of static electricity that makes hair cling to a balloon on a dry day. Even minuscule perturbations of this sort can scramble the delicate quantum states that encode information, introducing errors that must be corrected through elaborate overhead. As engineers attempt to pack more and more qubits onto a chip, keeping these error rates under control becomes one of the central bottlenecks to scaling the machines up.

The Surrey team, drawn from the university’s Quantum Sciences Group, has proposed a radically different approach to quantum hardware. Their proposed device, named the Superfluid Helium Oscillator Quantum, or SHOQ, would store and manipulate quantum information in quantized oscillations within superfluid helium-3. Because the medium is electrically charge-neutral, the qubit is naturally immune to many of the electromagnetic disturbances and stray charges that torment conventional superconducting devices. According to the team’s theoretical analysis, this intrinsic protection could translate into error rates roughly 100 times lower than those of standard superconducting qubits, a margin that would substantially ease the burden of quantum error correction in a large-scale machine.

The concept is, the researchers note, the first reported design for a qubit based on superfluid helium. While the individual physical ingredients have long been studied in isolation, the Surrey group is the first to assemble them into a coherent microfluidic device architecture and to work out the specific parameters and specifications needed for the device to function as a qubit. Dr Priya Sharma, Daphne Jackson Fellow in Hybrid Quantum Systems at the University of Surrey’s School of Mathematics and Physics and lead author of the study, emphasized that the work is an educated design grounded in established physics rather than a speculative sketch. The mathematics, she explained, indicates that the device should work as intended, and the crucial next step is to fabricate a prototype and test the predictions experimentally.

The underlying physics is as fascinating as the engineering ambition. Helium-3, the lighter isotope of helium, becomes a superfluid at temperatures only a few thousandths of a degree above absolute zero. In this state, the liquid flows with zero viscosity and exhibits quantum behavior on a macroscopic scale, with collective oscillations whose energy levels are quantized just like those of atoms. The SHOQ proposal taps into these quantized mechanical vibrations as the carrier of quantum information. Because these oscillations involve neutral atoms rather than moving charges, they do not couple strongly to the electric fields and charge fluctuations that are ubiquitous in solid-state environments, offering what physicists call a quieter platform for preserving delicate quantum states.

An especially significant feature of the proposal is that the SHOQ device is not intended to replace existing quantum technology outright. The paper outlines how the superfluid-based qubit could be coupled with current superconducting quantum hardware, raising the possibility that the two technologies might operate side by side within a single larger quantum system. Dr Eran Ginossar, Associate Professor at the University of Surrey’s Department of Physics and Advanced Technology Institute and co-author of the study, argued that no single qubit technology needs to do everything. Combining different quantum platforms, he suggested, could allow engineers to exploit the particular strengths of each, and superfluid helium offers a fundamentally new type of quantum hardware to explore. If the predicted performance can be demonstrated in the laboratory, such devices could eventually work alongside superconducting systems as components of hybrid architectures.

One potential application highlighted by the team is quantum memory. In a future hybrid computer, a version of the SHOQ device could serve as a long-lived repository for quantum information, storing fragile states while a separate processor built from different hardware performs calculations. This division of labor mirrors the separation between memory and processing units in classical computers and could prove decisive in the quest for machines that are both powerful and reliable. The low sensitivity of charge-neutral superfluid helium to environmental noise makes it a natural candidate for the memory role, where preservation of quantum coherence over time is the paramount requirement.

The Surrey effort is not proceeding in isolation. The work was carried out in collaboration with Professor Jens Koch of Northwestern University in the United States, a physicist who was among the researchers behind the development of the transmon, the superconducting qubit design that has become the workhorse of much of today’s quantum computing industry. That pedigree gives the new proposal considerable weight, since the transmon itself succeeded by engineering away sensitivity to charge noise, and the SHOQ concept extends the same philosophy into an entirely different physical medium. The involvement of researchers with hands-on experience in bringing a qubit design from theory to widespread laboratory use may help the new idea avoid some of the pitfalls that accompany novel hardware concepts.

The team is now turning its attention to building a prototype to determine whether the theoretical predictions survive contact with reality, an effort supported by an IAA Commercialisation Fellowship awarded to Dr Sharma. The cryogenic challenge is formidable but not unprecedented: although the SHOQ device would need to operate at extremely low temperatures, conditions of exactly this kind have already been achieved experimentally in superfluid helium-3 research laboratories around the world. That existing experimental infrastructure means the path from concept to prototype does not require inventing entirely new cryogenic techniques, only adapting well-established ones to a new microfluidic device. If the prototype confirms the predicted hundredfold reduction in error rates, superfluid helium could move from the margins of low-temperature physics to the center of the conversation about how to scale quantum computers, adding a genuinely new and remarkably quiet material platform to the engineer’s toolkit.

The choice of helium-3 rather than the more common helium-4 is central to the proposal. Helium-4 atoms are bosons and form a superfluid at around two kelvin, but helium-3 atoms are fermions, which means they cannot condense directly. Instead, at temperatures a few thousandths of a degree above absolute zero, pairs of helium-3 atoms bind together in a manner analogous to the Cooper pairs of electrons in a superconductor, and it is these paired atoms that flow without viscosity. This pairing mechanism gives superfluid helium-3 a rich internal structure, including multiple distinct superfluid phases, and endows the liquid with collective modes whose quantum properties are exceptionally well characterized by decades of low-temperature research.

The quantized vibrations that the SHOQ design would exploit belong to a broader family of mechanical quantum systems that physicists have been developing for years. Researchers have previously succeeded in cooling micromechanical drums and membranes to their quantum ground states and entangling them with light, establishing that mechanical oscillators can genuinely store and process quantum information. What has been missing is a mechanical oscillator whose intrinsic noise performance rivals that of the best electronic qubits, and the Surrey team argues that a charge-neutral superfluid medium could supply exactly that, since acoustic modes in helium couple only weakly to the solid-state defects and two-level fluctuators that degrade fabricated resonators on chips.

The significance of a hundredfold reduction in error rates becomes clearer when viewed through the lens of quantum error correction. Theoretical studies of fault-tolerant computation indicate that below a critical error threshold, adding more physical qubits suppresses logical errors exponentially, but the overhead involved is enormous when physical error rates sit near the threshold. Lowering the physical error rate by two orders of magnitude would reduce the number of physical qubits needed per logical qubit by a comparable factor, potentially shrinking the machine required for useful fault-tolerant computation from millions of qubits to a far more manageable scale.

The hybrid vision also echoes patterns from other parts of the quantum technology landscape. Trapped-ion systems already combine different species of ions, using one type for memory and another for logic, while superconducting processors have been coupled to spin defects in diamond and to atomic ensembles acting as quantum memories. The SHOQ concept would extend this modular philosophy to a liquid platform, connecting a microfluidic cell through microwave circuitry to conventional superconducting control electronics. The paper’s authors suggest that such interfaces, rather than any single monolithic technology, may ultimately define how large quantum computers are assembled.

Considerable uncertainty remains, as is inevitable for a purely theoretical design. Real devices must contend with damping of acoustic modes at their boundaries, thermal excitations that must be filtered out, and the practical difficulty of coupling a liquid oscillator strongly enough to microwave circuits to allow fast quantum gates. The prototype planned under the fellowship is intended to probe precisely these questions, and the coming experimental results will determine whether the elegant mathematics translates into working hardware.

Subject of Research: A conceptual superfluid helium-3 based qubit design for fault-tolerant quantum computing

Article Title: Superfluid-based qubit design could be key to scaling up quantum computers

Article References: Superfluid-based qubit design could be key to scaling up quantum computers. (n.d.). Original publication

Image Credits: AI Generated

DOI: Not provided

Keywords: superfluid helium, qubit, quantum computing, error rates, superconducting qubits, SHOQ device, quantum memory, hybrid quantum systems, npj Quantum Information, University of Surrey, helium-3, microfluidics