Clifford algebras, Spin groups and qubit trees

04/22/2019
by   Alexander Yu. Vlasov, et al.
0

Representations of Spin groups and Clifford algebras derived from structure of qubit trees are introduced in this work. For ternary trees the construction is more general and reduction to binary trees is formally defined by deleting of superfluous branches. Usual Jordan-Wigner construction also may be formally obtained in such approach by bringing the process up to trivial qubit chain ("trunk"). The methods can be also used for effective simulations of some quantum circuits corresponding to the binary tree structure. Modeling of more general qubit trees and relation with mapping used in Bravyi-Kitaev transformation are also briefly outlined.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/19/2019

A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees

We present the first fixed-parameter algorithm for constructing a tree-c...
research
05/23/2022

Linear random generation of Motzkin trees

Motzkin trees are also called unary-binary trees. This paper proposes a ...
research
05/26/2020

Compaction for two models of logarithmic-depth trees: Analysis and Experiments

In this paper we are interested in the quantitative analysis of the comp...
research
08/29/2019

Compacted binary trees admit a stretched exponential

A compacted binary tree is a directed acyclic graph encoding a binary tr...
research
01/13/2020

Simulate forest trees by integrating L-system and 3D CAD files

In this article, we propose a new approach for simulating trees, includi...
research
11/27/2019

Plasma Cash: Towards more efficient Plasma constructions

Plasma is a framework for scalable off-chain computation. We describe an...
research
09/10/2018

On Computing the Measures of First-Order Definable Sets of Trees

We consider the problem of computing the measure of a regular language o...

Please sign up or login with your details

Forgot password? Click here to reset