6 citations · 17 across the 14 of their papers we have counts for
4 papers · 2 filters
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…
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…
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…
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…