Related papers: Quantum Latin squares with all possible cardinalit…
Latin squares have been historically used in order to create statistical designs in which, starting from a small number of experiments, it can be obtained a large experimental space. In this sense, the optimization of the selection of Latin…
Determining the quantum circuit complexity of a unitary operation is an important problem in quantum computation. By using the mathematical techniques of Riemannian geometry, we investigate the efficient quantum circuits in quantum…
By a (latin) unitrade, we call a set of vertices of the Hamming graph that is intersects with every maximal clique in $0$ or $2$ vertices. A bitrade is a bipartite unitrade, that is, a unitrade splittable into two independent sets. We study…
It is shown uniquely that quantized spaces are realised on four-dimensional compact manifolds. In the case of O(1,5) quantized space this are four independent parameters of O(5) unit vector; in the case of O(2,4) these are parameters of one…
Different graphical calculi have been proposed to represent quantum computation. First the ZX- calculus [4], followed by the ZW-calculus [12] and then the ZH-calculus [1]. We can wonder if new Z*-calculi will continue to be proposed…
A partial Latin square of order $n$ can be represented by a $3$-dimensional chess-board of size $n\times n\times n$ with at most $n^2$ non-attacking rooks. In Latin squares, a subsystem and its most distant mate together have as many rooks…
Quantum observables can be identified with vector fields on the sphere of normalized states. Consequently, the uncertainty relations for quantum observables become geometric statements. In the Letter the familiar uncertainty relation…
We describe a quantum system consisting of a one-dimensional linear chain of n identical harmonic oscillators coupled by a nearest neighbor interaction. Two boundary conditions are taken into account: periodic boundary conditions (where the…
We employ an algebraic procedure based on quantum mechanics to propose a `quantum number theory' (QNT) as a possible extension of the `classical number theory'. We built our QNT by defining pure quantum number operators ($q$-numbers) of a…
While quantum computing provides an exponential advantage in solving system of linear equations, there is little work to solve system of nonlinear equations with quantum computing. We propose quantum Newton's method (QNM) for solving…
One of the fundamental conditions for one-way quantum computation (1WQC) is the ability to make sequential measurements on isolated qubits that comprise the highly entangled resource for 1WQC, the cluster state. This has been a significant…
The $n$-hypercube, denoted by $Q_n$, has a vertex for each bit string of length $n$ with two vertices adjacent whenever their Hamming distance is one. The minimum number of colors needed to color $Q_n$ such that no two vertices at a…
The relativistic quantum phase space (QPS) formalism extends classical phase space by incorporating both mean values and variance-covariance matrices of quantum states, thereby providing a unified setting where the uncertainty principle and…
This paper is devoted to study of differential calculi over quadratic algebras, which arise in the theory of quantum bounded symmetric domains. We prove that in the quantum case dimensions of the homogeneous components of the graded vector…
Quadric complexes are square complexes satisfying a certain combinatorial nonpositive curvature condition. These complexes generalize 2-dimensional CAT(0) cube complexes and are a square analog of systolic complexes. We introduce and study…
We show how quantum mechanics can be understood as a space-time theory provided that its spatial continuum is modelled by a variable real number (qrumber) continuum. Such a continuum can be constructed using only standard Hilbert space…
Let P and Q be non-zero integers. The Lucas sequence U_n(P,Q) is defined by U_0=0, U_1=1, U_n= P*U_{n-1}-Q*U_{n-2} for n >1. The question of when U_n(P,Q) can be a perfect square has generated interest in the literature. We show that for…
We report the results of a computer investigation of sets of mutually orthogonal latin squares (MOLS) of small order. For $n\le9$ we 1. Determine the number of orthogonal mates for each species of latin square of order $n$. 2. Calculate the…
We describe criteria for implementation of quantum computation in qudits. A qudit is a d-dimensional system whose Hilbert space is spanned by states |0>, |1>,... |d-1>. An important earlier work of Mathukrishnan and Stroud [1] describes how…
We recall the Alon-Tarsi conjecture on the number of even latin squares. We introduce a map which switches the parity of a latin square under certain requirements. An example is included.