Quantum computing with anyons: an $F$-matrix and braid calculator

• URL: http://arxiv.org/abs/2212.00831v1
• Date: Thu, 1 Dec 2022 19:31:17 GMT
• Title: Quantum computing with anyons: an $F$-matrix and braid calculator
• Authors: Willie Aboumrad
• Abstract summary: We introduce a pentagon equation solver, available as part of SageMath, and use it to construct braid group representations associated to certain anyon systems. We present anyons abstractly as sets of labels together with a collection of data satisfying a number of axioms. In the language of RFCs, our solver can produce $F$-matrices for anyon systems corresponding to multiplicity-free fusion rings.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce a pentagon equation solver, available as part of SageMath, and use it to construct braid group representations associated to certain anyon systems. We recall the category-theoretic framework for topological quantum computation to explain how these representations describe the sets of logical gates available to an anyonic quantum computer for information processing. In doing so, we avoid venturing deep into topological or conformal quantum field theory. Instead, we present anyons abstractly as sets of labels together with a collection of data satisfying a number of axioms, including the pentagon and hexagon equations, and explain how these data characterize ribbon fusion categories (RFCs). In the language of RFCs, our solver can produce $F$-matrices for anyon systems corresponding to multiplicity-free fusion rings arising in connection with the representation theory of quantum groups associated to simple Lie algebras with deformation parameter a root of unity.

Related papers

• Diagonal Coset Approach to Topological Quantum Computation with Fibonacci Anyons [0.0]
  We investigate a promising conformal field theory realization scheme for topological quantum computation based on the Fibonacci anyons. The quantum gates are realized by braiding of these anyons.
  arXiv  Detail & Related papers  (2024-04-02T09:44:02Z)
• 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)
• Symbolic, numeric and quantum computation of Hartree-Fock equation [0.0]
  We discuss how a hybrid computation, which employs symbolic, numeric, classic, and quantum algorithms, allows us to conduct Har-Fock electronic computation of molecules. The quantum phase estimation (QPE) algorithm enables us to record those roots in the quantum states, which would be used in the input data for more advanced and more accurate quantum computations.
  arXiv  Detail & Related papers  (2023-12-27T12:15:29Z)
• Higher-order topological kernels via quantum computation [68.8204255655161]
  Topological data analysis (TDA) has emerged as a powerful tool for extracting meaningful insights from complex data. We propose a quantum approach to defining Betti kernels, which is based on constructing Betti curves with increasing order.
  arXiv  Detail & Related papers  (2023-07-14T14:48:52Z)
• 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)
• Topological Quantum Computation on Supersymmetric Spin Chains [0.0]
  Quantum gates built out of braid group elements form the building blocks of topological quantum computation. We show that the fusion spaces of anyonic systems can be precisely mapped to the product state zero modes of certain Nicolai-like supersymmetric spin chains.
  arXiv  Detail & Related papers  (2022-09-08T13:52:10Z)
• Quantum computing based on complex Clifford algebras [0.0]
  We propose to represent both $n$--qubits and quantum gates acting on them as elements in the complex Clifford algebra defined on a complex vector space of $2n.$ We demonstrate its functionality by performing quantum computations with several well known examples of quantum gates.
  arXiv  Detail & Related papers  (2022-01-06T21:01:29Z)
• The Logic of Quantum Programs [77.34726150561087]
  We present a logical calculus for reasoning about information flow in quantum programs. In particular we introduce a dynamic logic that is capable of dealing with quantum measurements, unitary evolutions and entanglements in compound quantum systems.
  arXiv  Detail & Related papers  (2021-09-14T16:08:37Z)
• Finite-Function-Encoding Quantum States [52.77024349608834]
  We introduce finite-function-encoding (FFE) states which encode arbitrary $d$-valued logic functions. We investigate some of their structural properties.
  arXiv  Detail & Related papers  (2020-12-01T13:53:23Z)
• Quantum information theory and Fourier multipliers on quantum groups [0.0]
  We compute the exact values of the minimum output entropy and the completely bounded minimal entropy of quantum channels acting on matrix algebras. Our results use a new and precise description of bounded Fourier multipliers from $mathrmL1(mathbbG)$ into $mathrmLp(mathbbG)$ for $1 p leq infty$ where $mathbbG$ is a co-amenable locally compact quantum group.
  arXiv  Detail & Related papers  (2020-08-27T09:47:10Z)
• PBS-Calculus: A Graphical Language for Coherent Control of Quantum Computations [77.34726150561087]
  We introduce the PBS-calculus to represent and reason on quantum computations involving coherent control of quantum operations. We equip the language with an equational theory, which is proved to be sound and complete. We consider applications like the implementation of controlled permutations and the unrolling of loops.
  arXiv  Detail & Related papers  (2020-02-21T16:15:58Z)

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.