Rigetti: Qubit-Efficient Algorithm for Optimization

Rigetti Computing researchers have developed a new algorithm for combinatorial optimization that reduces the number of qubits required for quantum computation. Addressing a major hurdle in the field, the team’s approach maps potential solutions to an entangled wave function using fewer qubits, potentially allowing near-term quantum devices to tackle complex problems currently beyond their reach. This qubit-efficient method generalizes the quantum approximate optimization ansatz and demonstrates valuable properties when applied to Sherrington-Kirkpatrick spin-glass problems, offering performance guarantees for both intermediate-scale and future fault-tolerant quantum devices. The published research suggests this work could benefit near-term intermediate-scale and future fault-tolerant quantum devices, opening new avenues for practical quantum algorithms.\n\n

Qubit-Efficient Mapping for Combinatorial Optimization

\n\nResearchers at Rigetti Computing have developed a qubit-efficient algorithm designed to overcome the limitations imposed by the relatively small number of qubits available in current and near-future quantum computers. The core innovation lies in mapping potential solutions, candidate bit-strings, directly to entangled wave functions requiring fewer qubits, a departure from traditional methods. This technique centers on a generalized quantum approximate optimization ansatz, a variational quantum circuit that allows for the exploration of complex solution spaces. Extremizing this ansatz when applied to Sherrington-Kirkpatrick spin-glass problems revealed key characteristics, including the concentration of ansatz parameters, which underpins the performance guarantees of the method. The team’s work addresses a critical hurdle in quantum optimization: the ability to achieve meaningful results with limited hardware, broadening the scope of problems accessible to quantum computation even before fully scalable quantum computers become a reality.\n\n

Sherrington-Kirkpatrick Spin-Glass Ansatz Parameter Concentration

\n\nResearchers at Rigetti Computing are addressing a fundamental challenge in quantum optimization: efficiently representing complex problems with limited qubits. Their work focuses on the Sherrington-Kirkpatrick spin-glass, a notoriously difficult combinatorial optimization problem, and a novel approach to parameterizing quantum algorithms designed to solve it. A key finding centers on the “concentration of ansatz parameters,” meaning the algorithm’s internal settings converge predictably during optimization, potentially streamlining the search for solutions. The team states this parameter concentration offers performance guarantees and distinguishes their method from other variational quantum algorithms. The algorithm builds upon the quantum approximate optimization ansatz, generalizing it to create a more efficient circuit for mapping candidate solutions onto fewer qubits. The limited qubit count of current quantum computers is a major obstacle to competing against classical methods, and this qubit efficiency is achieved by encoding potential bit-string solutions into entangled wave functions, reducing the computational burden.\n\nThis development is particularly relevant for near-term quantum devices, both intermediate-scale and smaller fault-tolerant systems, as it offers a pathway to tackling complex problems with existing hardware. The research, published in Physical Review Applied on March 23, 2026, suggests a viable strategy for maximizing the utility of limited quantum resources in optimization tasks.\n\n

\n\nThe inherent limitation of the Noisy Intermediate-Scale Quantum (NISQ) era dictates that quantum algorithms must operate within constraints of limited connectivity and high noise rates. This qubit-efficient mapping strategy is crucial because it minimizes the required gate depth and overall circuit complexity. By projecting the solution space onto a maximally entangled subspace that utilizes only necessary auxiliary qubits, the method intrinsically reduces the hardware overhead associated with solving high-dimensional combinatorial spaces, thereby increasing the feasibility window for near-term hardware.\n\nThe Sherrington-Kirkpatrick model serves as a crucial benchmark because it models complex systems with quenched disorder, meaning the interactions (couplings) between variables are random and fixed, making analytical solutions intractable. Solving the spin-glass Hamiltonian effectively maps to solving Maximum Cut problems in a random graph, which are proven NP-hard. By tackling this specific, highly complex benchmark, the developed algorithm demonstrates its capability to generalize across multiple classes of computationally difficult optimization instances.\n\nMechanistically, the core efficiency gain stems from treating the variable set—the candidate bit-strings—not as independent encoding elements, but as components of a shared, multi-partite wave function. This resource-aware encoding mechanism bypasses the requirement for a one-to-one mapping between the solution size and the number of physically addressable quantum bits, a major departure from traditional Hamiltonian-to-qubit encodings.\n\nFurthermore, the optimization process itself leverages the properties derived from the concentration of the ansatz parameters. This predictable convergence suggests that the algorithm’s required variational parameters are highly stable and localized within the parameter manifold. This stability is key because it makes the resulting optimization landscape less sensitive to initial parameter guesses and the systemic noise inherent in current quantum processors, enhancing robustness and practical utility.