Linear combination of unitaries with exponential convergence

• URL: http://arxiv.org/abs/2601.18024v1
• Date: Sun, 25 Jan 2026 22:47:21 GMT
• Title: Linear combination of unitaries with exponential convergence
• Authors: Peter Brearley, Thomas Howarth,
• Abstract summary: We present a general method for decomposing non-unitary operators into a linear combination of unitary operators.<n>When implemented in a quantum circuit, the subnormalisation of the resulting block encoding scales with the double logarithm of the inverse error.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a general method for decomposing non-unitary operators into a linear combination of unitary operators, where the approximation error decays exponentially. The decomposition is based on a smooth periodic extension of the identity map via the Fourier extension method, resulting in a sine series with exponentially decaying coefficients. Rewriting the sine series in terms of complex exponentials, then evaluating it on the Hermitian and anti-Hermitian parts of a non-unitary operator, yields its approximation by a linear combination of unitaries. When implemented in a quantum circuit, the subnormalisation of the resulting block encoding scales with the double logarithm of the inverse error, substantially improving over the polynomial relationship in existing methods. For hardware or applications with a fixed error budget, we discuss a strategy to minimise subnormalisation by exploiting the overcomplete nature of the Fourier extension basis. This regularisation procedure traces an error-subnormalisation Pareto front, identifying coefficients that maximise the subnormalisation at a fixed error budget. Fourier linear combinations of unitaries thus provides an accurate and versatile framework for non-unitary quantum computing.

Related papers

• FUTON: Fourier Tensor Network for Implicit Neural Representations [56.48739018255443]
  Implicit neural representations (INRs) have emerged as powerful tools for encoding signals, yet dominant-based designs often suffer from slow convergence, overfitting to noise, and poor extrapolation.<n>We introduce FUTON, which models signals as generalized Fourier series whose coefficients are parameterized by a low-rank tensor decomposition.
  arXiv  Detail & Related papers  (2026-02-13T19:31:44Z)
• Polynomial-time certification of fidelity for many-body mixed states and mixed-state universality classes [23.9304612104967]
  We introduce a-time algorithm to compute certified lower and upper bounds for fidelity between matrix product density operators.<n>Our results offer an exponential improvement in precision over known moment-based bounds.
  arXiv  Detail & Related papers  (2026-01-19T19:13:28Z)
• A Linear Combination of Unitaries Decomposition for the Laplace Operator [0.0]
  We provide novel linear combination of unitaries decompositions for a class of discrete elliptic differential operators.<n>The number of unitary terms required for our decomposition is independent of the number of grid points used in the discretization.<n>Explicit circuit constructions for each unitary are given and their complexities analyzed.
  arXiv  Detail & Related papers  (2026-01-10T00:54:39Z)
• Approximation Capabilities of Feedforward Neural Networks with GELU Activations [6.488575826304024]
  We derive an approximation error bound that holds simultaneously for a function and all its derivatives up to any prescribed order.<n>The bounds apply to elementary functions, including multivariates, the exponential function, and the reciprocal function.<n>We report the network size, weight magnitudes, and behavior at infinity.
  arXiv  Detail & Related papers  (2025-12-25T17:56:44Z)
• Zassenhaus Expansion in Solving the Schrödinger Equation [0.0]
  A fundamental challenge lies in approximating the unitary evolution operator ( e-imathcalHt ) where ( mathcalH ) is a large, typically non-commuting, Hermitian operator.<n>We present a refinement of the fixed-depth simulation framework introduced by E. K"okc"u et al, incorporating the second-order Zassenhaus expansion.<n>This yields a controlled, non-unitary approximation with error scaling as ( mathcalO(t
  arXiv  Detail & Related papers  (2025-05-14T14:48:47Z)
• On the Constant Depth Implementation of Pauli Exponentials [49.48516314472825]
  We decompose $Zotimes n$ exponentials of arbitrary length into circuits of constant depth using $mathcalO(n)$ ancillae and two-body XX and ZZ interactions.<n>We prove the correctness of our approach, after introducing novel rewrite rules for circuits which benefit from qubit recycling.
  arXiv  Detail & Related papers  (2024-08-15T17:09:08Z)
• Stable Nonconvex-Nonconcave Training via Linear Interpolation [51.668052890249726]
  This paper presents a theoretical analysis of linearahead as a principled method for stabilizing (large-scale) neural network training. We argue that instabilities in the optimization process are often caused by the nonmonotonicity of the loss landscape and show how linear can help by leveraging the theory of nonexpansive operators.
  arXiv  Detail & Related papers  (2023-10-20T12:45:12Z)
• Convergent Data-driven Regularizations for CT Reconstruction [41.791026380947685]
  In this work, we investigate simple, but still provably convergent approaches to learning linear regularization methods from data. We prove that such approaches become convergent regularization methods as well as the fact that the reconstructions they provide are typically much smoother than the training data they were trained on.
  arXiv  Detail & Related papers  (2022-12-14T17:34:03Z)
• Alternating Wentzel-Kramers-Brillouin Approximation to the Schrödinger Equation: Rediscover the Bremmers series and beyond [0.0]
  We propose an extension of Wenzel-Kramers-Brillouin (WKB) approximation for solving the Schr"odinger equation.<n>We find a general quantization formula in which the geometric-optical-like physics is encoded.
  arXiv  Detail & Related papers  (2022-07-03T01:49:10Z)
• Scalable Variational Gaussian Processes via Harmonic Kernel Decomposition [54.07797071198249]
  We introduce a new scalable variational Gaussian process approximation which provides a high fidelity approximation while retaining general applicability. We demonstrate that, on a range of regression and classification problems, our approach can exploit input space symmetries such as translations and reflections. Notably, our approach achieves state-of-the-art results on CIFAR-10 among pure GP models.
  arXiv  Detail & Related papers  (2021-06-10T18:17:57Z)
• Benign Overfitting of Constant-Stepsize SGD for Linear Regression [122.70478935214128]
  inductive biases are central in preventing overfitting empirically. This work considers this issue in arguably the most basic setting: constant-stepsize SGD for linear regression. We reflect on a number of notable differences between the algorithmic regularization afforded by (unregularized) SGD in comparison to ordinary least squares.
  arXiv  Detail & Related papers  (2021-03-23T17:15:53Z)
• Joint Network Topology Inference via Structured Fusion Regularization [70.30364652829164]
  Joint network topology inference represents a canonical problem of learning multiple graph Laplacian matrices from heterogeneous graph signals. We propose a general graph estimator based on a novel structured fusion regularization. We show that the proposed graph estimator enjoys both high computational efficiency and rigorous theoretical guarantee.
  arXiv  Detail & Related papers  (2021-03-05T04:42:32Z)

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.