Expressibility and trainability of a two-dimensional pairwise quantum-circuit ansatz
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 p...
Description / Details
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 and , 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--string expectation value with respect to the first angle. For this Pauli- string and fixed parameter, the gradient variance is smaller for the 2D circuit at --. The differences narrow at , and the four ansatze yield statistically compatible variances at .
Source: arXiv:2607.12996v1 - http://arxiv.org/abs/2607.12996v1 PDF: https://arxiv.org/pdf/2607.12996v1 Original Link: http://arxiv.org/abs/2607.12996v1
Please sign in to join the discussion.
No comments yet. Be the first to share your thoughts!
Jul 15, 2026
Quantum Computing
Quantum Physics
0