arXiv 2201.022462022-01quant-phmath-phmath.MP

Quantum computing based on complex Clifford algebras

Jaroslav Hrdina, Ales Navrat, Petr Vasik

英文摘要：

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 dimension $2n.$ In this framework, the Dirac formalism can be realized in straightforward way. We demonstrate its functionality by performing quantum computations with several well known examples of quantum gates. We also compare our approach with representations that use real geometric algebras.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Clifford algebras, algebraic spinors, quantum information and applications

We give an algebraic formulation based on Clifford algebras and algebraic spinors for quantum information. In this context, logic gates and concepts such as chirality, charge conjugation, parity and time reversal are introduced and explored in connection with states of qubits. Supersymmetry and M-superalgebra are also analysed with our formalism. Specifically we use extensively the algebras $Cl_{3,0}$ and $Cl_{1,3}$ as well as tensor products of Clifford algebras.

2020-05-08math-phmath.MPquant-ph

Clifford Algebras in Symplectic Geometry and Quantum Mechanics

The necessary appearance of Clifford algebras in the quantum description of fermions has prompted us to re-examine the fundamental role played by the quaternion Clifford algebra, C(0,2). This algebra is essentially the geometric algebra describing the rotational properties of space. Hidden within this algebra are symplectic structures with Heisenberg algebras at their core. This algebra also enables us to define a Poisson algebra of all homogeneous quadratic polynomials on a two-dimensional sub-space, Fa of the Euclidean three-space. This enables us to construct a Poisson Clifford algebra, H(F…

2012-03-03math-phmath.MPquant-ph

Clifford Algebras, Quantum Neural Networks and Generalized Quantum Fourier Transform

We propose models of quantum neural networks through Clifford algebras, which are capable of capturing geometric features of systems and to produce entanglement. Due to their representations in terms of Pauli matrices, the Clifford algebras are the natural framework for multidimensional data analysis in a quantum setting. Implementation of activation functions and unitary learning rules are discussed. In this scheme, we also provide an algebraic generalization of the quantum Fourier transform containing additional parameters that allow performing quantum machine learning. Furthermore, some int…

2022-06-03math-phmath.MPquant-ph

Notes on Weyl-Clifford algebras

Here is discussed generalization of Clifford algebras, l^n-dimensional Weyl-Clifford algebras T(n,l) with n generators t_k satisfying equation $(\sum_{k=1}^n a_k t_k)^l = \sum_{k=1}^n a_k^l$. It is originated from two basic and well known constructions: representation of Clifford algebras via tensor products of Pauli matrices together with extension for l > 2 using Weyl commutation relations. Presentation of such general topics here may not pretend to entire originality or completeness and it is rather a preliminary excursus into this very broad and interesting area of research.

2002-03-27hep-thmath-phmath.MP

The Stabilized Poincare-Heisenberg algebra: a Clifford algebra viewpoint

The stabilized Poincare-Heisenberg algebra (SPHA) is the Lie algebra of quantum relativistic kinematics generated by fifteen generators. It is obtained from imposing stability conditions after attempting to combine the Lie algebras of quantum mechanics and relativity which by themselves are stable, however not when combined. In this paper we show how the sixteen dimensional Clifford algebra CL(1,3) can be used to generate the SPHA. The Clifford algebra path to the SPHA avoids the traditional stability considerations, relying instead on the fact that CL(1,3) is a semi-simple algebra and therefo…

2006-11-02gr-qchep-thmath-ph

Clifford algebras and universal sets of quantum gates

In this paper is shown an application of Clifford algebras to the construction of computationally universal sets of quantum gates for $n$-qubit systems. It is based on the well-known application of Lie algebras together with the especially simple commutation law for Clifford algebras, which states that all basic elements either commute or anticommute.

2001-04-04quant-ph

更多相关论文收起更多论文

An Algebraic Framework for Multi-Qudit Computations with Generalized Clifford Algebras

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 ge…

2022-08-22quant-ph

Clifford algebras, noncommutative tori and universal quantum computers

Recently author suggested [quant-ph/0010071] an application of Clifford algebras for construction of a "compiler" for universal binary quantum computer together with later development [quant-ph/0012009] of the similar idea for a non-binary base. The non-binary case is related with application of some extension of idea of Clifford algebras. It is noncommutative torus defined by polynomial algebraic relations of order l. For l=2 it coincides with definition of Clifford algebra. Here is presented the joint consideration and comparison of both cases together with some discussion on possible physic…

2001-09-03quant-ph

Comment on: Disproof of Bell's Theorem by Clifford Algebra Valued Local Variables

We ''save'' Bell's Theorem by showing a flaw in Christian's argument.

2007-03-25quant-ph

Disproof of ''Disproof of Bell's Theorem by Clifford Algebra Valued Local Variables''

Key mathematical and conceptual errors are pointed out regarding the paper ''Disproof of Bell's Theorem by Clifford Algebra Valued Local Variables'' by Joy Christian.

2008-01-02quant-ph

Computing quopit Clifford circuit amplitudes by the sum-over-paths technique

By the Gottesman-Knill Theorem, the outcome probabilities of Clifford circuits can be computed efficiently. We present an alternative proof of this result for quopit Clifford circuits (i.e., Clifford circuits on collections of $p$-level systems, where $p$ is an odd prime) using Feynman's sum-over-paths technique, which allows the amplitudes of arbitrary quantum circuits to be expressed in terms of a weighted sum over computational paths. For a general quantum circuit, the sum over paths contains an exponential number of terms, and no efficient classical algorithm is known that can compute the …

2017-10-27quant-ph

On Clifford groups in quantum computing

The term Clifford group was introduced in 1998 by D. Gottesmann in his investigation of quantum error-correcting codes. The simplest Clifford group in multiqubit quantum computation is generated by a restricted set of unitary Clifford gates - the Hadamard, $π/4$-phase and controlled-X gates. Because of this restriction the Clifford model of quantum computation can be efficiently simulated on a classical computer (the Gottesmann-Knill theorem). However, this fact does not diminish the importance of the Clifford model, since it may serve as a suitable starting point for a full-fledged quantum co…

2018-10-24quant-ph

Fault-Tolerant Quantum Computing in the Pauli or Clifford Frame with Slow Error Diagnostics

We consider the problem of fault-tolerant quantum computation in the presence of slow error diagnostics, either caused by measurement latencies or slow decoding algorithms. Our scheme offers a few improvements over previously existing solutions, for instance it does not require active error correction and results in a reduced error-correction overhead when error diagnostics is much slower than the gate time. In addition, we adapt our protocol to cases where the underlying error correction strategy chooses the optimal correction amongst all Clifford gates instead of the usual Pauli gates. The r…

2017-12-25quant-ph

Disproof of Bell's Theorem by Clifford Algebra Valued Local Variables

It is shown that Bell's theorem fails for the Clifford algebra valued local realistic variables. This is made evident by exactly reproducing quantum mechanical expectation value for the EPR-Bohm type spin correlations observable by means of a local, deterministic, Clifford algebra valued variable, without necessitating either remote contextuality or backward causation. Since Clifford product of multivector variables is non-commutative in general, the spin correlations derived within our locally causal model violate the CHSH inequality just as strongly as their quantum mechanical counterparts.

2010-04-22gr-qchep-thquant-ph