activity
19972005
most citedOn Quantum Cellular Automata

6 citations · 15 across the 13 of their papers we have counts for

collaborators
Showing 2001Show all

6 papers · 1 filter

math-ph2001

Notes on Weyl-Clifford algebras

Alexander Yu. Vlasov

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…

math-ph2001

Symmetries of complexified space-time and algebraic structures in quantum theory

Alexander Yu. Vlasov

In this paper is discussed description of some algebraic structures in quantum theory by using formal recursive constructions with "complex Poincaré group" ISO(4,C).

quant-ph2001

Clifford algebras, noncommutative tori and universal quantum computers

Alexander Yu. Vlasov

Recently author suggested [quant-ph/0010071] an application of Clifford algebras for construction of a "compiler" for universal binary quantum computer together with later developm…

quant-ph2001

Probabilities, Tensors and Qubits

Alexander Yu. Vlasov

In the paper is discussed complete probabilistic description of quantum systems with application to multiqubit quantum computations. In simplest case it is a set of probabilities o…

quant-ph2001

Universal quantum processors with arbitrary radix n

Alexander Yu. Vlasov

Here is discussed the Hamiltonian approach to construction of deterministic universal (in approximate sense) programmable quantum circuits with qubits or any other quantum systems…

quant-ph2001

Classical programmability is enough for quantum circuits universality in approximate sense

Alexander Yu. Vlasov

It was shown by M.A. Nielsen and I.L. Chuang 1997, that it is impossible to build strictly universal programmable quantum gate array, that could perform any unitary operation preci…