Related papers: $q$-Analogs for Steiner Systems and Covering Desig…
Unitary $t$-designs are the bread and butter of quantum information theory and beyond. An important issue in practice is that of efficiently constructing good approximations of such unitary $t$-designs. Building on results by Aubrun (Comm.…
We introduce a notion of connected perimeter for planar sets defined as the lower semi-continuous envelope of perimeters of approximating sets which are measure-theoretically connected. A companion notion of simply connected perimeter is…
A q-design with parameters t-(v,k,lambda_t)_q is a pair (V, B) of the v-dimensional vector space V over GF(q) and a collection B of k-dimensional subspaces of V, such that each t-dimensional subspace of V is contained in precisely lambda_t…
In recent years, Quantum Computing (QC) has progressed to the point where small working prototypes are available for use. Termed Noisy Intermediate-Scale Quantum (NISQ) computers, these prototypes are too small for large benchmarks or even…
Andrews once gave $q$-analogues of a binomial congruence of Glaisher, and he suggested perfect $q$-analogues. In this note we give ones meeting the demand of Andrews.
An ideal system of $n$ qubits has $2^n$ dimensions. This exponential grants power, but also hinders characterizing the system's state and dynamics. We study a new problem: the qubits in a physical system might not be independent. They can…
Basic concepts of quantum integrable systems (QIS) are presented stressing on the unifying structures underlying such diverse models. Variety of ultralocal and nonultralocal models is shown to be described by a few basic relations defining…
If $S$ is a transitive metric space, then $|C|\cdot|A| \le |S|$ for any distance-$d$ code $C$ and a set $A$, ``anticode'', of diameter less than $d$. For every Steiner S$(t,k,n)$ system $S$, we show the existence of a $q$-ary…
In the present paper I formulate a framework that accommodates many unambiguous discrimination problems. I show that the prior information about any type of constituent (state, channel, or observable) allows us to reformulate the…
In this paper new Steiner systems $S(2,6,121)$, $S(2,6,126)$, $S(2,7,169)$ are introduced. Also some non-existence results for line lengths $7..11$ are presented. There is no solid proof that presented algorithm is exhaustive or correct,…
The recent emergence of novel computational devices, such as quantum computers, coherent Ising machines, and digital annealers presents new opportunities for hardware-accelerated hybrid optimization algorithms. Unfortunately, demonstrations…
We investigate the extent to which we can establish whether or not two quantum systems have been prepared in the same state. We investigate the possibility of universal unambiguous state comparison. We show that it is impossible to…
This paper is concerned with a covering problem of Euclidean space by a particular arrangement of cones that are not necessarily full and are allowed to overlap. The problem provides an equivalent geometric reformulation of the solvability…
Arguably, the most important open problem in the theory of $q$-analogs of designs is the question for the existence of a $q$-analog $D$ of the Fano plane. It is undecided for every single prime power value $q \geq 2$. A point $P$ is called…
We describe a method to engineer giant nonlinearities in, and probes to measure nonlinear observables of, mesoscopic quantum resonators. This involves tailoring the Hamiltonian of a simple auxiliary system perturbatively coupled to the…
The notion of unbiased orthogonal designs is introduced as a generalization among unbiased Hadamard matrices, unbiased weighing matrices and quasi-unbiased weighing matrices. We provide upper bounds and several constructions for mutually…
We prove several structural properties of Steiner triple systems (STS) of order 3w+3 that include one or more transversal subdesigns TD(3,w). Using an exhaustive search, we find that there are 2004720 isomorphism classes of STS(21)…
We consider N quantum systems initially prepared in pure states and address the problem of unambiguously comparing them. One may ask whether or not all $N$ systems are in the same state. Alternatively, one may ask whether or not the states…
We show that for any n divisible by 3, almost all order-n Steiner triple systems admit a decomposition of almost all their triples into disjoint perfect matchings (that is, almost all Steiner triple systems are almost resolvable).
We derive a necessary and sufficient condition for the existence of symmetric space structures on quotients of Banach symmetric spaces. Along the way, we investigate the different kinds of reflection subspaces and their Lie triple systems.