English
Related papers

Related papers: On the Generality of $1+\mathbf{i}$ as a Non-Norm …

200 papers

Let $B_n(m)$ be a set picked uniformly at random among all $m$-elements subsets of $\{1,2,\ldots,n\}$. We provide a pathwise construction of the collection $(B_n(m))_{1\leq m\leq n}$ and prove that the logarithm of the least common multiple…

Probability · Mathematics 2020-04-14 Dariusz Buraczewski , Alexander Iksanov , Alexander Marynych

Consider a matrix $A$ of rank $n$ that approximates the $N\times N$ identity matrix with elementwise error at most $1/3$. We give a lower bound on the number of elements s.t. $|A_{i,j}|>\gamma$, for a certain threshold. Two corollaries are…

Functional Analysis · Mathematics 2024-12-13 Yuri Malykhin

We construct explicitly two infinite families of genuine nonadditive 1-error correcting quantum codes and prove that their coding subspaces are 50% larger than those of the optimal stabilizer codes of the same parameters via the linear…

Quantum Physics · Physics 2009-01-15 Sixia Yu , Qing Chen , C. H. Oh

Linear space-time block codes (STBCs) of unitary rate and full diversity, systematically constructed over arbitrary constellations for any number of transmit antennas are introduced. The codes are obtained by generalizing the existing ABBA…

Information Theory · Computer Science 2007-07-13 Giuseppe Thadeu Freitas de Abreu

By exploiting the connection between scattered $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^m}^3$ and minimal non degenerate $3$-dimensional rank metric codes of $\mathbb{F}_{q^m}^{n}$, $n \geq m+2$, described in [2], we will exhibit a new…

Information Theory · Computer Science 2024-02-13 Stefano Lia , Giovanni Longobardi , Giuseppe Marino , Rocco Trombetti

It is known that, for transmission over quasi-static MIMO fading channels with n transmit antennas, diversity can be obtained by using an inner fully diverse space-time block code while coding gain, derived from the determinant criterion,…

Information Theory · Computer Science 2010-08-10 Frederique Oggier , Patrick Sole , Jean-Claude Belfiore

Randomness is a central feature of quantum mechanics and an invaluable resource for both classical and quantum technologies. Commonly, in Device-Independent and Semi-Device-Independent scenarios, randomness is certified using projective…

Quantum Physics · Physics 2022-11-08 Marco Avesani , Hamid Tebyanian , Paolo Villoresi , Giuseppe Vallone

Bateman and Duquette have initiated the study of Salem elements in positive characteristic. This work extends their results to 2-Salem elements whose minimal polynomials are of the type $Y^n + \lambda_{n-1}Y^{n-1} + \ldots+\lambda_1Y +…

Number Theory · Mathematics 2021-01-01 Mabrouk Nasr , Hassen Kthiri , Jean-Louis Verger-Gaugry

Recently a test of nonclassicality for a single qubit was proposed [R. Alicki and N. Van Ryn, J. Phys. A: Math. Theor. 41, 062001 (2008)]. We present an optimized experimental realization of this test leading to a 46 standard deviation…

Recently, minimal linear codes have been extensively studied due to their applications in secret sharing schemes, secure two-party computations, and so on. Constructing minimal linear codes violating the Ashikhmin-Barg condition and then…

Information Theory · Computer Science 2022-01-11 Haibo Liu , Qunying Liao

For each positive integer $n$, let $\mathbb F_{q^n}$ be the unique $n$-degree extension of the finite field $\mathbb F_q$ with $q$ elements, where $q$ is a prime power. It is known that for arbitrary $q$ and $n$, there exists an element…

Number Theory · Mathematics 2024-12-23 Arthur Fernandes , Daniel Panario , Lucas Reis

Quantum block encoding (QBE) is a crucial step in the development of most quantum algorithms, as it provides an embedding of a given matrix into a suitable larger unitary matrix. Historically, the development of efficient techniques for QBE…

Quantum Physics · Physics 2026-03-20 Giacomo Antonioli , Paola Boito , Gianna M. Del Corso , Margherita Porcelli

We show that several versions of Floyd and Rivest's improved algorithm Select for finding the $k$th smallest of $n$ elements require at most $n+\min\{k,n-k\}+O(n^{1/2}\ln^{1/2}n)$ comparisons on average and with high probability. This…

Data Structures and Algorithms · Computer Science 2007-05-23 Krzysztof C. Kiwiel

The general wave functions for the two-dimensional regular pentagonal quantum box and thin microstrip antenna are derived. As for the square, equilateral triangular, and circular disk-shaped boxes and antennas, there are two quantum nunbers…

Superconductivity · Physics 2026-01-27 Tristan Langhorne , Erik E. Domenech , Juan Oliveros Gonzalez , Richard A. Klemm

We give an upper bound for the norm of the determinant of additively indecomposable, totally positive definite quadratic forms defined over the ring of integers of totally real number fields. We apply these results to find lower and upper…

Number Theory · Mathematics 2025-10-10 Magdaléna Tinková , Pavlo Yatsyna

Minimal codes are being intensively studied in last years. $[n,k]_{q}$-minimal linear codes are in bijection with strong blocking sets of size $n$ in $PG(k-1,q)$ and a lower bound for the size of strong blocking sets is given by…

Combinatorics · Mathematics 2022-12-07 Valentino Smaldore

Quasi-normal-eigenvalue optimization is studied under constraints $b_1(x) \le B(x) \le b_2 (x)$ on structure functions $B$ of 2-side open optical or mechanical resonators. We prove existence of various optimizers and provide an example when…

Optimization and Control · Mathematics 2018-07-31 Illya M. Karabash , Olga M. Logachova , Ievgen V. Verbytskyi

Let $P = \{p(i)\}$ be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, there are nontrivial $P$ for which known methods find a…

Information Theory · Computer Science 2016-11-17 Michael B. Baer

The maximal rate of a non-square complex orthogonal design for $n$ transmit antennas is $1/2+\frac{1}{n}$ if $n$ is even and $1/2+\frac{1}{n+1}$ if $n$ is odd and the codes have been constructed for all $n$ by Liang (IEEE Trans. Inform.…

Information Theory · Computer Science 2011-12-08 Smarajit Das , B. Sundar Rajan

Understanding the noise affecting a quantum device is of fundamental importance for scaling quantum technologies. A particularly important class of noise models is that of Pauli channels, as randomized compiling techniques can effectively…

Quantum Physics · Physics 2025-05-19 Omar Fawzi , Aadil Oufkir , Daniel Stilck França