Efficient computation of topological order

• URL: http://arxiv.org/abs/2409.12704v1
• Date: Thu, 19 Sep 2024 12:30:27 GMT
• Title: Efficient computation of topological order
• Authors: Louis Fraatz, Amit Jamadagni, Hendrik Weimer,
• Abstract summary: We analyze the computational aspects of detecting topological order in a quantum many-body system. We find exponential scaling with system size for the former and scaling for the latter. Our strategy can be readily generalized to higher dimensions and systems out of equilibrium.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We analyze the computational aspects of detecting topological order in a quantum many-body system. We contrast the widely used topological entanglement entropy with a recently introduced operational definition for topological order based on error correction properties, finding exponential scaling with the system size for the former and polynomial scaling for the latter. We exemplify our approach for a variant of the paradigmatic toric code model with mobile particles, finding that the error correction method allows to treat substantially larger system sizes. In particular, the phase diagram of the model can be successfully computed using error correction, while the topological entanglement entropy is too severely limited by finite size effects to obtain conclusive results. While we mainly focus on one-dimensional systems whose ground states can be expressed in terms of matrix product states, our strategy can be readily generalized to higher dimensions and systems out of equilibrium, even allowing for an efficient detection of topological order in current quantum simulation experiments.

Related papers

• Probing topological entanglement on large scales [0.0]
  Topologically ordered quantum matter exhibits intriguing long-range patterns of entanglement, which reveal themselves in subsystem entropies. We propose a protocol based on local adiabatic deformations of the Hamiltonian which extracts the universal features of long-range entanglement.
  arXiv  Detail & Related papers  (2024-08-22T18:00:01Z)
• Identifiability and Asymptotics in Learning Homogeneous Linear ODE Systems from Discrete Observations [114.17826109037048]
  Ordinary Differential Equations (ODEs) have recently gained a lot of attention in machine learning. theoretical aspects, e.g., identifiability and properties of statistical estimation are still obscure. This paper derives a sufficient condition for the identifiability of homogeneous linear ODE systems from a sequence of equally-spaced error-free observations sampled from a single trajectory.
  arXiv  Detail & Related papers  (2022-10-12T06:46:38Z)
• Enhancing Detection of Topological Order by Local Error Correction [0.5025737475817937]
  We introduce a new paradigm for quantifying topological states by combining methods of error correction with ideas of renormalization-group flow. We demonstrate the power of LED using numerical simulations of the toric code under a variety of perturbations. We then apply it to an experimental realization, providing new insights into a quantum spin liquid created on a Rydberg-atom simulator.
  arXiv  Detail & Related papers  (2022-09-26T05:31:04Z)
• Deep Learning Approximation of Diffeomorphisms via Linear-Control Systems [91.3755431537592]
  We consider a control system of the form $dot x = sum_i=1lF_i(x)u_i$, with linear dependence in the controls. We use the corresponding flow to approximate the action of a diffeomorphism on a compact ensemble of points.
  arXiv  Detail & Related papers  (2021-10-24T08:57:46Z)
• Fractal Structure and Generalization Properties of Stochastic Optimization Algorithms [71.62575565990502]
  We prove that the generalization error of an optimization algorithm can be bounded on the complexity' of the fractal structure that underlies its generalization measure. We further specialize our results to specific problems (e.g., linear/logistic regression, one hidden/layered neural networks) and algorithms.
  arXiv  Detail & Related papers  (2021-06-09T08:05:36Z)
• Detecting chaos in lineage-trees: A deep learning approach [1.536989504296526]
  We describe a novel method for estimating the largest Lyapunov exponent from data, based on training Deep Learning models on synthetically generated trajectories. Our method is unique in that it can analyze tree-shaped data, a ubiquitous topology in biological settings, and specifically in dynamics over lineages of cells or organisms.
  arXiv  Detail & Related papers  (2021-06-08T11:11:52Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• 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)
• Error-correction properties of an interacting topological insulator [0.0]
  We analyze the phase diagram of a topological insulator model including antiferromagnetic interactions in the form of an extended Su-Schrieffer Heeger model. We show that the necessary error correction statistics can be obtained efficiently using a Monte-Carlo sampling of a matrix product state representation of the ground state wave function.
  arXiv  Detail & Related papers  (2021-02-26T19:00:01Z)
• Multipole Graph Neural Operator for Parametric Partial Differential Equations [57.90284928158383]
  One of the main challenges in using deep learning-based methods for simulating physical systems is formulating physics-based data. We propose a novel multi-level graph neural network framework that captures interaction at all ranges with only linear complexity. Experiments confirm our multi-graph network learns discretization-invariant solution operators to PDEs and can be evaluated in linear time.
  arXiv  Detail & Related papers  (2020-06-16T21:56:22Z)

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.