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

• URL: http://arxiv.org/abs/2607.12996v1
• Date: Tue, 14 Jul 2026 17:47:25 GMT
• Title: Expressibility and trainability of a two-dimensional pairwise quantum-circuit ansatz
• Abstract summary: We construct a native 2D pairwise ansatz and compare its expressibility and trainability with representative 1D ansatze.<n>For the fixed 16-qubit system, the 2D ansatz has the smallest KL divergence at $L=1$ and $2$.<n>We also evaluate the gradient variance of the Pauli-$Z$-string expectation value $langle Z_0otimescdotsotimes Z_15rangle$ with respect to the first $R_y$ angle.
• Score: 7.782344682771021
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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$.

Related papers

• Quantum Speedups for Stochastic Optimization with Heavy-Tailed Noise [49.730496294398726]
  We develop a novel quantum mean estimator for heavy-tailed random variables.<n>We derive stronger lower bounds for tail index>4/3$, showing that a nontrivial dependence on a dimension is unavoidable.<n>For a convex objective function, we propose a quantum projected gradient descent method.
  arXiv  Detail & Related papers  (2026-07-28T09:29:37Z)
• Scalable Quantum Machine Learning: Trainability, Expressivity and Efficiency [0.5076419064097732]
  We propose a unitary brick-wall: a $k$-particle fermionic architecture for nearest-neighbor hardware.<n>The brick-wall has dynamical Lie algebra $mathfraku(n)$ and directly parametrizes $U(n)$ via Givens rotations.<n>It achieves similar hardness guarantees at $8klog n$ evaluations per gradient step, the same factor $3n/(8k)$ reduction.
  arXiv  Detail & Related papers  (2026-07-27T05:23:32Z)
• Pseudoentanglement in constant depth: How trivial states can have non-trivial entanglement structure [52.51019642214249]
  We construct a family of 2D-local constant-depth quantum circuits whose entanglement entropy across a cut cannot be estimated in quantum time.<n>As constant-depth quantum circuits can be learned from specifiedly many quantum samples, our resulting pseudoentangled states are implicitly public-key and not pseudorandom.
  arXiv  Detail & Related papers  (2026-05-29T15:43:00Z)
• Wavelet Variance Equipartition as a Threshold for World-Model Quality and Quantum Kernel TN-Simulability [0.0]
  We identify the wavelet scaling exponent $$ as a critical diagnostic.<n>We establish $= 1/2$ as a sharp transition boundary for the classical simulability of amplitude-encoded quantum kernels.<n>We prove this variance scales strictly as $Var[X] = (d-2)$.
  arXiv  Detail & Related papers  (2026-05-12T05:41:12Z)
• Architecture Shape Governs QNN Trainability: Jacobian Null Space Growth and Parameter Efficiency [3.1094222618006664]
  We show that trainability varies substantially with architecture shape $(N,L)$ at fixed $E$.<n>We identify structural rank deficiency of the coefficient matching Jacobian $J$ as the mechanism responsible.
  arXiv  Detail & Related papers  (2026-05-07T09:52:45Z)
• Theta-term in Russian Doll Model: phase structure, quantum metric and BPS multifractality [45.88028371034407]
  We investigate the phase structure of the deterministic and disordered versions of the Russian Doll Model (RDM)<n>We find the pattern of phase transitions in the global charge $Q(theta,gamma)$, which arises from the BA equation.<n>We conjecture that the Hamiltonian of the RDM model describes the mixing in particular 2d-4d BPS sector of the Hilbert space.
  arXiv  Detail & Related papers  (2025-10-23T17:25:01Z)
• FFT-Accelerated Auxiliary Variable MCMC for Fermionic Lattice Models: A Determinant-Free Approach with $O(N\log N)$ Complexity [52.3171766248012]
  We introduce a Markov Chain Monte Carlo (MCMC) algorithm that dramatically accelerates the simulation of quantum many-body systems.<n>We validate our algorithm on benchmark quantum physics problems, accurately reproducing known theoretical results.<n>Our work provides a powerful tool for large-scale probabilistic inference and opens avenues for physics-inspired generative models.
  arXiv  Detail & Related papers  (2025-10-13T07:57:21Z)
• High-Entanglement Capabilities for Variational Quantum Algorithms: The Poisson Equation Case [0.07366405857677226]
  This research attempts to resolve problems by utilizing the IonQ Aria quantum computer capabilities. We propose a decomposition of the discretized equation matrix (DPEM) based on 2- or 3-qubit entanglement gates and is shown to have $O(1)$ terms with respect to system size. We also introduce the Globally-Entangling Ansatz which reduces the parameter space of the quantum ansatz while maintaining enough expressibility to find the solution.
  arXiv  Detail & Related papers  (2024-06-14T16:16:50Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Precision of quantum simulation of all-to-all coupling in a local architecture [0.0]
  We find an analytic relation between the values $J_ij$ of the desired interaction and the parameters of the 2d circuit. For the relative error to be a constant $epsilon$, one requires an energy scale growing as $n6$ in the number of qubits. Our proof is based on the Schrieffer-Wolff transformation and generalizes to any hardware.
  arXiv  Detail & Related papers  (2023-02-05T18:54:28Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits [0.755972004983746]
  Variational quantum algorithms (VQAs) optimize the parameters $vectheta$ of a parametrized quantum circuit. We prove two results, assuming $V(vectheta)$ is an alternating layered ansatz composed of blocks forming local 2-designs. We illustrate these ideas with large-scale simulations, up to 100 qubits, of a quantum autoencoder implementation.
  arXiv  Detail & Related papers  (2020-01-02T18:18:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.