Backpropagating Pauli Propagation

• URL: http://arxiv.org/abs/2607.15184v1
• Date: Thu, 16 Jul 2026 16:35:38 GMT
• Title: Backpropagating Pauli Propagation
• Abstract summary: We develop a backpropagation algorithm for evaluating parameter gradients in quantum circuits using Pauli propagation simulation.<n>The algorithm reduces the memory cost by a factor of $mathcalO(n_textparam)$ compared with conventional reverse-mode automatic differentiation.<n>These features enable efficient and accurate classical optimization of quantum circuits for applications such as state preparation and time-evolution compression.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We develop a backpropagation algorithm for evaluating parameter gradients in quantum circuits using Pauli propagation simulation. The method has computational complexity comparable to that of standard sparse Pauli simulation techniques, while producing gradients whose accuracy is of the same order as the corresponding observable expectation values. By exploiting the reversibility of quantum circuits, the algorithm reduces the memory cost by a factor of $\mathcal{O}(n_\text{param})$ compared with conventional reverse-mode automatic differentiation, where $n_\text{param}$ denotes the number of parameters in the circuit. Compared with finite difference methods, the algorithm is $\mathcal{O}(n_\text{param})$ more efficient in function evaluations. These features enable efficient and accurate classical optimization of quantum circuits for applications such as state preparation and time-evolution compression, while also allowing operator-complexity measures such as the operator stabilizer Rényi entropy to be monitored and regularized during optimization. We demonstrate the method by optimizing low-energy state-preparation circuits for transverse-field Ising models in one, two, and three dimensions and for the three-dimensional Heisenberg model, and by compressing two-dimensional time-evolution circuits.

Related papers

• Matrix encoding method in variational algorithm of calculating eigenvalues and generalized eigenvalues [51.97380440677861]
  We propose a variational method for constructing the eigenvalues and generalized eigenvalues for an arbitrary $Ntimes N$ complex matrix.<n>The quantum part of our algorithm is based on encoding the matrix elements into the pure state of a quantum system.
  arXiv  Detail & Related papers  (2026-05-07T12:52:34Z)
• Variational Entropic Optimal Transport [67.76725267984578]
  We propose Variational Entropic Optimal Transport (VarEOT) for domain translation problems.<n>VarEOT is based on an exact variational reformulation of the log-partition $log mathbbE[exp(cdot)$ as a tractable generalization over an auxiliary positive normalizer.<n> Experiments on synthetic data and unpaired image-to-image translation demonstrate competitive or improved translation quality.
  arXiv  Detail & Related papers  (2026-02-02T15:48:44Z)
• Interpolation-based coordinate descent method for parameterized quantum circuits [11.745089977547558]
  We propose an coordinate descent (ICD) method to address the parameter optimization problem in quantum circuits (PQCs)<n>ICD employs to approximate the PQC cost function, effectively recovering its underlying trigonometric structure, and then performs an argmin update on a single parameter in each iteration.<n>In contrast to previous studies on structure optimization, we determine the optimal nodes to mitigate statistical errors from quantum measurements.
  arXiv  Detail & Related papers  (2025-03-06T17:06:47Z)
• Fast Expectation Value Calculation Speedup of Quantum Approximate Optimization Algorithm: HoLCUs QAOA [55.2480439325792]
  We present a new method for calculating expectation values of operators that can be expressed as a linear combination of unitary (LCU) operators.<n>This method is general for any quantum algorithm and is of particular interest in the acceleration of variational quantum algorithms.
  arXiv  Detail & Related papers  (2025-03-03T17:15:23Z)
• Quantum Circuit Optimization using Differentiable Programming of Tensor Network States [0.0]
  The said algorithm runs on classical hardware and finds shallow, accurate quantum circuits. All circuits achieve high state fidelities within reasonable CPU time and modest memory requirements.
  arXiv  Detail & Related papers  (2024-08-22T17:48:53Z)
• 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)
• Optimization at the Interface of Unitary and Non-unitary Quantum Operations in PCOAST [0.3496513815948205]
  Pauli-based Circuit Optimization, Analysis and Synthesis Toolchain (PCOAST) introduced as framework for optimizing quantum circuits. In this paper, we focus on the set of subroutines which look to optimize the PCOAST graph in cases involving unitary and non-unitary operations. We evaluate the PCOAST optimization subroutines using the Intel Quantum SDK on examples of the Variational Quantum Eigensolver (VQE) algorithm.
  arXiv  Detail & Related papers  (2023-05-16T22:58:14Z)
• Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods [75.34939761152587]
  Efficient computation of the optimal transport distance between two distributions serves as an algorithm that empowers various applications. This paper develops a scalable first-order optimization-based method that computes optimal transport to within $varepsilon$ additive accuracy.
  arXiv  Detail & Related papers  (2023-01-30T15:46:39Z)
• Approximate Quantum Compiling for Quantum Simulation: A Tensor Network based approach [1.237454174824584]
  We introduce AQCtensor, a novel algorithm to produce short-depth quantum circuits from Matrix Product States (MPS)<n>Our approach is specifically tailored to the preparation of quantum states generated from the time evolution of quantum many-body Hamiltonians.<n>For simulation problems on 100 qubits, we show that AQCtensor achieves at least an order of magnitude reduction in the depth of the resulting optimized circuit.
  arXiv  Detail & Related papers  (2023-01-20T14:40:29Z)
• 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)
• Twisted hybrid algorithms for combinatorial optimization [68.8204255655161]
  Proposed hybrid algorithms encode a cost function into a problem Hamiltonian and optimize its energy by varying over a set of states with low circuit complexity. We show that for levels $p=2,ldots, 6$, the level $p$ can be reduced by one while roughly maintaining the expected approximation ratio.
  arXiv  Detail & Related papers  (2022-03-01T19:47:16Z)
• 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)

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.