Related papers: A complementary construction using mutually unbias…
The correlation properties of sequences form a focal point in the design of multiple access systems of communications. Such a system must be able to serve a number of simultaneous users while keeping interference low. A popular choice for…
The focus of this thesis is the study and construction of covering arrays, relying on maximal period sequences and other tools from finite fields. A covering array of strength $t$, denoted $\mathrm{CA}(N; t, k,v)$, is an $N\times k$ array…
The concept of mutually unbiased bases is studied for N pairs of continuous variables. To find mutually unbiased bases reduces, for specific states related to the Heisenberg-Weyl group, to a problem of symplectic geometry. Given a single…
A simple recipe for generating a complete set of mutually unbiased bases in dimension (2j+1)**e, with 2j + 1 prime and e positive integer, is developed from a single matrix acting on a space of constant angular momentum j and defined in…
We develop a strong connection between maximally commuting bases of orthogonal unitary matrices and mutually unbiased bases. A necessary condition of the existence of mutually unbiased bases for any finite dimension is obtained. Then a…
In this note we study frame-related properties of a sequence of functions multiplied by another function. In particular we study frame and Riesz basis properties. We apply these results to sets of irregular translates of a bandlimited…
In this paper, the construction of finite-length binary sequences whose nonlinear complexity is not less than half of the length is investigated. By characterizing the structure of the sequences, an algorithm is proposed to generate all…
A complementary Gray code for binary n-tuples is one that, when all the tuples are complemented, is identical to itself; this is equivalent to the complement of the first half of the code being identical to the second half. We generalize…
We solve the problem of designing an O(1) time algorithm for generating adjacent multiset combinations in a different approach from Walsh. By the word adjacent, we mean that two adjacent multiset combinations are different at two places by…
We study bases of the lattice generated by the cycles of an undirected graph, defined as the integer linear combinations of the 0/1-incidence vectors of cycles. We prove structural results for this lattice, including explicit formulas for…
We propose a new efficient iterative method for generating random correlated binary sequences with prescribed correlation function. The method is based on consecutive linear modulations of initially uncorrelated sequence into a correlated…
In dimension $d$, Mutually Unbiased Bases (MUBs) are a collection of orthonormal bases over $\mathbb{C}^d$ such that for any two vectors $v_1, v_2$ belonging to different bases, the scalar product $|\braket{v_1|v_2}| = \frac{1}{\sqrt{d}}$.…
Two observables are called complementary if preparing a physical object in an eigenstate of one of them yields a completely random result in a measurement of the other. We investigate small sets of complementary observables that cannot be…
Maximal sets of mutually unbiased bases are useful throughout quantum physics, both in a foundational context and for applications. To date, it remains unknown if complete sets of mutually unbiased bases exist in Hilbert spaces of…
Graph construction, a fundamental operation in a data processing pipeline, is typically done by multiplying the incidence array representations of a graph, $\mathbf{E}_\mathrm{in}$ and $\mathbf{E}_\mathrm{out}$, to produce an adjacency…
We propose a new method of finding the mutually unbiased bases for three qubits. The key element is the construction of the table of striation-generating curves in the discrete phase space. We derive a system of equations in the Galois…
We introduce a new type of partitions that consists of partitions whose different parts alternate in parity (e.g., $3+2+2+1+1$). Various properties of this partition function are studied. In particular, we obtain its asymptotic behavior by…
A new family of sequences is proposed. An example of sequence of this family is more accurately studied. This sequence is composed by the integers $n$ for which the sum of binary digits is equal to the sum of binary digits of $n^2$. Some…
Mutually unbiased bases are an important tool in many applications of quantum information theory. We present a new algorithm for finding the mutually unbiased bases for two-qubit systems. We derive a system of four equations in the Galois…
We construct an informationally complete set of mutually unbiased - like bases for N ququarts. These bases are used in an explicit tomographic protocol which performance is analyzed by estimating quadratic errors and compared to other…