⚛️ quantum physics

Digital-Analog Counterdiabatic Quantum Optimization with Trapped Ions

This paper proposes a hardware-specific digital-analog counterdiabatic quantum optimization algorithm tailored for trapped-ion architectures that leverages global Mølmer-Sørensen gates to significantly reduce circuit depth and enable the solution of larger optimization problems, such as the maximum independent set, while maintaining coherence within current device limitations.

Original authors: Shubham Kumar, Narendra N. Hegade, Alejandro Gomez Cadavid, Murilo Henrique de Oliveira, Enrique Solano, F. Albarrán-Arriagada

Published 2026-07-10

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Shubham Kumar, Narendra N. Hegade, Alejandro Gomez Cadavid, Murilo Henrique de Oliveira, Enrique Solano, F. Albarrán-Arriagada

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you're trying to solve a massive, tangled knot of string. In the world of quantum computing, this "knot" is a complex optimization problem, like figuring out the best way to arrange a city's traffic lights or finding the perfect route for a delivery truck. Usually, to untangle this knot, a quantum computer has to pull on the string one tiny loop at a time. This is the "purely digital" approach. It's precise, but it's also incredibly slow and fragile. If the computer gets distracted by noise (like a sneeze in a library) before it finishes pulling every single loop, the whole knot snaps back into a mess.

The paper by Shubham Kumar and his team introduces a clever new way to untangle these knots: Digital-Analog Counterdiabatic Quantum Optimization (DACQO). Think of it as upgrading from using just your fingers (digital gates) to using a whole pair of hands and a specialized tool (analog blocks) all at once.

The Magic Tool: The "Global" Grip

The researchers are working with trapped ions, which are basically tiny, floating atoms held in place by invisible electric fields. These atoms are the "qubits" (the quantum bits) that do the math.

In a standard digital approach, you have to grab two atoms at a time, twist them, let go, grab the next two, and so on. It's like trying to organize a room by moving one sock, then one shoe, then one sock again. It takes forever.

The authors suggest using a "Global Mølmer-Sørensen (GMS) gate." Imagine instead of moving socks one by one, you have a magical vacuum cleaner that can suck up all the socks in the room at once and arrange them in a specific pattern instantly. This is the "analog" part. It's a single, powerful operation that entangles (links) many atoms simultaneously.

However, this magic vacuum cleaner isn't perfect. It might leave a few socks slightly out of place or create a weird "parasitic" pattern. That's where the "digital" part comes in. The algorithm uses the big, fast analog move to do the heavy lifting, and then uses a few quick, precise digital "tweaks" (like a single-qubit rotation) to fix the little mistakes. It's a hybrid team-up: the analog block does the heavy lifting, and the digital steps do the fine-tuning.

The "Shortcut" Trick

The paper also uses a technique called Counterdiabatic (CD) driving. Imagine you're pushing a heavy swing. If you push it slowly and gently, it eventually goes high, but it takes a long time. If you try to push it too fast, it might wobble and fall over.

The "counterdiabatic" trick is like knowing exactly how hard to push at every single moment to get the swing to the top fast without it wobbling. The authors add a special "anti-wobble" force to their quantum algorithm. This allows them to solve the problem much faster than the slow, careful "adiabatic" method, which is crucial because quantum computers lose their "coherence" (their ability to stay in the game) very quickly.

The Results: Faster and Bigger

The team tested this idea using computer simulations (specifically, a "noisy emulator" that mimics real hardware). Here is what they found:

Speed: By using this hybrid method, they can solve problems with up to 55 qubits within the time limit that current trapped-ion computers can stay coherent. If they stuck to the old, purely digital way, they would only be able to handle about 20 qubits before the noise ruined the calculation.
Time Savings: For a specific problem called the "Maximum Independent Set" (which is like finding the biggest group of people at a party who don't know each other), their method ran about 2 times faster (a 2X reduction in runtime) than the purely digital version.
The "Good Enough" Threshold: One of the most exciting findings is about how perfect the analog tool needs to be. The authors found that to beat the purely digital method, the analog block (the GMS gate) only needs to be about 94% accurate (or have a fidelity of 94%). For larger problems (up to 20 qubits), they suggest a fidelity between 98% and 99% is enough to win. This is great news because it means we don't need to build perfect, error-free machines to see an advantage; we just need "good enough" ones that are already available or close to it.

What They Don't Claim

It's important to note what this paper doesn't say. The authors are very careful to state that their results are based on simulations and noisy emulators, not a physical experiment on a real quantum computer solving a real-world problem yet. They explicitly argue against the idea that we must wait for perfect, error-free hardware to do useful work. They also note that if a problem is extremely messy (highly "inhomogeneous" or non-uniform), using a giant analog block might actually make things slower, so sometimes a smaller, simpler block is better.

The Future

The paper suggests that if we can build even better "programmable" analog blocks that can grab non-neighboring atoms (not just the ones sitting right next to each other), we could solve even bigger problems, potentially up to 52 qubits or more, with even greater speed.

In short, this paper proposes a "hybrid" strategy: use the brute force of a big, fast analog tool to do the heavy work, and a few precise digital steps to clean up the mess. This approach suggests we can solve bigger, more complex optimization problems on today's imperfect quantum computers, rather than waiting for a perfect machine that might not exist for a long time. It's a path to getting a "quantum advantage" right now, by working with the hardware's strengths and weaknesses, rather than fighting against them.

Technical Summary: Digital-Analog Counterdiabatic Quantum Optimization with Trapped Ions

Problem Statement
The paper addresses the challenge of solving Quadratic Unconstrained Binary Optimization (QUBO) problems on current Noisy Intermediate-Scale Quantum (NISQ) devices, specifically trapped-ion processors. While digitized counterdiabatic quantum computing (DCQC) offers polynomial scaling enhancements over conventional adiabatic methods, purely digital implementations require substantial circuit depths. This depth exceeds the coherence times of current hardware, limiting the size of solvable problems. The authors identify the need for a hybrid approach that leverages the all-to-all connectivity and multi-qubit capabilities of trapped ions to reduce circuit depth without sacrificing the flexibility required for optimization tasks.

Methodology
The authors propose a Digital-Analog Counterdiabatic Quantum Optimization (DACQO) algorithm tailored for trapped-ion architectures. The core methodology involves:

Hamiltonian Formulation: The target QUBO problem is encoded in the ground state of a Hamiltonian $H_f$ . To accelerate the evolution to this ground state, the algorithm employs counterdiabatic (CD) driving terms derived from the nested commutator expansion of the adiabatic gauge potential (AGP). The first-order approximation of the AGP introduces local and bilocal terms involving Pauli operators ( $\sigma_x, \sigma_y, \sigma_z$ ).
Analog Blocks (GMS Gates): Instead of decomposing all interactions into single- and two-qubit gates, the algorithm utilizes Global Mølmer-Sørensen (GMS) gates as analog blocks. These gates can generate simultaneous many-body interactions (2-local and effective n-local terms) across a subset of ions using a uniform field. The specific GMS gate is defined as $U_{MS}^k(\theta, \phi) = \exp[-i\frac{\theta}{4}(\cos\phi S_x + \sin\phi S_y)^2]$ .
Hybrid Encoding: The continuous-time evolution governed by the CD Hamiltonian is digitized using a Trotterization scheme. The "analog" layers consist of GMS gates that implement the multi-qubit interaction terms directly. These are interleaved with "digital" layers comprising single-qubit rotations to correct phases, eliminate parasitic terms (e.g., unwanted $\sigma_y\sigma_y$ terms), and introduce inhomogeneity (varying coupling strengths $J_{ij}$ ) where necessary.
Algorithmic Structure:
- Homogeneous Case: For uniform coupling, the algorithm uses 4-qubit GMS blocks to entangle nearest-neighbor ions, followed by conjugate gates to remove parasitic terms and single-qubit rotations.
- Inhomogeneous Case: For non-uniform coupling, the algorithm introduces local rotations to modulate the interaction strengths. This requires a systematic replacement of analog blocks with $k(k-1)/2$ blocks supplemented by local rotations, increasing circuit depth but maintaining the hybrid advantage.

Key Contributions

Hardware-Specific Protocol: The paper introduces a DAQC protocol specifically designed for trapped-ion processors, exploiting the native GMS gate capabilities to implement high-order CD terms efficiently.
Circuit Depth Reduction: By utilizing analog blocks for multi-qubit entanglement, the authors demonstrate a significant reduction in circuit depth compared to purely digital approaches. This allows the algorithm to target larger problem instances (requiring more qubits) within the coherence time limits of current devices.
Fidelity Threshold Analysis: The study calculates the minimum gate fidelity required for the analog blocks to outperform purely digital simulations. It finds that for systems up to 20 qubits, analog block fidelities in the 98%–99% range are sufficient to surpass digital performance, and 99%–99.5% is required to meet minimum accuracy benchmarks. These thresholds are reported to be within the capabilities of state-of-the-art hardware.
Scalability Projections: The authors project that with current technology, the DACQO approach can solve optimization problems involving up to 55 qubits within coherence time, whereas a purely digital approach would require extending coherence time significantly (e.g., from ~1.8s to ~2.8s for 100 qubits).

Results

Success Probability: Simulations on a 4-qubit homogeneous Ising model show that the DACQO algorithm surpasses purely digital simulation performance when the analog block fidelity exceeds approximately 94%.
Scalability: Analysis of the Maximum Independent Set (MIS) problem on 16-node graphs demonstrates that the hybrid approach reduces circuit runtime by a factor of approximately 1.6x to 2x compared to digital simulations.
- For non-weighted and mixed-weight graphs, increasing the analog block size further reduces runtime.
- For fully non-uniform (inhomogeneous) graphs, the optimal reduction is achieved with smaller (2-qubit) analog blocks, as larger blocks incur a depth penalty due to the overhead of introducing inhomogeneity.
Runtime Efficiency: For a 100-qubit problem, the DACQO approach requires a coherence time of approximately 1.8 seconds, representing a 55% reduction compared to the ~2.8 seconds required by the purely digital method.

Significance and Claims
The paper claims that the DACQO paradigm provides a viable pathway to quantum advantage for optimization problems on current NISQ hardware. By co-designing the algorithm with the specific capabilities of trapped-ion processors (specifically GMS gates), the method enables the solution of larger problem instances (≥20 qubits) that would otherwise be inaccessible due to decoherence.

The authors emphasize that this approach relaxes the stringent requirement for engineering extremely high-fidelity 2-qubit gates, suggesting that focusing on analog gates with "reasonable" fidelity (98%–99.5%), supplemented by digital gates, is a more practical route to scaling. Furthermore, the paper notes that future advancements in programmable, inhomogeneous analog blocks (such as fast XX gates) could further improve scaling for non-homogeneous problems and approach the quantum speed limit. The work positions digital-analog encoding as a critical step toward solving industry-relevant combinatorial optimization problems.