An Algebraic Framework for Multi-Qudit Computations with Generalized
Clifford Algebras
- URL: http://arxiv.org/abs/2103.15324v2
- Date: Mon, 22 Aug 2022 00:40:57 GMT
- Title: An Algebraic Framework for Multi-Qudit Computations with Generalized
Clifford Algebras
- Authors: Robert Lin
- Abstract summary: We develop a framework of axioms which abstracts various high-level properties of multi-qudit representations of generalized Clifford algebras.
This framework opens the way for developing a graphical calculus for multi-qudit representations of generalized Clifford algebras.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: In this article, we develop an algebraic framework of axioms which abstracts
various high-level properties of multi-qudit representations of generalized
Clifford algebras. We further construct an explicit model and prove that it
satisfies these axioms. Strengths of our algebraic framework include the
minimality of its assumptions, and the readiness by which one may give an
explicit construction satisfying these assumptions. In terms of applications,
this algebraic framework provides a solid foundation which opens the way for
developing a graphical calculus for multi-qudit representations of generalized
Clifford algebras using purely algebraic methods, which is addressed in a
follow-up paper.
Related papers
- Enriching Diagrams with Algebraic Operations [49.1574468325115]
We extend diagrammatic reasoning in monoidal categories with algebraic operations and equations.
We show how this construction can be used for diagrammatic reasoning of noise in quantum systems.
arXiv Detail & Related papers (2023-10-17T14:12:39Z) - The tilted CHSH games: an operator algebraic classification [77.34726150561087]
This article introduces a general systematic procedure for solving any binary-input binary-output game.
We then illustrate on the prominent class of tilted CHSH games.
We derive for those an entire characterisation on the region exhibiting some quantum advantage.
arXiv Detail & Related papers (2023-02-16T18:33:59Z) - Discovering Sparse Representations of Lie Groups with Machine Learning [55.41644538483948]
We show that our method reproduces the canonical representations of the generators of the Lorentz group.
This approach is completely general and can be used to find the infinitesimal generators for any Lie group.
arXiv Detail & Related papers (2023-02-10T17:12:05Z) - The characteristic polynomial in calculation of exponential and
elementary functions in Clifford algebras [0.0]
Formulas to calculate multivector exponentials in a base-free representation are presented.
The results may be useful in quantum circuits or in the problems of analysis of evolution of entangled quantum states.
arXiv Detail & Related papers (2022-05-24T11:31:32Z) - Non-determinsitic algebraic rewriting as adjunction [0.0]
We develop a general model theoretic semantics to rewriting beyond the usual confluence and termination assumptions.
This is based on preordered algebra which is a model theory that extends many sorted algebra.
arXiv Detail & Related papers (2022-04-26T07:55:09Z) - Generalised Onsager Algebra in Quantum Lattice Models [0.0]
The Onsager algebra is one of the cornerstones of exactly solvable models in statistical mechanics.
We demonstrate its relations to the graph Temperley-Lieb algebra, and a generalisation of the Onsager algebra.
We present a series of quantum lattice models as representations of the generalised Clifford algebra.
arXiv Detail & Related papers (2022-03-30T18:22:11Z) - Learning Algebraic Representation for Systematic Generalization in
Abstract Reasoning [109.21780441933164]
We propose a hybrid approach to improve systematic generalization in reasoning.
We showcase a prototype with algebraic representation for the abstract spatial-temporal task of Raven's Progressive Matrices (RPM)
We show that the algebraic representation learned can be decoded by isomorphism to generate an answer.
arXiv Detail & Related papers (2021-11-25T09:56:30Z) - Algebras of Sets and Coherent Sets of Gambles [1.697342683039794]
We show how to construct an information algebra of coherent sets of gambles defined on general possibility spaces.
This paper also details how propositional logic is naturally embedded into the theory of imprecise probabilities.
arXiv Detail & Related papers (2021-05-27T08:14:38Z) - A Graphical Calculus for Quantum Computing with Multiple Qudits using
Generalized Clifford Algebras [0.0]
We show that it is feasible to envision implementing the braid operators for quantum computation, by showing that they are 2-local operators.
We derive several new identities for the braid elements, which are key to our proofs.
In terms of quantum computation, we show that it is feasible to envision implementing the braid operators for quantum computation.
arXiv Detail & Related papers (2021-03-30T05:19:49Z) - Bilinear Classes: A Structural Framework for Provable Generalization in
RL [119.42509700822484]
Bilinear Classes is a new structural framework which permits generalization in reinforcement learning.
The framework incorporates nearly all existing models in which a sample complexity is achievable.
Our main result provides an RL algorithm which has sample complexity for Bilinear Classes.
arXiv Detail & Related papers (2021-03-19T16:34:20Z) - A refinement of Reznick's Positivstellensatz with applications to
quantum information theory [72.8349503901712]
In Hilbert's 17th problem Artin showed that any positive definite in several variables can be written as the quotient of two sums of squares.
Reznick showed that the denominator in Artin's result can always be chosen as an $N$-th power of the squared norm of the variables.
arXiv Detail & Related papers (2019-09-04T11:46:26Z)
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.