相关论文: Thirty-six officers, artisanally entangled

Fixing an arbitrary set $\mathcal{F}$ of complex-valued functions over Boolean variables yields a counting problem $\#\mathcal{F}$. Taking only functions from $\mathcal{F}$ to form a tensor network as the problem's input, the counting…

Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…

We show that the two notions of entanglement: the maximum of the geometric measure of entanglement and the maximum of the nuclear norm is attained for the same states. We affirm the conjecture of Higuchi-Sudberry on the maximum entangled…

Kirkman triple systems (KTSs) are among the most popular combinatorial designs and their existence has been settled a long time ago. Yet, in comparison with Steiner triple systems, little is known about their automorphism groups. In…

We study the problem of testing whether two tensors in $\mathbb{R}^\ell\otimes \mathbb{R}^m\otimes \mathbb{R}^n$ are isomorphic under the natural action of orthogonal groups $\textbf{O}(\ell, \mathbb{R})\times\textbf{O}(m,…

The rank of a tensor is analyzed in context of quantum entanglement. A pure quantum state $\bf v$ of a composite system consisting of $d$ subsystems with $n$ levels each is viewed as a vector in the $d$-fold tensor product of…

A pure quantum state of N subsystems with d levels each is called k-multipartite maximally entangled state, written k-uniform, if all its reductions to k qudits are maximally mixed. These states form a natural generalization of N-qudits GHZ…

The confluence of quantum mechanics and complexity, which leads to the emergence of rich, exotic states of matter, motivates the extension of our concepts of quantum ordering. The twin concepts of spontaneously broken symmetry, described in…

Tensor completion is a problem of filling the missing or unobserved entries of partially observed tensors. Due to the multidimensional character of tensors in describing complex datasets, tensor completion algorithms and their applications…

A perfect number is a number whose divisors add up to twice the number itself. The existence of odd perfect numbers is a millennia-old unsolved problem. This note proposes a proof of the nonexistence of odd perfect numbers. More generally,…

Certain families of quantum mechanical models can be described and solved efficiently on a classical computer, including qubit or qudit Clifford circuits and stabilizer codes, free-boson or free-fermion models, and certain rotor and GKP…

A tensor is a multi-dimensional array of complex numbers, and the Lohe tensor model is an aggregation model on the space of tensors with the same rank and size. It incorporates previously well-studied aggregation models on the space of…

Quite recently, Cai et al. [arXiv:2006.07165v1] proposed a new concept "absolutely entangled set" for bipartite quantum systems: for any possible choice of global basis, at least one state of the set is entangled. There they presented a…

In the noisy tensor completion problem we observe $m$ entries (whose location is chosen uniformly at random) from an unknown $n_1 \times n_2 \times n_3$ tensor $T$. We assume that $T$ is entry-wise close to being rank $r$. Our goal is to…

We investigate several problems in entanglement theory from the perspective of convex optimization. This list of problems comprises (A) the decision whether a state is multi-party entangled, (B) the minimization of expectation values of…

A perfect cuboid, popularly known as a perfect Euler brick/a perfect box, is a cuboid having integer side lengths, integer face diagonals and an integer space diagonal. Euler provided an example where only the body diagonal became deficient…

The problem of finding the number of ordered commuting tuples of elements in a finite group is equivalent to finding the size of the solution set of the system of equations determined by the commutator relations that impose commutativity…

Tensors are a fundamental data structure for many scientific contexts, such as time series analysis, materials science, and physics, among many others. Improving our ability to produce and handle tensors is essential to efficiently address…

In this paper, we show that even order Pascal tensors are positive definite, and odd order Pascal tensors are strongly completely positive. The significance of these is that our induction proof method also holds for some other families of…

We consider the question of perfect local distinguishability of mutually orthogonal bipartite quantum states, with the property that every state can be specified by a unitary operator acting on the local Hilbert space of Bob. We show that…