Operator Learning Renormalization Group

• URL: http://arxiv.org/abs/2403.03199v2
• Date: Tue, 28 May 2024 15:09:46 GMT
• Title: Operator Learning Renormalization Group
• Abstract summary: We present a general framework for quantum many-body simulations called the operator learning renormalization group (OLRG) Inspired by machine learning perspectives, OLRG is a generalization of Wilson's numerical renormalization group and White's density matrix renormalization group. We implement two versions of the operator maps for classical and quantum simulations.
• Score: 0.8192907805418583
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: In this paper, we present a general framework for quantum many-body simulations called the operator learning renormalization group (OLRG). Inspired by machine learning perspectives, OLRG is a generalization of Wilson's numerical renormalization group and White's density matrix renormalization group, which recursively builds a simulatable system to approximate a target system of the same number of sites via operator maps. OLRG uses a loss function to minimize the error of a target property directly by learning the operator map in lieu of a state ansatz. This loss function is designed by a scaling consistency condition that also provides a provable bound for real-time evolution. We implement two versions of the operator maps for classical and quantum simulations. The former, which we call the Operator Matrix Map, can be implemented via neural networks on classical computers. The latter, which we call the Hamiltonian Expression Map, generates device pulse sequences to leverage the capabilities of quantum computing hardware. We illustrate the performance of both maps for calculating time-dependent quantities in the quantum Ising model Hamiltonian.

Related papers

• Algebraic Operator Decomposition: A Partitioned Architecture for Noise-Resilient Quantum Computing [0.0]
  We present an operator-decomposition architecture that mathematically maps a global operator into independently executable local operators.<n>AOD complements quantum error correction and error-mitigation approaches by performing algebraic decomposition before quantum execution.
  arXiv  Detail & Related papers  (2026-09-03T16:44:39Z)
• Implementing Hamiltonian Renormalization Group Flow on Quantum Computers with VAPOR [0.0]
  VAPOR is a variational quantum algorithm that decomposes operators into Pauli strings, identifies RG flow orbits, and determines fixed points of a naively discretized operator.<n>We illustrate this using a toy model of a kinematic operator in a symmetry-restricted SU(2) Yang-Mills theory.
  arXiv  Detail & Related papers  (2026-06-09T18:00:05Z)
• Fermi-Dirac machines as quantizations of neurons [51.809748057605184]
  We reinterpret Fermi-Dirac machines as canonical quantizations of classical neurons.<n>We develop efficient hybrid quantum-classical algorithms for evaluating outputs and gradients of our quantized neurons.<n> Numerical experiments indicate that neurons based on quantum Hamiltonians can learn functions that classical neurons cannot.
  arXiv  Detail & Related papers  (2026-05-23T04:09:03Z)
• Debiased neural operators for estimating functionals [55.79111577184338]
  We introduce DOPE (debiased neural operator): a semivalued estimator for target quantities of solution trajectories obtained from neural operators.<n>We show that, in contrast to DOPE, naive plug-in estimation can suffer from first-order bias.<n>For this, we derive a novel one-step, Neyman-orthogonal estimator that treats the neural operator as a high-dimensional nuisance mapping between function spaces.
  arXiv  Detail & Related papers  (2026-04-21T10:02:36Z)
• Classical Simulability from Operator Entanglement Scaling [0.0]
  Local-operator entanglement (LOE) quantifies the nonlocal structure of Heisenberg operators and serves as a diagnostic of many-body chaos.<n>We provide rigorous bounds showing when an operator can be well-approximated by a matrix-product operator (MPO), given scaling of its LOE $$-Rényi entropies.<n>Our results put on firm footing the expectation that a low operator entanglement implies efficient tensor network representability.
  arXiv  Detail & Related papers  (2026-03-05T20:18:05Z)
• The Error of Deep Operator Networks Is the Sum of Its Parts: Branch-Trunk and Mode Error Decompositions [45.88028371034407]
  Operator learning has the potential to strongly impact scientific computing by learning solution operators for differential equations.<n>Despite proven universal approximation properties, deep operator networks (DeepONets) often exhibit limited accuracy and generalization in practice.<n>This work analyzes performance limitations of the classical DeepONet architecture.
  arXiv  Detail & Related papers  (2026-02-25T13:38:08Z)
• Deep Delta Learning [91.75868893250662]
  We introduce Deep Delta Learning (DDL), a novel architecture that generalizes the standard residual connection.<n>We provide a spectral analysis of this operator, demonstrating that the gate $(mathbfX)$ enables dynamic between identity mapping, projection, and geometric reflection.<n>This unification empowers the network to explicitly control the spectrum of its layer-wise transition operator, enabling the modeling of complex, non-monotonic dynamics.
  arXiv  Detail & Related papers  (2026-01-01T18:11:38Z)
• Sequential-Parallel Duality in Prefix Scannable Models [68.39855814099997]
  Recent developments have given rise to various models, such as Gated Linear Attention (GLA) and Mamba.<n>This raises a natural question: can we characterize the full class of neural sequence models that support near-constant-time parallel evaluation and linear-time, constant-space sequential inference?
  arXiv  Detail & Related papers  (2025-06-12T17:32:02Z)
• Optimal Symbolic Construction of Matrix Product Operators and Tree Tensor Network Operators [0.0]
  This research introduces an improved framework for constructing matrix product operators (MPOs) and tree tensor network operators (TTNOs) A given (Hamiltonian) operator typically has a known symbolic "sum of operator strings" form that can be translated into a tensor network structure.
  arXiv  Detail & Related papers  (2025-02-25T20:33:30Z)
• Neural Operators with Localized Integral and Differential Kernels [77.76991758980003]
  We present a principled approach to operator learning that can capture local features under two frameworks. We prove that we obtain differential operators under an appropriate scaling of the kernel values of CNNs. To obtain local integral operators, we utilize suitable basis representations for the kernels based on discrete-continuous convolutions.
  arXiv  Detail & Related papers  (2024-02-26T18:59:31Z)
• Tensor network renormalization: application to dynamic correlation functions and non-hermitian systems [0.0]
  We present the implementation of the Loop-TNR algorithm, which allows for the computation of dynamical correlation functions. We highlight that the Loop-TNR algorithm can also be applied to investigate critical properties of non-Hermitian systems.
  arXiv  Detail & Related papers  (2023-11-30T18:34:32Z)
• Quantum simulation of dissipation for Maxwell equations in dispersive media [0.0]
  dissipation appears in the Schr"odinger representation of classical Maxwell equations as a sparse diagonal operator occupying an $r$-dimensional subspace. The unitary operators can be implemented through qubit lattice algorithm (QLA) on $n$ qubits. The non-unitary-dissipative part poses a challenge on how it should be implemented on a quantum computer.
  arXiv  Detail & Related papers  (2023-07-31T18:22:40Z)
• The Parametric Complexity of Operator Learning [6.800286371280922]
  This paper aims to prove that for general classes of operators which are characterized only by their $Cr$- or Lipschitz-regularity, operator learning suffers from a curse of parametric complexity'' The second contribution of the paper is to prove that this general curse can be overcome for solution operators defined by the Hamilton-Jacobi equation. A novel neural operator architecture is introduced, termed HJ-Net, which explicitly takes into account characteristic information of the underlying Hamiltonian system.
  arXiv  Detail & Related papers  (2023-06-28T05:02:03Z)
• A Recursively Recurrent Neural Network (R2N2) Architecture for Learning Iterative Algorithms [64.3064050603721]
  We generalize Runge-Kutta neural network to a recurrent neural network (R2N2) superstructure for the design of customized iterative algorithms. We demonstrate that regular training of the weight parameters inside the proposed superstructure on input/output data of various computational problem classes yields similar iterations to Krylov solvers for linear equation systems, Newton-Krylov solvers for nonlinear equation systems, and Runge-Kutta solvers for ordinary differential equations.
  arXiv  Detail & Related papers  (2022-11-22T16:30:33Z)
• Entangled Residual Mappings [59.02488598557491]
  We introduce entangled residual mappings to generalize the structure of the residual connections. An entangled residual mapping replaces the identity skip connections with specialized entangled mappings. We show that while entangled mappings can preserve the iterative refinement of features across various deep models, they influence the representation learning process in convolutional networks.
  arXiv  Detail & Related papers  (2022-06-02T19:36:03Z)
• Growth of a renormalized operator as a probe of chaos [0.2741266294612776]
  We propose that the size of an operator evolved under holographic renormalization group flow shall grow linearly with the scale. To test this conjecture, we study the operator growth in two different toy models.
  arXiv  Detail & Related papers  (2021-10-28T17:20:17Z)
• Neural Operator: Learning Maps Between Function Spaces [75.93843876663128]
  We propose a generalization of neural networks to learn operators, termed neural operators, that map between infinite dimensional function spaces. We prove a universal approximation theorem for our proposed neural operator, showing that it can approximate any given nonlinear continuous operator. An important application for neural operators is learning surrogate maps for the solution operators of partial differential equations.
  arXiv  Detail & Related papers  (2021-08-19T03:56:49Z)
• X-volution: On the unification of convolution and self-attention [52.80459687846842]
  We propose a multi-branch elementary module composed of both convolution and self-attention operation. The proposed X-volution achieves highly competitive visual understanding improvements.
  arXiv  Detail & Related papers  (2021-06-04T04:32:02Z)
• Deep learning with transfer functions: new applications in system identification [0.0]
  This paper presents a linear dynamical operator endowed with a well-defined and efficient back-propagation behavior for automatic derivatives computation. The operator enables end-to-end training of structured networks containing linear transfer functions and other differentiable units.
  arXiv  Detail & Related papers  (2021-04-20T08:58:55Z)
• Relevant OTOC operators: footprints of the classical dynamics [68.8204255655161]
  The OTOC-RE theorem relates the OTOCs summed over a complete base of operators to the second Renyi entropy. We show that the sum over a small set of relevant operators, is enough in order to obtain a very good approximation for the entropy. In turn, this provides with an alternative natural indicator of complexity, i.e. the scaling of the number of relevant operators with time.
  arXiv  Detail & Related papers  (2020-07-31T19:23:26Z)

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.