Related papers: Quantum Latin squares with all possible cardinalit…

Scalable modern-time fault-tolerant quantum computation and quantum communication in a network employ a large number of physical qubits. For example, IBM is reported to have made a 127-qubit quantum computer. Unlike classical computation,…

We introduce, for each state of a bosonic quantum field, its quadrature coherence scale (QCS), a measure of the range of its quadrature coherences. Under coupling to a thermal bath, the purity and QCS are shown to decrease on a time scale…

Quantum computation can be achieved by preparing an appropriate initial product state of qudits and then letting it evolve under a fixed Hamiltonian. The readout is made by measurement on individual qudits at some later time. This approach…

The chromatic number of a latin square $L$, denoted $\chi(L)$, is the minimum number of partial transversals needed to cover all of its cells. It has been conjectured that every latin square satisfies $\chi(L) \leq |L|+2$. If true, this…

The main thrust of the article is to provide interesting example, useful for students of using bitwise operations in the programming languages C ++ and Java. As an example, we describe an algorithm for obtaining a Latin square of arbitrary…

We consider the problem of constructing Latin cubes subject to the condition that some symbols may not appear in certain cells. We prove that there is a constant $\gamma > 0$ such that if $n=2^k$ and $A$ is $3$-dimensional $n\times n\times…

(Below, \Box means "perfect square") 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}$, $(n \geq 2)$. Historically, there has been much interest in when the…

We consider the algebra of N x N matrices as a reduced quantum plane on which a finite-dimensional quantum group H acts. This quantum group is a quotient of U_q(sl(2,C)), q being an N-th root of unity. Most of the time we shall take N=3; in…

A proposal for a scalable, solid-state implementation of a quantum computer is presented. Qubits are fluorine nuclear spins in a solid crystal of fluorapatite [Ca_5 F(PO_4)_3] with resonant frequencies separated by a large field gradient.…

The purpose of this paper is to show that the mathematics of quantum mechanics (QM) is the mathematics of set partitions (which specify indefiniteness and definiteness) linearized to vector spaces, particularly in Hilbert spaces. That is,…

In this paper, we explore the relationship between the width of a qubit lattice constrained in one dimension and physical thresholds for scalable, fault-tolerant quantum computation. To circumvent the traditionally low thresholds of small…

It is well known that a quantum circuit on $N$ qubits composed of Clifford gates with the addition of $k$ non Clifford gates can be simulated on a classical computer by an algorithm scaling as $\text{poly}(N)\exp(k)$[1]. We show that, for a…

We propose a scheme for quantum computation in optical lattices. The qubits are encoded in the spacial wavefunction of the atoms such that spin decoherence does not influence the computation. Quantum operations are steered by shaking the…

We propose a quantum algorithm to solve systems of nonlinear algebraic equations. In the ideal case the complexity of the algorithm is linear in the number of variables $n$, which means our algorithm's complexity is less than $O(n^{3})$ of…

We describe quantization schemes for scalar field cosmology in the metric variables with fundamental discreteness imposed with a lattice. The variables chosen for quantization determine the lattice, and each lattice produces distinct…

A quantum ${\mathbb P}^3$ is a noncommutative analogue of a polynomial ring on four variables, and, herein, it is taken to be a regular algebra of global dimension four. It is well known that if a generic quadratic quantum ${\mathbb P}^3$…

For an integer partition $h_1 + \dots + h_n = N$, a 2-realization of this partition is a latin square of order $N$ with disjoint subsquares of orders $h_1,\dots,h_n$. The existence of 2-realizations is a partially solved problem posed by…

The scalar product of two vectors with $K$ real components can be computed using two quantum channels, that is, information transmission lines in the form of spin-1/2 XX chains. Each channel has its own $K$-qubit sender and both channels…

We obtain local unitary invariant polynomials for N qubit quantum state from first principles. A basic unit of entanglement, referred to as negativity font, is defined as a two by two matrix of probability amplitudes that determines the…

A classical question in combinatorics is the following:\ given a partial Latin square $P$, when can we complete $P$ to a Latin square $L$? In this paper, we investigate the class of \textbf{$\epsilon$-dense partial Latin squares}:\ partial…