Braiding Fibonacci anyons
- URL: http://arxiv.org/abs/2404.01778v4
- Date: Fri, 16 Aug 2024 14:24:08 GMT
- Title: Braiding Fibonacci anyons
- Authors: Ludmil Hadjiivanov, Lachezar S. Georgiev,
- Abstract summary: We propose a conformal field theory construction of topological quantum registers based on Fibonacci anyons.
Special attention is paid to the braiding properties of the obtained correlators.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Fibonacci anyons provide the simplest possible model of non-Abelian fusion rules: [1] x [1] = [0] + [1]. We propose a conformal field theory construction of topological quantum registers based on Fibonacci anyons realized as quasiparticle excitations in the Z_3 parafermion fractional quantum Hall state. To this end, the results of Ardonne and Schoutens for the correlation function of n = 4 Fibonacci fields are extended to the case of arbitrary n (and 3 r electrons). Special attention is paid to the braiding properties of the obtained correlators. We explain in details the construction of a monodromy representation of the Artin braid group acting on n-point conformal blocks of Fibonacci anyons. For low n (up to n = 8), the matrices of braid group generators are displayed explicitly. A simple recursion formula makes it possible to extend without efforts the construction to any n. Finally, we construct N qubit computational spaces in terms of conformal blocks of 2N + 2 Fibonacci anyons.
Related papers
- Binet-Fibonacci Calculus and N = 2 Supersymmetric Golden Quantum Oscillator [0.0]
Binet-Fibonacci calculus, as $varphi varphi'$ - two base quantum calculus, relates Fibonacci derivative with Binet formula of Fibonacci number operator.
Here we generalize this model to supersymmetric number operator and corresponding Binet formula for supersymmetric Fibonacci operator $cal F_cal N$.
arXiv Detail & Related papers (2024-10-05T14:24:32Z) - Minimal Quantum Circuits for Simulating Fibonacci Anyons [0.0]
We devise minimal quantum circuits to demonstrate the non-Abelian nature of the doubled Fibonacci topological order.
Our circuits effectively initialize the ground state, create excitations, twist and braid them, all in the smallest lattices possible.
arXiv Detail & Related papers (2024-07-31T17:30:44Z) - 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) - FoldToken: Learning Protein Language via Vector Quantization and Beyond [56.19308144551836]
We introduce textbfFoldTokenizer to represent protein sequence-structure as discrete symbols.
We refer to the learned symbols as textbfFoldToken, and the sequence of FoldTokens serves as a new protein language.
arXiv Detail & Related papers (2024-02-04T12:18:51Z) - Dyck Paths and Topological Quantum Computation [1.3958149444453791]
We show a mapping between the fusion basis of three Fibonacci anyons, $|1rangle, |taurangle$, and the two length 4 Dyck paths.
We also show braidwords in this rotated space that efficiently enable the execution of any desired single-qubit operation.
arXiv Detail & Related papers (2023-06-28T09:52:08Z) - From frustration-free parent Hamiltonians to off-diagonal long-range
order: Moore-Read and related states in second quantization [51.47980393607887]
We construct a second-quantized formula for Moore-Read Pfaffian states.
We prove the existence of frustration-free parent Hamiltonians without appealing to such second-quantized properties.
arXiv Detail & Related papers (2023-05-16T08:43:46Z) - Conformal field theory from lattice fermions [77.34726150561087]
We provide a rigorous lattice approximation of conformal field theories given in terms of lattice fermions in 1+1-dimensions.
We show how these results lead to explicit error estimates pertaining to the quantum simulation of conformal field theories.
arXiv Detail & Related papers (2021-07-29T08:54:07Z) - Fold2Seq: A Joint Sequence(1D)-Fold(3D) Embedding-based Generative Model
for Protein Design [70.27706384570723]
We propose Fold2Seq, a novel framework for designing protein sequences conditioned on a specific target fold.
We show improved or comparable performance of Fold2Seq in terms of speed, coverage, and reliability for sequence design.
The unique advantages of fold-based Fold2Seq, in comparison to a structure-based deep model and RosettaDesign, become more evident on three additional real-world challenges.
arXiv Detail & Related papers (2021-06-24T14:34:24Z) - Quantum Coin Flipping, Qubit Measurement and Generalized Fibonacci
Numbers [0.0]
The problem of Hadamard quantum coin measurement in $n$ trials is formulated in terms of Fibonacci sequences for duplicated states, Tribonacci numbers for triplicated states and $N$-Bonacci numbers for arbitrary $N$-plicated states.
For generic qubit coin, the formulas are expressed by Fibonacci and more general, $N$-Bonaccis in qubit probabilities.
arXiv Detail & Related papers (2021-03-15T18:27:44Z) - Models of zero-range interaction for the bosonic trimer at unitarity [91.3755431537592]
We present the construction of quantum Hamiltonians for a three-body system consisting of identical bosons mutually coupled by a two-body interaction of zero range.
For a large part of the presentation, infinite scattering length will be considered.
arXiv Detail & Related papers (2020-06-03T17:54:43Z) - Can Graph Neural Networks Count Substructures? [53.256112515435355]
We study the power of graph neural networks (GNNs) via their ability to count attributed graph substructures.
We distinguish between two types of substructure counting: inducedsubgraph-count and subgraphcount-count, and both positive and negative answers for popular GNN architectures.
arXiv Detail & Related papers (2020-02-10T18:53:30Z)
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.