- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper proposes LieQAS, a differentiable QAS framework that instead parameterizes the searched unitary directly in continuous Lie-algebraic coordinates using Pauli strings. Gradients are taken directly with respect to these Pauli-string coefficients, while the architecture is defined by the active Pauli-string support and updated through progressive pruning. The authors further introduce hardware-cost-aware regularization and non-commutativity-aware search with singleton finalization, so that the finalized architecture admits exact direct extraction. Experiments on molecular VQE benchmarks show that LieQAS achieves chemical accuracy on all four VQE instances while reducing compiled gate count by up to 64% relative to QuantumDARTS, with lower circuit depth and no more CX gates. On MNIST 0/1 classification, LieQAS reduces CX count by up to 89% while maintaining competitive mean accuracy.
Critical strengths
-
LieQAS parameterizes the searched unitary directly in Lie-algebraic coordinates and defines the architecture by the active Pauli-string support, instead of using Monte Carlo or Gumbel-Softmax sampling.
-
Each layer is unitary by the Lie-algebraic architecture construction.
-
A progressive search approach is designed to tackle the non-commutativity of Pauli strings.
Critical weaknesses
-
The authors admit that "The resulting compact circuits therefore do not imply lower classical search cost". The searching cost of LieQAS is higher than existing methods, e.g., QuantumDARTS.
-
The scope is smaller than traditional QAS: layers L is a fixed input in Algorithm 1 while all-to-all connectivity is assumed. Baselines do not contain HEA.
-
The paper evaluates three independent seeds and report the minimum-depth finalized architecture among the runs that reach chemical accuracy in Appendix F. Maybe robustness study is needed for a better understanding of the method.
Questions for authors
See Weaknesses
3 comments
Response Part2
HEA comparison. We additionally compare LieQAS with an HEA, comprising complete layers of independently parameterized and rotations alternating with full ring-CX entangling layers. Since complete HEA layers have discrete resource increments, the resulting budgets are not exactly matched.
We perform two-sided Welch’s -tests across the four encodings and report the p-values. Across most configurations, LieQAS has comparable accuracy with HEA. The low accuracy of HEA on AE-angle appears related to the limited flexibility in combining features under this particular shallow topology, while LieQAS successfully discover suitable circuits.
The resource comparison also reveals a trade-off between the two architectures. HEA achieves a lower compiled depth, whereas LieQAS uses fewer gates. This is consistent with their different design objectives: HEA prioritizes shallow hardware-compatible topologies, while LieQAS emphasizes accuracy and Pauli-weight-dependent resource costs.
| Encoding | Method | Acc. (%) | Gates | CX | Depth | P |
|---|---|---|---|---|---|---|
| PCA-angle | HEA | 40.0 | 8.0 | 12.0 | 0.2925 | |
| LieQAS | 16.8 | 2.0 | 15.4 | |||
| PCA-dense | HEA | 40.0 | 8.0 | 12.0 | 0.0851 | |
| LieQAS | 20.0 | 2.0 | 16.0 | |||
| AE-angle | HEA | 40.0 | 8.0 | 12.0 | 0.000020 | |
| LieQAS | 25.2 | 6.4 | 20.6 | |||
| AE-dense | HEA | 40.0 | 8.0 | 12.0 | 0.0910 | |
| LieQAS | 25.2 | 6.0 | 18.2 |
3. Search robustness and seed variability
To assess robustness directly, we show our evaluation with three seeds for each molecule. Across the four molecules, LieQAS achieves chemical accuracy in 7/12 runs, tying QuantumDARTS for the highest aggregate success count, compared with 6/12 for DQAS and 5/12 for DARTS. Moreover, the selected feasible LieQAS circuits generally require fewer compiled resources.
| Molecule | Method | ΔE | Success | 1Q | CX | Gates | Depth |
|---|---|---|---|---|---|---|---|
| H₂-4q | LieQAS | 3/3 | |||||
| QuantumDARTS | 1/3 | ||||||
| DQAS | 3/3 | ||||||
| RhoDARTS | 2/3 | ||||||
| LiH-4q | LieQAS | 2/3 | |||||
| QuantumDARTS | 3/3 | ||||||
| DQAS | 3/3 | ||||||
| RhoDARTS | 3/3 | ||||||
| LiH-6q | LieQAS | 1/3 | |||||
| QuantumDARTS | 1/3 | ||||||
| DQAS | 0/3 | — | — | — | — | ||
| RhoDARTS | 0/3 | — | — | — | — | ||
| H₂O-8q | LieQAS | 1/3 | |||||
| QuantumDARTS | 2/3 | ||||||
| DQAS | 0/3 | — | — | — | — | ||
| RhoDARTS | 0/3 | — | — | — | — |
I thank the authors for the detailed response. I will keep my score to accept the paper.
Response Part1
We thank the reviewer for identifying three important aspects that require further clarification: classical search cost, search-space scope and hardware connectivity, and search robustness. We address these concerns separately below.
LieQAS incurs higher measured runtime and peak GPU memory than QuantumDARTS on the evaluated benchmark. The measured runtime of LieQAS is primarily determined by dense matrix-exponential simulation and the dense-to-sparse search trajectory. These results characterize the computational cost across the evaluated benchmark groups.
2. Search-space scope, restricted connectivity, and the HEA baseline.
Initial search capacity and search-space scope. The initial layer count L is a user-specified capacity. Within this capacity, LieQAS searches the active Pauli string support through progressive pruning. The framework does not currently grow the architecture beyond the initial capacity. We clarify this scope in the revision.
We further evaluate the effect of initial capacity with G=10 on the 8-qubit Fashion-MNIST 3/6 task. Results show that increasing initial capacity raises runtime and memory without a sustained improvement in accuracy. These results support using a moderate initial capacity.
Hardware connectivity. The Pauli candidate pool used in the current search assumes all-to-all connectivity. To examine the impact of restricted hardware connectivity, we additionally compile the searched circuits onto three connectivity graphs: all-to-all, nearest-neighbor linear chain, and the IBM Brisbane heavy-hex coupling graph, with bidirectional connectivity.
The recompiled resources are shown below and each entry reports Gates/Depth/CX. The results show that LieQAS generally retains its gate-count and CX-count advantages over the QAS baselines. These experiments evaluate post-search compilation under different connectivity constraints. The current LieQAS is not yet explicitly constrained by the target hardware topology. We clarify this scope in the revised manuscript and identify connectivity-aware candidate generation as a future extension.