QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits

Tianlong Chen, Zhenyu Zhang, Hanrui Wang, Jiaqi Gu, Zirui Li, David Z. Pan, Frederic T. Chong, Song Han, Zhangyang Wang

In the current "Noisy Intermediate-Scale Quantum" (NISQ) era, quantum computers are a bit like early vacuum-tube computers: powerful in theory, but incredibly fragile and prone to errors. To get anything useful out of them, researchers use Parameterized Quantum Circuits (PQCs)—flexible frameworks that can be trained like neural networks. However, training these circuits on real hardware is a nightmare because more gates equal more noise and more "decoherence" (where qubits lose their quantum state before the calculation finishes).

A new paper from researchers at UT Austin, MIT, and other institutions introduces QuantumSEA, a framework that tackles this by embracing sparsity from the very beginning of training.

TL;DR

QuantumSEA is a training framework that dynamically explores sparse circuit architectures to overcome the noise and decoherence limits of today’s quantum hardware. By maintaining a fixed, small number of quantum gates and "growing" or "pruning" them throughout training, it achieves higher accuracy and up to a 2x speedup over traditional dense circuits.

What Problem Does This Paper Address?

The "Holy Grail" of quantum computing is achieving a quantum advantage—solving problems classical computers can't. This usually requires large circuits with many gates. Unfortunately, we face two major "pain points":

  1. Decoherence: Qubits have a "lifetime." If your circuit is too deep (too many gates), the qubits "die" before you get an answer.
  2. Gate Noise: Every gate you add introduces a small amount of error. In a dense circuit, these errors accumulate until the output is just random noise.

Existing solutions like Neural Architecture Search (NAS) or pruning often start with a "dense" (large) circuit and slim it down. But if the dense circuit is too noisy to train on real hardware in the first place, you're stuck. QuantumSEA asks: What if we start sparse and stay sparse, but move the gates around until we find the best configuration?

Methods

The core innovation is In-Time Sparse Exploration. Instead of the standard "Dense $\rightarrow$ Sparse" pipeline, QuantumSEA uses a "Sparse $\rightarrow$ Sparse" approach.

  1. Initialization: Start with a randomly sparsified circuit (e.g., only 50% of possible gates are active).
  2. Weight Optimization: Train the parameters of these active gates using the "parameter shift rule" (a way to get gradients on real quantum hardware).
  3. Topology Exploration (The "Prune-and-Grow" Cycle):
    • Pruning: Periodically remove the least important gates based on Salience (a measure of how much a gate's weight and gradient contribute to the loss).
  4. Growing: Add new gates in promising locations. Since you can't get gradients for gates that aren't there, the authors use a Historical Gradient Accumulator. This keeps a "memory" of which gate locations were effective in the past.
  5. Implicit Capacity: By shifting gates around during training, the circuit effectively "explores" a much larger architectural space than its physical gate count would suggest.

Datasets

The authors evaluated QuantumSEA across a wide range of benchmarks:

  • Quantum Machine Learning (QML): Image recognition tasks using MNIST (2-class and 4-class) and Fashion-MNIST, as well as the Vowel-4 dataset.
  • Variational Quantum Eigensolver (VQE): Estimating the ground-state energy of molecules ($H_2$ and $H_2O$), a key application for quantum chemistry.
  • Hardware: Experiments were run on 6 real IBM Quantum (IBMQ) machines (Santiago, Quito, Bogota, Lima, Belem, and Manila) and various noise-aware simulators.

Key Insights and Ideas

  • The "Aha" Moment on Sparsity: In classical AI, sparsity is usually about saving memory. In quantum, sparsity is a survival strategy. By using fewer gates, QuantumSEA reduces the "noise floor," allowing the signal of the training to actually emerge.
  • Implicit Capacity: This is the most surprising finding. Even though the circuit is sparse at any single moment, the dynamic exploration allows it to behave as if it has the representational power of a much larger circuit. It’s like a small team of experts who can swap roles as needed, rather than a massive, unmanageable bureaucracy.
  • Delaying the Accuracy Peak: In noisy quantum circuits, there is usually a "sweet spot" for the number of parameters; add too many, and noise destroys your accuracy. QuantumSEA shifts this peak, allowing for more complex learning without the typical noise penalty.

Key Results

  • Superior Accuracy: On the MNIST-2 task, QuantumSEA outperformed noise-aware search (QuantumNAS) and human-designed circuits by 1.33% to 5.32%.
  • Massive Efficiency Gains: The method achieved a ~2x saving in execution time compared to dense counterparts, which is critical when quantum cloud credits are expensive and coherence times are short.
  • On-Chip Success: In the challenging "on-chip training" regime (training directly on real hardware rather than a simulator), QuantumSEA established new state-of-the-art results with only half the number of gates of standard baselines.

Limitations and Future Work

  • Gate vs. Qubit Sparsity: Currently, the framework only prunes gates. The authors note that future work could explore "qubit sparsity"—dynamically choosing which qubits to use to avoid those with the highest error rates.
  • Depth Constraints: While sparsity helps, the current algorithm doesn't explicitly optimize for the depth of the circuit (how many gates are stacked vertically), which is the primary driver of decoherence.
  • Scaling to "Advantage": To truly beat classical computers, we need circuits with 50+ qubits. While QuantumSEA is a step in the right direction, scaling to that level will likely require combining this method with more advanced error-correction techniques.

Summary updated

Abstract

Parameterized Quantum Circuits (PQC) have obtained increasing popularity thanks to their great potential for near-term Noisy Intermediate-Scale Quantum (NISQ) computers. Achieving quantum advantages usually requires a large number of qubits and quantum circuits with enough capacity. However, limited coherence time and massive quantum noises severely constrain the size of quantum circuits that can be executed reliably on real machines. To address these two pain points, we propose QuantumSEA, an in-time sparse exploration for noise-adaptive quantum circuits, aiming to achieve two key objectives: (1) implicit circuits capacity during training - by dynamically exploring the circuit's sparse connectivity and sticking a fixed small number of quantum gates throughout the training which satisfies the coherence time and enjoy light noises, enabling feasible executions on real quantum devices; (2) noise robustness - by jointly optimizing the topology and parameters of quantum circuits under real device noise models. In each update step of sparsity, we leverage the moving average of historical gradients to grow necessary gates and utilize salience-based pruning to eliminate insignificant gates. Extensive experiments are conducted with 7 Quantum Machine Learning (QML) and Variational Quantum Eigensolver (VQE) benchmarks on 6 simulated or real quantum computers, where QuantumSEA consistently surpasses noise-aware search, human-designed, and randomly generated quantum circuit baselines by a clear performance margin. For example, even in the most challenging on-chip training regime, our method establishes state-of-the-art results with only half the number of quantum gates and ~2x time saving of circuit executions. Codes are available at https://github.com/VITA-Group/QuantumSEA.
BibTeX
@inproceedings{chen2023quantumsea,
  author = {Tianlong Chen and Zhenyu Zhang and Hanrui Wang and Jiaqi Gu and Zirui Li and David Z. Pan and Frederic T. Chong and Song Han and Zhangyang Wang},
  title = {{QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits}},
  booktitle = {QCE},
  year = {2023},
  doi = {10.1109/qce57702.2023.00015},
}
Figure