From pulses to circuits and back again: A quantum control perspective on variational quantum algorithms.

Alicia Magann, Christian Arenz, Matthew Grace, Tak‐San Ho, Robert L. Kosut, Jarrod R. McClean, Herschel Rabitz, Mohan Sarovar2022 · DOI

This blog-style summary is based on the presentation "From pulses to circuits and back again: A quantum control perspective on variational quantum algorithms" by Alicia B. Magann and colleagues.

TL;DR

This work bridges the gap between low-level quantum pulse control and high-level variational quantum circuits. By viewing variational algorithms through the lens of control theory, the authors introduce a "Lyapunov-inspired" algorithm that sets circuit parameters constructively, bypassing the costly classical optimization loops that typically bottleneck near-term quantum computing.

What Problem Does This Paper Address?

Current Near-Intermediate Scale Quantum (NISQ) computing relies heavily on Variational Quantum Algorithms (VQAs) like the Quantum Approximate Optimization Algorithm (QAOA). These algorithms work by alternating between a quantum computer (which evaluates a cost function) and a classical computer (which tries to find better parameters to minimize that cost).

However, this hybrid approach has a major bottleneck: classical optimization is hard. Finding the optimal parameters $(\gamma, \beta)$ often requires a massive number of measurements on the quantum device and is prone to "barren plateaus" (where the optimizer gets lost in a flat landscape) or getting stuck in local minima. The authors ask: Can we use the physics of quantum control to skip the search and just "know" what the parameters should be?

Methods

The authors propose a framework that treats quantum circuits as a discretized version of continuous-time quantum control. Their primary contribution is a Lyapunov control-inspired algorithm for combinatorial optimization.

Instead of using a classical optimizer to "guess and check" parameters, they use a constructive protocol:

  1. Pulse-to-Circuit Mapping: They translate the Lyapunov control principle—which designs a control function to ensure a cost function strictly decreases over time—into a discrete circuit structure.
  2. Feedback-Based Parameter Setting: At each "layer" of the quantum circuit, the algorithm requires a specific measurement to estimate an observable $A_k$ (derived from the commutator of the problem and driver Hamiltonians).
  3. Constructive Update: The parameter for the next layer is set directly as $\beta_{k+1} = -A_k$. This ensures that, theoretically, the energy of the system decreases at every step without needing an external optimization loop.

Datasets

As this is a physics and algorithm design paper, traditional machine learning datasets were not used. Instead, the authors evaluated their algorithm using:

  • Numerical Simulations: To verify the Lyapunov descent principle.
  • Hardware Demonstration: A 3-qubit instance of the MaxCut problem (a standard benchmark for optimization) implemented on the ibmq_manila quantum processor.

Key Insights and Ideas

  • The Unified View: Quantum Optimal Control (QOC) and VQAs are essentially the same thing operating at different levels of abstraction. QOC works with continuous pulses and low-level physics, while VQAs work with discrete gates and abstract circuits.
  • Constructive vs. Search-Based: Most VQAs are "search-based" (looking for a needle in a haystack). This Lyapunov approach is "constructive"—it uses the current state of the quantum system as feedback to determine the optimal path forward.
  • Hierarchy of Abstractions: The authors suggest that "crossover" research between these fields can improve algorithm design, noise mitigation, and our understanding of optimization landscapes.

Key Results

  • Elimination of Classical Optimization: The case study successfully demonstrated a parameter-setting protocol that requires zero classical optimization iterations.
  • Hardware Validation: On the ibmq_manila processor, the algorithm showed a clear decrease in the cost function $\langle H_p \rangle$ over the first several layers.
  • Algorithmic Efficiency: By calculating parameters based on measurements rather than searching for them, the "outer loop" of the variational process is significantly streamlined.

Limitations and Future Work

  • Hardware Noise: In the hardware demonstration, the cost function began to rise after the fifth layer. This is a common limitation in NISQ devices, where gate errors and decoherence eventually accumulate and outweigh the algorithmic progress.
  • Measurement Overhead: While the algorithm skips classical optimization, it requires specific measurements ($A_k$) at each step. Future work will likely need to address how these measurements scale for much larger, many-qubit systems.
  • Broadening the Scope: The authors point toward applying these control-theoretic perspectives to other areas, such as designing new ansätze (circuit structures) and developing more robust noise mitigation strategies.

Summary updated

Abstract

Abstract not provided.
BibTeX
@misc{magann2022from,
  author = {Alicia Magann and Christian Arenz and Matthew Grace and Tak‐San Ho and Robert L. Kosut and Jarrod R. McClean and Herschel Rabitz and Mohan Sarovar},
  title = {{From pulses to circuits and back again: A quantum control perspective on variational quantum algorithms.}},
  year = {2022},
  doi = {10.2172/2001914},
}
Figure