Trainability of Parametrised Linear Combinations of Unitaries

• URL: http://arxiv.org/abs/2506.22310v1
• Date: Fri, 27 Jun 2025 15:20:00 GMT
• Title: Trainability of Parametrised Linear Combinations of Unitaries
• Abstract summary: We show that sums of trainable parametrised circuits are still trainable.<n>We argue that there is a scope for a quantum speed-up when evaluating these trainable circuits on a quantum device.
• Score: 4.2193475197905705
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A principal concern in the optimisation of parametrised quantum circuits is the presence of barren plateaus, which present fundamental challenges to the scalability of applications, such as variational algorithms and quantum machine learning models. Recent proposals for these methods have increasingly used the linear combination of unitaries (LCU) procedure as a core component. In this work, we prove that an LCU of trainable parametrised circuits is still trainable. We do so by analytically deriving the expression for the variance of the expectation when applying the LCU to a set of parametrised circuits, taking into account the postselection probability. These results extend to incoherent superpositions. We support our conclusions with numerical results on linear combinations of fermionic Gaussian unitaries (matchgate circuits). Our work shows that sums of trainable parametrised circuits are still trainable, and thus provides a method to construct new families of more expressive trainable circuits. We argue that there is a scope for a quantum speed-up when evaluating these trainable circuits on a quantum device.

Related papers

• The trainability of photonic quantum circuits [34.13373752364321]
  Variational quantum algorithms are a leading approach to near-term quantum computing, but their scalability can be limited by barren plateaus and the sampling cost of resolving small changes in the loss landscape.<n>Here, we study the trainability of passive linear-optical quantum circuits and introduce a framework based on the ratio of variance to circuit variance.<n>These results establish photonic variational quantum computing as a promising platform for near-term applications.
  arXiv  Detail & Related papers  (2026-07-23T17:31:09Z)
• How to find expressible and trainable parameterized quantum circuits? [0.22940141855172033]
  We propose a property-based ansatz-search framework for identifying circuits that combine trainability and expressibility.<n>We demonstrate its practical viability on a real quantum computer and apply it to variational quantum algorithms.
  arXiv  Detail & Related papers  (2026-03-15T15:54:30Z)
• Stochastic Shadow Descent: Training Parametrized Quantum Circuits with Shadows of Gradients [0.7793275969132055]
  We focus on the task of optimizing the parameters in Parametrized Quantum Circuits (PQCs)<n> popular algorithms, such as Simultaneous Perturbation Approximation (SPSA), limit the number of circuit-execution to two per iteration, irrespective of the number of parameters in the circuit, they have their own challenges.<n>We show, both theoretically and numerically, that this may lead to instabilities in emphtraining the PQCs.<n>We propose Shadow Descent (textttSSD), which uses random-projections to update the parameters iteratively.
  arXiv  Detail & Related papers  (2025-11-15T11:36:15Z)
• Simulation Framework for the Automated Search of Optimal Parameters Using Physically Relevant Metrics in Nonlinear Superconducting Quantum Circuits [36.03222474214894]
  We present JosephsonCircuitsr.jl (JCO), a simulation and optimization framework based on the JosephsonCircuits.jl library for Julia.<n>It models superconducting circuits that include Josephson junctions (JJs) and other nonlinear elements within a lumped-element approach.
  arXiv  Detail & Related papers  (2025-10-30T13:32:57Z)
• Neural Guided Sampling for Quantum Circuit Optimization [26.90377134346014]
  Translating a quantum circuit on a specific hardware topology with a reduced set of available gates, also known as transpilation, comes with a substantial increase in the length of the equivalent circuit.<n>One method to address efficient transpilation is based on approaches known from optimization, e.g. by using random sampling and token replacement strategies.<n>Here, we propose in this work 2D neural guided sampling. Thus, given a 2D representation of a quantum circuit, a neural network predicts groups of gates in the quantum circuit, which are likely reducible.
  arXiv  Detail & Related papers  (2025-10-14T12:09:05Z)
• Superposed Parameterised Quantum Circuits [0.0]
  We introduce superposed parameterised quantum circuits to overcome limitations of existing approaches.<n>A superposed parameterised quantum circuit embeds an exponential number of parameterised sub-models in a single circuit.<n>We show how multiple parameter sets are trained in parallel while non-linear transformations broaden power beyond conventional quantum kernels.
  arXiv  Detail & Related papers  (2025-06-10T12:44:11Z)
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions [39.58317527488534]
  We propose a variational strategy based on symmetry-preserving cost functions to iteratively construct a reduced subspace for extraction of low-lying energy states.<n>As a proof of concept, we test the proposed algorithms on H4 chain and ring, targeting both the ground-state energy and the charge gap.
  arXiv  Detail & Related papers  (2024-11-25T20:33:47Z)
• Exact gradients for linear optics with single photons [38.74529485263391]
  We derive an analytical formula for the gradients in quantum circuits with respect to phaseshifters via a generalized parameter shift rule.<n>We propose two strategies through which one can reduce the number of shifts in the expression, and hence reduce the overall sample complexity.<n> Numerically, we show that this generalized parameter-shift rule can converge to the minimum of a cost function with fewer parameter update steps than alternative techniques.
  arXiv  Detail & Related papers  (2024-09-24T18:02:06Z)
• 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)
• A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits [37.84307089310829]
  Variational quantum computing schemes train a loss function by sending an initial state through a parametrized quantum circuit. Despite their promise, the trainability of these algorithms is hindered by barren plateaus. We present a general Lie algebra that provides an exact expression for the variance of the loss function of sufficiently deep parametrized quantum circuits.
  arXiv  Detail & Related papers  (2023-09-17T18:14:10Z)
• Parsimonious Optimisation of Parameters in Variational Quantum Circuits [1.303764728768944]
  We propose a novel Quantum-Gradient Sampling that requires the execution of at most two circuits per iteration to update the optimisable parameters. Our proposed method achieves similar convergence rates to classical gradient descent, and empirically outperforms gradient coordinate descent, and SPSA.
  arXiv  Detail & Related papers  (2023-06-20T18:50:18Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• Quantum Kernel Methods for Solving Differential Equations [21.24186888129542]
  We propose several approaches for solving differential equations (DEs) with quantum kernel methods. We compose quantum models as weighted sums of kernel functions, where variables are encoded using feature maps and model derivatives are represented.
  arXiv  Detail & Related papers  (2022-03-16T18:56:35Z)
• Generalized quantum circuit differentiation rules [23.87373187143897]
  Variational quantum algorithms that are used for quantum machine learning rely on the ability to automatically differentiate parametrized quantum circuits. Here, we propose the rules for differentiating quantum circuits (unitaries) with arbitrary generators.
  arXiv  Detail & Related papers  (2021-08-03T00:29:45Z)
• Capacity and quantum geometry of parametrized quantum circuits [0.0]
  Parametrized quantum circuits can be effectively implemented on current devices. We evaluate the capacity and trainability of these circuits using the geometric structure of the parameter space. Our results enhance the understanding of parametrized quantum circuits for improving variational quantum algorithms.
  arXiv  Detail & Related papers  (2021-02-02T18:16:57Z)

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.