Inverse Renormalization Group of Disordered Systems
- URL: http://arxiv.org/abs/2310.12631v1
- Date: Thu, 19 Oct 2023 10:35:41 GMT
- Title: Inverse Renormalization Group of Disordered Systems
- Authors: Dimitrios Bachtis
- Abstract summary: We propose inverse renormalization group transformations to construct approximate configurations for lattice volumes that have not yet been accessed by supercomputers or large-scale simulations in the study of spin glasses.
We employ machine learning algorithms to construct rescaled lattices up to $V'=1283$, which we utilize to extract two critical exponents.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We propose inverse renormalization group transformations to construct
approximate configurations for lattice volumes that have not yet been accessed
by supercomputers or large-scale simulations in the study of spin glasses.
Specifically, starting from lattices of volume $V=8^{3}$ in the case of the
three-dimensional Edwards-Anderson model we employ machine learning algorithms
to construct rescaled lattices up to $V'=128^{3}$, which we utilize to extract
two critical exponents. We conclude by discussing how to incorporate numerical
exactness within inverse renormalization group approaches of disordered
systems, thus opening up the opportunity to explore a sustainable and
energy-efficient generation of exact configurations for increasing lattice
volumes without the use of dedicated supercomputers.
Related papers
- Generating configurations of increasing lattice size with machine learning and the inverse renormalization group [0.0]
Inverse renormalization group methods enable the iterative generation of configurations for increasing lattice size without the critical slowing down effect.
We present applications in models of statistical mechanics, lattice field theory, and disordered systems.
We highlight the case of the three-dimensional Edwards-Anderson spin glass, where the inverse renormalization group can be employed to construct configurations for lattice volumes that have not yet been accessed by dedicated supercomputers.
arXiv Detail & Related papers (2024-05-25T16:00:37Z) - Permutationally invariant processes in arbitrary multiqudit systems [0.0]
We establish the theoretical framework for an exact description of the open system dynamics of permutationally invariant (PI) states in arbitrary $N$-qudit systems.
Thanks to Schur-Weyl duality powerful formalism, we identify an orthonormal operator basis in the PI operator subspace of the Liouville space onto which the master equation can be projected.
arXiv Detail & Related papers (2023-07-12T12:45:21Z) - Accelerated Discovery of Machine-Learned Symmetries: Deriving the
Exceptional Lie Groups G2, F4 and E6 [55.41644538483948]
This letter introduces two improved algorithms that significantly speed up the discovery of symmetry transformations.
Given the significant complexity of the exceptional Lie groups, our results demonstrate that this machine-learning method for discovering symmetries is completely general and can be applied to a wide variety of labeled datasets.
arXiv Detail & Related papers (2023-07-10T20:25:44Z) - Hybrid Ground-State Quantum Algorithms based on Neural Schrödinger Forging [0.0]
Entanglement forging based variational algorithms leverage the bi- partition of quantum systems.
We propose a new method for entanglement forging employing generative neural networks to identify the most pertinent bitstrings.
We show that the proposed algorithm achieves comparable or superior performance compared to the existing standard implementation of entanglement forging.
arXiv Detail & Related papers (2023-07-05T20:06:17Z) - Geometric Clifford Algebra Networks [53.456211342585824]
We propose Geometric Clifford Algebra Networks (GCANs) for modeling dynamical systems.
GCANs are based on symmetry group transformations using geometric (Clifford) algebras.
arXiv Detail & Related papers (2023-02-13T18:48:33Z) - Deep Learning Symmetries and Their Lie Groups, Algebras, and Subalgebras
from First Principles [55.41644538483948]
We design a deep-learning algorithm for the discovery and identification of the continuous group of symmetries present in a labeled dataset.
We use fully connected neural networks to model the transformations symmetry and the corresponding generators.
Our study also opens the door for using a machine learning approach in the mathematical study of Lie groups and their properties.
arXiv Detail & Related papers (2023-01-13T16:25:25Z) - Gluon Digitization via Character Expansion for Quantum Computers [0.0]
Scheme based on discrete subgroups use a smaller, fixed number of qubits at the cost of systematic errors.
We systematize this approach by deriving the single plaquette action through matching the continuous group action to that of a discrete one.
We accompany this scheme by simulations of pure gauge over the largest discrete crystal-like subgroup of $SU(3)$ up to the fifth-order in the coupling constant.
arXiv Detail & Related papers (2022-03-04T14:12:52Z) - Three-fold way of entanglement dynamics in monitored quantum circuits [68.8204255655161]
We investigate the measurement-induced entanglement transition in quantum circuits built upon Dyson's three circular ensembles.
We obtain insights into the interplay between the local entanglement generation by the gates and the entanglement reduction by the measurements.
arXiv Detail & Related papers (2022-01-28T17:21:15Z) - WrapNet: Neural Net Inference with Ultra-Low-Resolution Arithmetic [57.07483440807549]
We propose a method that adapts neural networks to use low-resolution (8-bit) additions in the accumulators, achieving classification accuracy comparable to their 32-bit counterparts.
We demonstrate the efficacy of our approach on both software and hardware platforms.
arXiv Detail & Related papers (2020-07-26T23:18:38Z) - Gluon Field Digitization via Group Space Decimation for Quantum
Computers [0.0]
Scheme based on discrete subgroups use fewer qubits at the cost of systematic errors.
We systematize this approach by deriving a single plaquette action for approximating general continuous gauge groups.
We accompany the scheme by simulations of pure gauge over the largest discrete subgroup of $SU(3)$ up to the third order.
arXiv Detail & Related papers (2020-05-28T18:31:58Z) - Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware.
On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
arXiv Detail & Related papers (2020-04-15T05:16:24Z)
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.