Searcharxiv⌕ Search

arXiv subjects

Alexander Yu. Vlasov

Publications and source records attributed to Alexander Yu. Vlasov.

At least 55 records · Page 3Linked to original sources
arXiv2003

From Fermat's last theorem to the quantum computer

Despite of an active work of many researchers in the theory of quantum computations, this area still saves some mysterious charm. It is already an almost common idea, that maybe many fashionable current projects will fade in future, but some absolutely unpredictable applications appear instead. Why such optimistic predictions are legal here, despite of an extreme difficulty to suggest each one new promising quantum algorithm or realistic "industrial" application? One reason -- is very deep contents of this area. It maybe only an extremely unlucky occasion, if such a fundamental thing won't supply us with some bright insights and serious new applications. A sign of such nontrivial contents of a theory -- are unexpected links between different branches of our knowledge. In the present paper is mentioned one such link -- between application of Weyl quantization in the theory of quantum computations and abstract mathematical constructions born in mid of XIX century due to unsuccessful tries to prove Fermat's last theorem.

quant-ph↗
arXiv2003

Quantum Processors and Controllers

In this paper is presented an abstract theory of quantum processors and controllers, special kind of quantum computational network defined on a composite quantum system with two parts: the controlling and controlled subsystems. Such approach formally differs from consideration of quantum control as some external influence on a system using some set of Hamiltonians or quantum gates. The model of programmed quantum controllers discussed in present paper is based on theory of universal deterministic quantum processors (programmable gate arrays). Such quantum devices may simulate arbitrary evolution of quantum system and so demonstrate an example of universal quantum control. Keywords: Quantum, Computer, Control, Processor, Universal

quant-ph↗
arXiv2003

Dirac Spinors and Representations of GL(4) Group in GR

Transformation properties of Dirac equation correspond to Spin(3,1) representation of Lorentz group SO(3,1), but group GL(4,R) of general relativity does not accept a similar construction with Dirac spinors. On the other hand, it is possible to look for representation of GL(4,R) in some bigger space, there Dirac spinors are formally situated as some "subsystem." In the paper is described construction of such representation, using Clifford and Grassmann algebras of 4D space.

math-ph↗
arXiv2003

On Symmetric Sets of Projectors for Reconstruction of a Density Matrix

In this work are presented sets of projectors for reconstruction of a density matrix for an arbitrary mixed state of a quantum system with the finite-dimensional Hilbert space. It was discussed earlier [quant-ph/0104126] a construction with (2n-1)n projectors for the dimension n. For n=2 it is a set with six projectors associated with eigenvectors of three Pauli matrices, but for n>2 the construction produces not such a `regular' set. In this paper are revisited some results of previous work [quant-ph/0104126] and discussed another, more symmetric construction with the Weyl matrix pair (as the generalization of Pauli matrices). In the particular case of prime n it is the mutually unbiased set with (n+1)n projectors. In appendix is shown an example of application of complete sets for discussions about separability and random robustness.

quant-ph↗
arXiv2003

Affine-Detection Loophole in Quantum Data Processing

Here is considered a specific detection loophole, that is relevant not only to testing of quantum nonlocality, but also to some other applications of quantum computations and communications. It is described by a simple affine relation between different quantum "data structures" like pure and mixed state, separable and inseparable one. It is shown also, that due to such relations imperfect device for a classical model may mimic measurements of quantum correlations on ideal equipment.

quant-ph↗
arXiv2002

Algebras and universal quantum computations with higher dimensional systems

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 discussed generalization to quantum computation with continuous variables.

quant-ph↗
arXiv2002

Noncommutative tori and universal sets of non-binary quantum gates

A problem of universality in simulation of evolution of quantum system and in theory of quantum computations is related with the possibility of expression or approximation of arbitrary unitary transformation by composition of specific unitary transformations (quantum gates) from given set. In an earlier paper (quant-ph/0010071) application of Clifford algebras to constructions of universal sets of binary quantum gates $U_k \in U(2^n)$ was shown. For application of a similar approach to non-binary quantum gates $U_k \in U(l^n)$ in present work is used rational noncommutative torus ${\Bbb T}^{2n}_{1/l}$. A set of universal non-binary two-gates is presented here as one example.

quant-ph↗
arXiv2002

Comment on "How the No-Cloning Theorem Got its Name"

A review by A. Peres [quant-ph/0205076] appears recently. It is difficult to add something to such kind of fundamental themes, but here is briefly presented some ideas about challenges of the no-cloning theorem and imaginary modifications of quantum mechanics, that could make precise cloning possible.

quant-ph↗
arXiv2002

ALEPH-QP: Universal hybrid quantum processors

A quantum processor (the programmable gate array) is a quantum network with a fixed structure. A space of states is represented as tensor product of data and program registers. Different unitary operations with the data register correspond to "loaded" programs without any changing or "tuning" of network itself. Due to such property and undesirability of entanglement between program and data registers, universality of quantum processors is subject of rather strong restrictions. By different authors was developed universal "stochastic" quantum gate arrays. It was proved also, that "deterministic" quantum processors with finite-dimensional space of states may be universal only in approximate sense. In present paper is shown, that using hybrid system with continuous and discrete quantum variables, it is possible to suggest a design of strictly universal quantum processors. It is shown also that "deterministic" limit of specific programmable "stochastic" U(1) gates (probability of success becomes unit for infinite program register), discussed by other authors, may be essentially same kind of hybrid quantum systems used here.

quant-ph↗
arXiv2002

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.

math-ph↗
arXiv2001

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 physical consequences.

quant-ph↗
arXiv2001

Probabilities, Tensors and Qubits

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 of transitions to some fixed set of states. The probabilities in the set may be represented linearly via coefficients of density matrix and it is very similar with description using mixed states, but also may give some alternative view on specific properties of quantum circuits due to possibility of direct comparison with classical statistical paradigm.

quant-ph↗
arXiv2001

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.

quant-ph↗
arXiv2001

Universal quantum processors with arbitrary radix n

Here is discussed the Hamiltonian approach to construction of deterministic universal (in approximate sense) programmable quantum circuits with qubits or any other quantum systems with dimension of Hilbert space is $n \ge 2$.

quant-ph↗
arXiv2001

Classical programmability is enough for quantum circuits universality in approximate sense

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 precisely and it was suggested to use probabilistic gate arrays instead. In present work is shown, that if to use more physical and weak condition of universality (suggested already in earliest work by D.Deutsch 1985) and to talk about simulation with arbitrary, but finite precision, then it is possible to build universal programmable gate array. But now the same no-go theorem by Nielsen and Chuang will have new interesting consequence --- controlling programs for the gate arrays can be considered as pure classical. More detailed design of such deterministic quantum gate arrays universal ``in approximate sense'' is considered in the paper.

quant-ph↗
arXiv2000

Comment on `Decomposition of pure states of a quantum register'

I. Raptis and R. Zapatrin in the quant-ph/0010104 show possibility to express general state of $l$-qubits quantum register as sum at most $2^l-l$ product states. In the comment is suggested more simple construction with possibility of generalization for decomposition of tensor product of Hilbert spaces with arbitrary dimension $n$ (here simplicial complexes used in the article mentioned above would not be applied directly). In this case it is decomposition with $n^l-(n^2-n)l/2$ product states.

quant-ph↗