Skip to content
Preprint

Expressibility and trainability of a two-dimensional pairwise quantum-circuit ansatz

Jul 2026 · 0 citations
Physics

TL;DR

This work constructs a native 2D pairwise ansatz and compares its expressibility and trainability with representative 1D ansatze at identical layer depths, despite their different circuit depths.

Abstract

Parameterized quantum circuits~(PQCs) constitute a central building block of variational quantum algorithms~(VQAs) and quantum machine learning~(QML) methods. Existing ansatz designs often adopt hardware-agnostic or simplified 1D chain/ring entanglement patterns. However, as quantum hardware continues to develop, native 2D connectivity patterns, such as planar superconducting-qubit architectures, are becoming increasingly important. Inspired by this hardware structure, we construct a native 2D pairwise ansatz and compare its expressibility and trainability with representative 1D ansatze at identical layer depths, despite their different circuit depths. For the fixed 16-qubit system, the 2D ansatz has the smallest KL divergence at $L=1$ and $2$, and its second-order frame potential approaches the theoretical lower bound more rapidly at shallow layer counts than the frame potentials of the three 1D ansatze. We also evaluate the gradient variance of the Pauli-$Z$-string expectation value $\langle Z_0\otimes\cdots\otimes Z_{15}\rangle$ with respect to the first $R_y$ angle. For this Pauli-$Z$ string and fixed parameter, the gradient variance is smaller for the 2D circuit at $L=1$--$4$. The differences narrow at $L=5$, and the four ansatze yield statistically compatible variances at $L=6$.

View source

Similar papers

Preprint Jul 2026

Scalable Quantum Machine Learning: Trainability, Expressivity and Efficiency

The unitary brick-wall is proposed: a $k-particle fermionic architecture for nearest-neighbor hardware, combining Reconfigurable Beam Splitter gates with interleaved single-qubit phase gates and a non-Gaussian magic-state encoding.

Iordanis Kerenidis · 2 citations · ⚡1
Preprint Aug 2026

Sampling isometric tensor network states with monitored quantum circuits

Projected entangled pair states (PEPS) provide an efficient variational ansatz for two-dimensional quantum phases, but computing observables remains challenging because PEPS contraction is generally costly. Here, we parameterize two-dimensional quantum states using variational PEPS subject to isometric constraints and...

Yu-Qing Rong, Huanhai Zhou, Guo-Yi Zhu et al. · 0 citations
Preprint Jul 2026

Variational Learning with Sparse Long-range Entangling Gates

This work examines when structured long-range connectivity provides a useful resource, focusing on sparse power-of-two (PWR2) coupling graphs, and identifies circuit geometry and qubit reconfigurability as task-dependent resources for variational algorithms.

Helene M. Losl, Aydin Deger, Andrew J. Daley · 0 citations
Preprint Aug 2026

Predicting Multipartite Entanglement in Quantum Circuits using Transformer

A graph-based transformer surrogate that predicts both the first-order Meyer-Wallach measure and the second-order Scott measure is introduced, resolving entanglement structures indistinguishable under $Q_1$ alone, enabling efficient entanglement estimation for large-scale PQCs.

Darell Timothy Tarigan, Fadhil Fatih Shiddiq, H. L. Prihadi et al. · 0 citations
Preprint Aug 2026

Hamilton-Zero: A Neural Tensor-Network Foundation Model for Ground States of Arbitrary Quadratic Qubit Hamiltonians

It is demonstrated that this problem can be effectively amortized across an arbitrary and universal set of Hamiltonians by a foundation model with $\sim0.5$B variational parameters, trained with contemporary techniques from large language models and deep reinforcement learning.

Timothy Heightman, Elena Orlova, Philip Mantrov et al. · 1 citation · ⚡1
Jul 2026

Stacking the Deck: Tunable Trainability in Stacked LCUs

Variational quantum circuits have been central to many proposed near-term applications of quantum computing, but a growing body of evidence suggests that trainability and quantum advantage are fundamentally at odds: ans\"atze expressive enough to resist efficient classical simulation tend to exhibit barren plateaus, wh...

Nikhil Khatri, S. Zohren, G. Matos · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.