Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Journal of Scientific and Engineering Research

Quantum computing models for algebraic applications

Nikolay Raychev

Published Aug 25, 2015• 8 citations
Publisher
DOI
10.14299/ijser.2015.08.003

Related papers

Algebra of quantum computations with higher dimensional systems

Alexander Y. Vlasov

Here is discussed application of the Weyl pair to construction of universal set of quantum gates for high-dimensional quantum system. An application of Lie algebras (Hamiltonians) for construction of universal gates is revisited first. It is shown next, how for quantum computation with qubits can be used two-dimensional analog of this Cayley-Weyl matrix algebras, i.e. Clifford algebras, and discussed well known applications to product operator formalism in NMR, Jordan-Wigner construction in fermionic quantum computations. It is introduced universal set of quantum gates for higher dimensional system ("qudit"), as some generalization of these models. Finally it is briefly mentioned possible application of such algebraic methods to design of quantum processors (programmable gates arrays) and dsicussed generalization to quantum computation wiht continuous variables.

arXiv:quant-ph/0210049•Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Jul 23, 2003•17 citations

Models for Quantum Computation

Peter P. Rohde

Cambridge University Press eBooks•Sep 9, 2021•0 citations

Quantum Computing Algebra (QCA), the theory and implementation

Jaroslav Hrdina, Dietmar Hildenbrand, Oliver Rettig

We present a real geometric algebra framework designed for the direct translation of the Dirac formalism into geometric algebra representations. Unlike previous approaches based on positive-definite signatures, QCA employs a split-signature construction that enables a natural realization of quantum states and operators while simplifying computational implementation. We further present an implementation of QCA using the \textit{GAALOP} software and show how quantum gates and multi-qubit systems can be efficiently represented and generated computationally. As an application, we demonstrate the use of QCA in quantum game theory, where the real-algebraic formulation provides computational advantages for modeling entangled strategies and quantum interactions. The proposed framework establishes a practical bridge between the abstract formalism of quantum computation and efficient geometric algebra implementations.

quant-pharXiv:2606.17621•Jun 17, 2026•0 citations

Models of quantum computation

Mingsheng Ying

Elsevier eBooks•Jan 1, 2024•0 citations

Generalized Donkor model with induced dipole-dipole forbidden transitions using Maple

Camilo Jaramillo Correa

The idea of this work was to generalize the Donkor model (Quantum Information and Computation IX, edited by Eric Donkor, Andrew R. Pirich, Howard E. Brandt, Proc. of SPIE Vol. 8057) about the application of induced dipole-dipole forbidden transitions to quantum computation. Using computer algebra we were able to reproduce the original Donkor model. Then we applied some modifications to this model and obtained the respective solutions. It is expected that this model has applications for quantum computation.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 1, 2012•0 citations

Mathematical models of quantum computation

Tetsuro Nishino

New Generation Computing•Dec 1, 2002•4 citations
Here is discussed application of the Weyl pair to construction of universal set of quantum gates for high-dimensional quantum system. An application of Lie algebras (Hamiltonians) for construction of universal gates is revisited first. It is shown next, how for quantum computation with qubits can be used two-dimensional analog of this Cayley-Weyl matrix algebras, i.e. Clifford algebras, and discussed well known applications to product operator formalism in NMR, Jordan-Wigner construction in fermionic quantum computations. It is introduced universal set of quantum gates for higher dimensional system ("qudit"), as some generalization of these models. Finally it is briefly mentioned possible application of such algebraic methods to design of quantum processors (programmable gates arrays) and dsicussed generalization to quantum computation wiht continuous variables.
We present a real geometric algebra framework designed for the direct translation of the Dirac formalism into geometric algebra representations. Unlike previous approaches based on positive-definite signatures, QCA employs a split-signature construction that enables a natural realization of quantum states and operators while simplifying computational implementation. We further present an implementation of QCA using the \textit{GAALOP} software and show how quantum gates and multi-qubit systems can be efficiently represented and generated computationally. As an application, we demonstrate the use of QCA in quantum game theory, where the real-algebraic formulation provides computational advantages for modeling entangled strategies and quantum interactions. The proposed framework establishes a practical bridge between the abstract formalism of quantum computation and efficient geometric algebra implementations.
The idea of this work was to generalize the Donkor model (Quantum Information and Computation IX, edited by Eric Donkor, Andrew R. Pirich, Howard E. Brandt, Proc. of SPIE Vol. 8057) about the application of induced dipole-dipole forbidden transitions to quantum computation. Using computer algebra we were able to reproduce the original Donkor model. Then we applied some modifications to this model and obtained the respective solutions. It is expected that this model has applications for quantum computation.