相关论文: Thirty-six officers, artisanally entangled
A perfect number is a positive integer $N$ such that the sum of all the positive divisors of $N$ equals $2N$, denoted by $\sigma(N) = 2N$. The question of the existence of odd perfect numbers (OPNs) is one of the longest unsolved problems…
A vector sublattice of the order bounded operators on a Dedekind complete vector lattice can be supplied with the convergence structures of order convergence, strong order convergence, unbounded order convergence, strong unbounded order…
In this paper we show that simple semidefinite programs inspired by degree $4$ SOS can exactly solve the tensor nuclear norm, tensor decomposition, and tensor completion problems on tensors with random asymmetric components. More precisely,…
Entangled linear orders were first introduced by Abraham and Shelah. Todor\v{c}evi\'c showed that these linear orders exist under $\mathsf{CH}$. We prove the following results: (1) If $\mathsf{CH}$ holds, then, for every $n > 0$, there is…
A $2\otimes 2$ unitary operation is called a perfect entangler if it can generate a maximally entangled state from some unentangled input. We study the following question: How many runs of a given two-qubit entangling unitary operation is…
Higher order tensor inversion is possible for even order. We have shown that a tensor group endowed with the Einstein (contracted) product is isomorphic to the general linear group of degree $n$. With the isomorphic group structures, we…
We study tensor completion in the agnostic setting. In the classical tensor completion problem, we receive $n$ entries of an unknown rank-$r$ tensor and wish to exactly complete the remaining entries. In agnostic tensor completion, we make…
We classify tensors with maximal and next to maximal dimensional symmetry groups under a natural genericity assumption (1-genericity), in dimensions greater than 7. In other words, we classify minimal dimensional orbits in the space of…
This article reviews and extends recent results concerning entanglement and frustration in multipartite systems which have some symmetry with respect to the ordering of the particles. Starting point of the discussion are Bell inequalities:…
Tensor rank and low-rank tensor decompositions have many applications in learning and complexity theory. Most known algorithms use unfoldings of tensors and can only handle rank up to $n^{\lfloor p/2 \rfloor}$ for a $p$-th order tensor in…
In this paper, we focus on a special class of symmetric tensors, which can be orthogonally diagonalizable, and investigate their Z-eigenpairs problem. We show that the eigenpairs can be uniformly expressed using several basic eigenpairs,…
A Latin square of order $n$ is an $n \times n$ array filled with $n$ symbols such that each symbol appears only once in every row or column and a transversal is a collection of cells which do not share the same row, column or symbol. The…
It is widely accepted that the logic of quantum mechanics is based on orthomodular posets. However, such a logic is not dynamic in the sense that it does not incorporate time dimension. To fill this gap, we introduce certain tense operators…
Recently, many structured tensors are defined and their properties are discussed in the literature. In this paper, we introduce a new class of structured tensors, called exceptionally regular tensor, which is relevant to the tensor…
We study a composition operation on monads, equivalently presented as large equational theories. Specifically, we discuss the existence of tensors, which are combinations of theories that impose mutual commutation of the operations from the…
Higher-order tensors arise frequently in applications such as neuroimaging, recommendation system, social network analysis, and psychological studies. We consider the problem of low-rank tensor estimation from possibly incomplete,…
Since its introduction by Gauss, Matrix Algebra has facilitated understanding of scientific problems, hiding distracting details and finding more elegant and efficient ways of computational solving. Today's largest problems, which often…
We provide algorithms to count and enumerate representatives of the (right) ideal classes of an Eichler order in a quaternion algebra defined over a number field. We analyze the run time of these algorithms and consider several related…
Goyeneche et al.\ [Phys.\ Rev.\ A \textbf{97}, 062326 (2018)] introduced several classes of quantum combinatorial designs, namely quantum Latin squares, quantum Latin cubes, and the notion of orthogonality on them. They also showed that…
In this paper, we introduce a novel algorithm for calculating arbitrary order cumulants of multidimensional data. Since the $d^\text{th}$ order cumulant can be presented in the form of an $d$-dimensional tensor, the algorithm is presented…