Quantum walks on regular graphs with realizations in a system of anyons

• URL: http://arxiv.org/abs/2109.10934v1
• Date: Wed, 22 Sep 2021 18:01:20 GMT
• Title: Quantum walks on regular graphs with realizations in a system of anyons
• Authors: Radhakrishnan Balu
• Abstract summary: We build interacting Fock spaces from association schemes and set up quantum walks on regular graphs. In the dual perspective interacting Fock spaces gather a new meaning in terms of anyon systems.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We build interacting Fock spaces from association schemes and set up quantum walks on the resulting regular graphs (distance-regular and distance-transitive). The construction is valid for growing graphs and the interacting Fock space is well defined asymptotically for the growing graph. To realize the quantum walks defined on the graphs in terms of anyons we switch to the dual view of the association schemes and identify the corresponding modular tensor categories from the Bose-Mesner algebra. Informally, the fusion ring induced by the association scheme and a topological twist can be the basis for developing a modular tensor category and thus a system of anyons. Finally, we demonstrate the framework in the case of Grover quantum walk on distance-regular graph in terms of anyon systems for the graphs considered. In the dual perspective interacting Fock spaces gather a new meaning in terms of any

Related papers

• Bit by Bit: Gravity Through the Lens of Quantum Information [0.0]
  dissertation reviews recent advances at the intersection of quantum information and holography. In holography, properties of quantum systems admit a gravitational interpretation via the AdS/CFT correspondence. Magic and entanglement play complementary roles when describing emergent phenomena in AdS/CFT.
  arXiv  Detail & Related papers  (2024-06-03T18:00:17Z)
• 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)
• Graphical Symplectic Algebra [0.0]
  We give complete presentations for the dagger-compact props of affine Lagrangian and coisotropic relations over an arbitrary field. This provides a unified family of graphical languages for both affinely constrained classical mechanical systems, as well as odd-prime-dimensional stabiliser quantum circuits.
  arXiv  Detail & Related papers  (2024-01-15T19:07:33Z)
• Engineering Graph States of Atomic Ensembles by Photon-Mediated Entanglement [0.0]
  We report on the generation of continuous-variable graph states of atomic spin ensembles. The edges represent the entanglement structure, which we program by combining global photon-mediated interactions in an optical cavity with local spin rotations. We further engineer a four-mode square graph state, highlighting the flexibility of our approach.
  arXiv  Detail & Related papers  (2022-12-22T18:46:17Z)
• Graph Spectral Embedding using the Geodesic Betweeness Centrality [76.27138343125985]
  We introduce the Graph Sylvester Embedding (GSE), an unsupervised graph representation of local similarity, connectivity, and global structure. GSE uses the solution of the Sylvester equation to capture both network structure and neighborhood proximity in a single representation.
  arXiv  Detail & Related papers  (2022-05-07T04:11:23Z)
• Key graph properties affecting transport efficiency of flip-flop Grover percolated quantum walks [0.0]
  We study quantum walks with the flip-flop shift operator and the Grover coin. We show how the position of the source and sink together with the graph geometry and its modifications affect transport. This gives us a deep insight into processes where elongation or addition of dead-end subgraphs may surprisingly result in enhanced transport.
  arXiv  Detail & Related papers  (2022-02-19T11:55:21Z)
• Subfactors from regular graphs induced by association schemes [0.0]
  We set up quantum walks on growing distance-regular graphs induced by association schemes via interacting Fock spaces. We discuss in detail a large family of graphs that may be treated within this approach.
  arXiv  Detail & Related papers  (2022-01-18T20:59:08Z)
• Learning Graphons via Structured Gromov-Wasserstein Barycenters [143.42601038462965]
  We propose a novel and principled method to learn a nonparametric graph model called graphon. The proposed approach overcomes drawbacks of prior state-of-the-art methods, and outperforms them on both synthetic and real-world data.
  arXiv  Detail & Related papers  (2020-12-10T13:04:29Z)
• Hamiltonian systems, Toda lattices, Solitons, Lax Pairs on weighted Z-graded graphs [62.997667081978825]
  We identify conditions which allow one to lift one dimensional solutions to solutions on graphs. We show that even for a simple example of a topologically interesting graph the corresponding non-trivial Lax pairs and associated unitary transformations do not lift to a Lax pair on the Z-graded graph.
  arXiv  Detail & Related papers  (2020-08-11T17:58:13Z)
• GraphOpt: Learning Optimization Models of Graph Formation [72.75384705298303]
  We propose an end-to-end framework that learns an implicit model of graph structure formation and discovers an underlying optimization mechanism. The learned objective can serve as an explanation for the observed graph properties, thereby lending itself to transfer across different graphs within a domain. GraphOpt poses link formation in graphs as a sequential decision-making process and solves it using maximum entropy inverse reinforcement learning algorithm.
  arXiv  Detail & Related papers  (2020-07-07T16:51:39Z)
• Operator-algebraic renormalization and wavelets [62.997667081978825]
  We construct the continuum free field as the scaling limit of Hamiltonian lattice systems using wavelet theory. A renormalization group step is determined by the scaling equation identifying lattice observables with the continuum field smeared by compactly supported wavelets.
  arXiv  Detail & Related papers  (2020-02-04T18:04:51Z)

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.