Variational Learning with Sparse Long-range Entangling Gates

• URL: http://arxiv.org/abs/2607.07547v1
• Date: Wed, 08 Jul 2026 15:45:05 GMT
• Title: Variational Learning with Sparse Long-range Entangling Gates
• Abstract summary: Performance of variational quantum algorithms depends on the structure of the parametrized quantum circuit.<n>We examine when structured long-range connectivity provides a useful resource, focusing on sparse power-of-two (PWR2) coupling graphs.<n>We introduce a variational scheme that maps hierarchical long-range Hamiltonians to geometrically local ones that can be optimized with short-range circuits.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The performance of variational quantum algorithms depends in general on the structure of the parametrized quantum circuit, but the most common ansätze are typically based on local couplings. Motivated by the extended connectivity available with neutral atoms and trapped ions, we examine when structured long-range connectivity provides a useful resource, focusing on sparse power-of-two (PWR2) coupling graphs. Using dynamical Lie-algebra analysis, approximate unitary-design diagnostics, and finite-depth measures of expressibility and entanglement, we examine how these geometries enlarge the accessible operator space. This enlarged space alone is not sufficient to ensure trainability of the parameterized circuit for given target problems, and we explore performance across example problems with and without long-range coupling, identifying where sparse coupling graphs are or are not likely to provide an advantage. We also introduce a variational scheme that maps hierarchical long-range Hamiltonians to geometrically local ones that can be optimized with short-range circuits. Together, these results identify circuit geometry and qubit reconfigurability as task-dependent resources for variational algorithms, relevant to ongoing developments in quantum hardware with long-range connectivity.

Related papers

• Quantum Dynamic Time Warping for Multivariate Time Series Classification [41.99844472131922]
  We propose a hybrid Quantum Dynamic Time Warping architecture, replacing the classical distance metric with the parameterized geometry of a quantum Hilbert space.<n>We demonstrate this architecture allows untrained quantum kernels to act as highly expressive baselines, while parameterized training effectively untangles deeply overlapping hyper-dimensional data.
  arXiv  Detail & Related papers  (2026-06-26T07:58:37Z)
• Continuum field theory of matchgate tensor network ensembles [36.94429692322632]
  We develop a continuum description for random ensembles of two-dimensional fermionic matchgate tensor networks.<n>As a diagnostic of the resulting universal physics, we analyze disorder-averaged moments of fermionic two-point functions.<n>We show that disorder drives universal long-distance behavior governed by a nonlinear sigma-model of symmetry class D with a topological term.
  arXiv  Detail & Related papers  (2026-03-06T12:15:35Z)
• Metasurface-Based Dual-Basis Polarization Beam Splitter for efficient entanglement witnessing [0.0]
  Entanglement witnessing is essential for quantum technologies such as computing, key distribution, and networking.<n>We propose a metasurface-based analyzer that performs dual-basis projections simultaneously by mapping them to spatial modes.<n>The proposed scheme provides a path toward efficient entanglement verification with applications in quantum key distribution, quantum repeaters, and scalable quantum networks.
  arXiv  Detail & Related papers  (2025-10-04T20:23:25Z)
• Reinforcement Learning for Quantum Network Control with Application-Driven Objectives [53.03367590211247]
  Dynamic programming and reinforcement learning offer promising tools for optimizing control strategies.<n>We propose a novel RL framework that directly optimize non-linear, differentiable objective functions.<n>Our work comprises the first step towards non-linear objective function optimization in quantum networks with RL, opening a path towards more advanced use cases.
  arXiv  Detail & Related papers  (2025-09-12T18:41:10Z)
• Implementing a Universal Set of Geometric Quantum Gates through Dressed-State assisted STA [39.27725073249277]
  We analyze the implementation of single-qubit gates in a two-level system driven by a microwave field.<n>We show how the dynamical phase can be canceled to obtain purely geometric operations.<n>We extend the protocol to construct non two-qubit gates, highlighting its feasibility for scalable quantum information processing.
  arXiv  Detail & Related papers  (2025-09-10T16:14:34Z)
• QAMA: Scalable Quantum Annealing Multi-Head Attention Operator for Deep Learning [48.12231190677108]
  Quantum Annealing Multi-Head Attention (QAMA) is proposed, a novel drop-in operator that reformulates attention as an energy-based Hamiltonian optimization problem.<n>In this framework, token interactions are encoded into binary quadratic terms, and quantum annealing is employed to search for low-energy configurations.<n> Empirically, evaluation on both natural language and vision benchmarks shows that, across tasks, accuracy deviates by at most 2.7 points from standard multi-head attention.
  arXiv  Detail & Related papers  (2025-04-15T11:29:09Z)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.<n>We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.<n>We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• Onset of scrambling as a dynamical transition in tunable-range quantum circuits [0.0]
  We identify a dynamical transition marking the onset of scrambling in quantum circuits with different levels of long-range connectivity. We show that as a function of the interaction range for circuits of different structures, the tripartite mutual information exhibits a scaling collapse. In addition to systems with conventional power-law interactions, we identify the same phenomenon in deterministic, sparse circuits.
  arXiv  Detail & Related papers  (2023-04-19T17:37:10Z)
• Accurate methods for the analysis of strong-drive effects in parametric gates [94.70553167084388]
  We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach. We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
  arXiv  Detail & Related papers  (2021-07-06T02:02:54Z)
• Optimized Low-Depth Quantum Circuits for Molecular Electronic Structure using a Separable Pair Approximation [0.0]
  We present a classically solvable model that leads to optimized low-depth quantum circuits leveraging separable pair approximations. The obtained circuits are well suited as a baseline circuit for emerging quantum hardware and can, in the long term, provide significantly improved initial states for quantum algorithms.
  arXiv  Detail & Related papers  (2021-05-09T05:10:59Z)
• Entanglement Diagnostics for Efficient Quantum Computation [0.5482532589225552]
  We construct entanglement diagnostics for efficient quantum/classical hybrid computations. We identify the high-performance region for solving optimization problems encoded in the cost function of k-local Hamiltonians.
  arXiv  Detail & Related papers  (2021-02-24T20:00:42Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• High-fidelity and Robust Geometric Quantum Gates that Outperform Dynamical Ones [5.781900408390438]
  We propose a general framework of geometric quantum computation with the integration of the time-optimal control technique. Our scheme provides a promising alternative way towards scalable fault-tolerant solid-state quantum computation.
  arXiv  Detail & Related papers  (2020-01-16T13:28:10Z)

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.