Alexander Yu. Vlasov
Currently, generalizations of quantum communication protocols from qubits to systems with higher-dimensional state spaces (qudits) typically use mutually unbiased bases (MUB). The construction with maximal number of MUB is known in any…
The Witting configuration with 40 complex rays was suggested as a possible reformulation of Penrose model with two spin-3/2 systems based on geometry of dodecahedron and used for analysis of nonlocality and contextuality in quantum…
A model with two entangled spin-3/2 particles based on geometry of dodecahedron was suggested by Roger Penrose for formulation of analogue of Bell theorem "without probabilities." The model was later reformulated using so-called Witting…
The cellular automaton is a widely known model of both reversible and irreversible computations. The family of reversible second-order cellular automata considered in this work is appropriate both for construction of logic gates and…
It is shown that ternary qubit trees with the same number of nodes can be transformed by the naturally defined sequence of Clifford gates into each other or into standard representation as 1D chain corresponding to Jordan-Wigner transform.
All quantum gates with one and two qubits may be described by elements of $Spin$ groups due to isomorphisms $Spin(3) \simeq SU(2)$ and $Spin(6) \simeq SU(4)$. However, the group of $n$-qubit gates $SU(2^n)$ for $n > 2$ has bigger dimension…
Representations of Spin groups and Clifford algebras derived from the structure of qubit trees are introduced in this work. For ternary trees the construction is more general and reduction to binary trees is formally defined by deletion of…
Well-known (spinless) fermionic qubits may need more subtle consideration in comparison with usual (spinful) fermions. Taking into account a model with local fermionic modes, formally only the 'occupied' states |1> could be relevant for…
The work discusses validation of properties of quantum circuits with many qubits using non-universal set of quantum gates ensuring possibility of effective simulation on classical computer. An understanding analogy between different models…
This work recollects a non-universal set of quantum gates described by higher-dimensional Spin groups. They are also directly related with matchgates in theory of quantum computations and complexity. Various processes of quantum state…
Particular complexity of linear quantum optical networks is deserved recently certain attention due to possible implications for theory of quantum computation. Two relevant models of bosons are discussed in presented work. Symmetric product…
The universal object oriented languages made programming more simple and efficient. In the article is considered possibilities of using similar methods in computer algebra. A clear and powerful universal language is useful if particular…
It is considered an interdependence of the theory of quantum computing and some perspective information technologies. A couple of illustrative and useful examples are discussed. The reversible computing from very beginning had the serious…
Recursive equations for the number of cells with nonzero values at $n$-th step for some two-dimensional reversible second-order cellular automata are proved in this work. Initial configuration is a single cell with the value one and all…
A cellular automaton with $n$ states may be used for construction of reversible second-order cellular automaton with $n^2$ states. Reversible cellular automata with hidden parameters discussed in this paper are generalization of such…
A software model of a reversible processor ReveR with the stack is discussed in this paper. An architecture, the minimal set of elementary reversible operations together with an implementation of the basic control flow structures and…
The Dirac's chord method may be suitable in different areas of physics for the representation of certain six-dimensional integrals for a convex body using the probability density of the chord length distribution. For a homogeneous model…
In this brief note is discussed application of continuous quantum history ("trash") variable for simplification of scheme of programmable quantum processor. Similar scheme may be tested also in other models of the theory of quantum…
A `register' in quantum information processing -- is composition of k quantum systems, `qudits'. The dimensions of Hilbert spaces for one qudit and whole quantum register are d and d^k respectively, but we should have possibility to prepare…
Modern classical computing devices, except of simplest calculators, have von Neumann architecture, i.e., a part of the memory is used for the program and a part for the data. It is likely, that analogues of such architecture are also…