Related papers: On the continuous Zauner conjecture
The (3x+1)-Map, T, acts on the set, Pi, of positive integers not divisible by 2 or 3. It is defined by T(x) = (3x+1)/2^k, where k is the largest integer for which T(x) is an integer. The (3x+1)-Conjecture asks if for every x in Pi there…
Let $A,B \subseteq \mathbb{R}^d $ both span $\mathbb{R}^d$ such that $\langle a, b \rangle \in \{0,1\}$ holds for all $a \in A$, $b \in B$. We show that $ |A| \cdot |B| \le (d+1) 2^d $. This allows us to settle a conjecture by Bohn, Faenza,…
Rounding has proven to be a fundamental tool in theoretical computer science. By observing that rounding and partitioning of $\mathbb{R}^d$ are equivalent, we introduce the following natural partition problem which we call the {\em secluded…
We study maximally supersymmetric irrelevant deformations of the D1-D5 CFT that correspond to following the attractor flow in reverse in the dual half-BPS black string solutions of type IIB supergravity on K3. When a single, quadratic…
A fundamental issue in the renormalization-group (RG) theory of critical phenomena concerns the allowed values of critical exponents that are consistent with the continuous nature of a phase transition. Here we conjecture a lower bound for…
We show that sufficiently low tensor rank for the balanced tripartitioning tensor $P_d(x,y,z)=\sum_{A,B,C\in\binom{[3d]}{d}:A\cup B\cup C=[3d]}x_Ay_Bz_C$ for a large enough constant $d$ implies uniform arithmetic circuits for the matrix…
We investigate information theoretic properties of low rank (less than or equal to 3) quantum channels with $SU(2)$-symmetry, where we have a complete description. We prove that PPT property coincides with entanglement-breaking property and…
Quantum consistency suggests that any de Sitter patch that lasts a number of Hubble times that exceeds its Gibbons-Hawking entropy divided by the number of light particle species suffers an effect of quantum breaking. Inclusion of other…
Christoph, Dragani\'{c}, Gir\~{a}o, Hurley, Michel, and M\"{u}yesser conjectured that, when $d\mid n$, the expected number of cycles in a uniformly random cycle-factor of a directed $d$-regular graph on $n$ vertices is uniquely maximised by…
The ellipsoid fitting conjecture of Saunderson, Chandrasekaran, Parrilo and Willsky considers the maximum number $n$ random Gaussian points in $\mathbb{R}^d$, such that with high probability, there exists an origin-symmetric ellipsoid…
Optimal dense coding using a partially-entangled pure state of Schmidt rank $\bar D$ and a noiseless quantum channel of dimension $D$ is studied both in the deterministic case where at most $L_d$ messages can be transmitted with perfect…
This paper has been removed and is superceded by a pair of papers on stochastic maps, or channels, which break entanglement (EBT). quant-ph/0302031 General Entanglement Breaking Channels by Michael Horodecki, Peter W. Shor and Mary Beth…
String breaking, the process by which flux tubes fragment into hadronic states, is a hallmark of confinement in strongly-interacting quantum field theories. A suite of quantum complexity measures is examined using Matrix Product States to…
Let $d \ge 2, h \ge 1$ be integers. Using a fragmentation technique, we characterise $(h+1)$-tuples $(R_1, \dots, R_h, R)$ of non-empty families of partitions of $\{1, \dots, d\}$ such that it suffices for an order-$d$ tensor to have…
Understanding the nature of entanglement growth in many-body systems is one of the fundamental questions in quantum physics. Here, we study this problem by characterizing the entanglement fluctuations and distribution of $(d+1)$ qubit…
Let $P_{d}(n)$ denote the number of $n \times \ldots \times n$ $d$-dimensional partitions with entries from $\left\{0,1,\ldots,n\right\}$. Building upon the works of Balogh-Treglown-Wagner and Noel-Scott-Sudakov, we show that when $d \to…
Algebraic number theory relates SIC-POVMs in dimension $d>3$ to those in dimension $d(d-2)$. We define a SIC in dimension $d(d-2)$ to be aligned to a SIC in dimension $d$ if and only if the squares of the overlap phases in dimension $d$…
We study the threshold between avoidable and unavoidable repetitions in infinite balanced sequences over finite alphabets. The conjecture stated by Rampersad, Shallit and Vandomme says that the minimal critical exponent of balanced…
We introduce a randomized iterative fragmentation procedure for finite metric spaces, which is guaranteed to result in a polynomially large subset that is $D$-equivalent to an ultrametric, where $D\in (2,\infty)$ is a prescribed target…
The problem of a diffusing particle moving among diffusing traps is analyzed in general space dimension d. We consider the case where the traps are initially randomly distributed in space, with uniform density rho, and derive upper and…