Universality in long-distance geometry and quantum complexity

• URL: http://arxiv.org/abs/2111.12700v2
• Date: Mon, 20 Nov 2023 19:25:56 GMT
• Title: Universality in long-distance geometry and quantum complexity
• Authors: Adam R. Brown, Michael H. Freedman, Henry W. Lin, Leonard Susskind
• Abstract summary: We show that metrics on low-dimensional Lie groups have markedly different short-distance properties but nearly identical distance functions at long distances. We argue for the existence of a large class of definitions of quantum complexity.
• Score: 0.04260910081285213
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In physics, two systems that radically differ at short scales can exhibit strikingly similar macroscopic behaviour: they are part of the same long-distance universality class. Here we apply this viewpoint to geometry and initiate a program of classifying homogeneous metrics on group manifolds by their long-distance properties. We show that many metrics on low-dimensional Lie groups have markedly different short-distance properties but nearly identical distance functions at long distances, and provide evidence that this phenomenon is even more robust in high dimensions. An application of these ideas of particular interest to physics and computer science is complexity geometry--the study of quantum computational complexity using Riemannian geometry. We argue for the existence of a large universality class of definitions of quantum complexity, each linearly related to the other, a much finer-grained equivalence than typically considered. We conjecture that a new effective metric emerges at larger complexities that describes a broad class of complexity geometries, insensitive to various choices of microscopic penalty factors. We discuss the implications for recent conjectures in quantum gravity.

Related papers

• Gaussian Entanglement Measure: Applications to Multipartite Entanglement of Graph States and Bosonic Field Theory [50.24983453990065]
  An entanglement measure based on the Fubini-Study metric has been recently introduced by Cocchiarella and co-workers. We present the Gaussian Entanglement Measure (GEM), a generalization of geometric entanglement measure for multimode Gaussian states. By providing a computable multipartite entanglement measure for systems with a large number of degrees of freedom, we show that our definition can be used to obtain insights into a free bosonic field theory.
  arXiv  Detail & Related papers  (2024-01-31T15:50:50Z)
• Taming Quantum Time Complexity [45.867051459785976]
  We show how to achieve both exactness and thriftiness in the setting of time complexity. We employ a novel approach to the design of quantum algorithms based on what we call transducers.
  arXiv  Detail & Related papers  (2023-11-27T14:45:19Z)
• Enhanced Entanglement in the Measurement-Altered Quantum Ising Chain [46.99825956909532]
  Local quantum measurements do not simply disentangle degrees of freedom, but may actually strengthen the entanglement in the system. This paper explores how a finite density of local measurement modifies a given state's entanglement structure.
  arXiv  Detail & Related papers  (2023-10-04T09:51:00Z)
• Toward a physically motivated notion of Gaussian complexity geometry [0.0]
  We present a construction of a geometric notion of circuit complexity for Gaussian states. We show how to account for time-reversal symmetry breaking in measures of complexity. This establishes a first step towards building a quantitative, geometric notion of complexity.
  arXiv  Detail & Related papers  (2023-09-25T18:00:01Z)
• Explainable Equivariant Neural Networks for Particle Physics: PELICAN [51.02649432050852]
  PELICAN is a novel permutation equivariant and Lorentz invariant aggregator network. We present a study of the PELICAN algorithm architecture in the context of both tagging (classification) and reconstructing (regression) Lorentz-boosted top quarks. We extend the application of PELICAN to the tasks of identifying quark-initiated vs.gluon-initiated jets, and a multi-class identification across five separate target categories of jets.
  arXiv  Detail & Related papers  (2023-07-31T09:08:40Z)
• Geometry Interaction Knowledge Graph Embeddings [153.69745042757066]
  We propose Geometry Interaction knowledge graph Embeddings (GIE), which learns spatial structures interactively between the Euclidean, hyperbolic and hyperspherical spaces. Our proposed GIE can capture a richer set of relational information, model key inference patterns, and enable expressive semantic matching across entities.
  arXiv  Detail & Related papers  (2022-06-24T08:33:43Z)
• Quantum Physics in Connected Worlds [0.0]
  Many-body quantum systems have a small, simple unit cell and where a vanishingly small number of pairs of the constituents directly interact. Motivated by advances in control over the pairwise interactions in many-body simulators, we determine the fate of spin systems on more general, arbitrary graphs. Our work paves the way for the discovery and exploitation of a whole class of geometries which can host uniquely complex phases of matter.
  arXiv  Detail & Related papers  (2022-05-16T18:18:48Z)
• Polynomial Equivalence of Complexity Geometries [0.05657375260432172]
  This paper proves the equivalence of a broad class of definitions of quantum computational complexity. We study right-invariant metrics on the unitary group. We delineate the equivalence class of metrics that have the same computational power as quantum circuits.
  arXiv  Detail & Related papers  (2022-05-09T18:00:10Z)
• Symmetry Group Equivariant Architectures for Physics [52.784926970374556]
  In the domain of machine learning, an awareness of symmetries has driven impressive performance breakthroughs. We argue that both the physics community and the broader machine learning community have much to understand.
  arXiv  Detail & Related papers  (2022-03-11T18:27:04Z)
• How smooth is quantum complexity? [0.0]
  The "quantum complexity" of a unitary operator measures the difficulty of its construction from a set of elementary quantum gates. In this paper, we present a unified perspective on various notions of quantum complexity, viewed as functions on the space of unitary operators.
  arXiv  Detail & Related papers  (2021-06-15T17:58:08Z)
• Geometry of quantum complexity [0.0]
  Computational complexity is a new quantum information concept that may play an important role in holography. We consider quantum computational complexity for $n$ qubits using Nielsen's geometrical approach.
  arXiv  Detail & Related papers  (2020-11-15T18:41:19Z)

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.