Related papers: Resource bounded Ku\v{c}era-G\'{a}cs Theorems
Let $G$ be a real connected algebraic semi-simple Lie group, and $H$ an algebraic subgroup of $G$. Let $\mu$ be a probability measure on $G$, with finite exponential moment, whose support spans a Zariski-dense subsemigroup of $G$. Let…
By a [$K$-]approximate subring of a ring we mean an additively symmetric subset $X$ such that $X \cdot X \cup (X + X)$ is covered by finitely many [resp.\ $K$] additive translates of $X$. We prove a structure theorem for finite approximate…
The recent development of general quantum resource theories has given a sound basis for the quantification of useful quantum effects. Nevertheless, the evaluation of a resource measure can be highly non-trivial, involving an optimisation…
We call a reductive complex group $G$ quasi-toral if $G^0$ is a torus. Let $G$ be quasi-toral and let $V$ be a faithful $1$-modular $G$-module. Let $N$ (the shell) be the zero fiber of the canonical moment mapping $\mu\colon V\oplus…
We define the equivariant Cox ring of a normal variety with algebraic group action. We study algebraic and geometric aspects of this object and show how it is related to the ordinary Cox ring. Then, we specialize to the case of normal…
The continuous random energy model (CREM) is a toy model of spin glasses on $\{0,1\}^N$ that, in the limit, exhibits an infinitely hierarchical correlation structure. We give two polynomial-time algorithms to approximately sample from the…
Among the most fundamental questions in the manipulation of quantum resources such as entanglement is the possibility of reversibly transforming all resource states. The key consequence of this would be the identification of a unique…
Just recently, complementarity relations (CRs) have been derived from the basic rules of Quantum Mechanics. The complete CRs are equalities involving quantum coherence, $C$, quantum entanglement, and predictability, $P$. While the first two…
Given an $m$-edge, undirected, weighted graph $G=(V,E,w)$, a Gomory-Hu tree $T$ (Gomory and Hu, 1961) is a tree over the vertex set $V$ such that all-pairs mincuts in $G$ are preserved exactly in $T$. In this article, we give the first…
We give new combinatorial proofs of known almost-periodicity results for sumsets of sets with small doubling in the spirit of Croot and Sisask, whose almost-periodicity lemma has had far-reaching implications in additive combinatorics. We…
We prove that every GNS-symmetric quantum Markov semigroup on a finite dimensional matrix algebra satisfies a modified log-Sobolev inequality. In the discrete time setting, we prove that every finite dimensional GNS-symmetric quantum…
In this work, we revisit algorithms for Tensor PCA: given an order-$r$ tensor of the form $T = G+\lambda \cdot v^{\otimes r}$ where $G$ is a random symmetric Gaussian tensor with unit variance entries and $v$ is an unknown boolean vector in…
We study the computational model where we can access a matrix $\mathbf{A}$ only by computing matrix-vector products $\mathbf{A}\mathrm{x}$ for vectors of the form $\mathrm{x} = \mathrm{x}_1 \otimes \cdots \otimes \mathrm{x}_q$. We prove…
In the classical RAM, we have the following useful property. If we have an algorithm that uses $M$ memory cells throughout its execution, and in addition is sparse, in the sense that, at any point in time, only $m$ out of $M$ cells will be…
The ability to engineer non-Gaussian quantum resources underlies quantum technologies from communication and metrology to universal computation. However, while a number of canonical works have set no-go limits for attaining such resources…
We consolidate two widely believed conjectures about tautologies -- no optimal proof system exists, and most require superpolynomial size proofs in any system -- into a $p$-isomorphism-invariant condition satisfied by all paddable…
Since the work of Polyanskiy, Poor and Verd\'u on the finite blocklength performance of capacity-achieving codes for discrete memoryless channels, many papers have attempted to find further results for more practically relevant channels.…
The resource theory of coherence studies the operational value of superpositions in quantum technologies. A key question in this theory concerns the efficiency of manipulation and interconversion of this resource. Here we solve this…
One of the fundamental features of quantum mechanics is the superposition principle, a manifestation of which is embodied in quantum coherence. Coherence of a quantum state is invariably defined with respect to a preferred set of pointer…
Kobayashi introduced a uniform notion of compressibility of infinite binary sequences in terms of relative Turing computations with sub-identity use of the oracle. Kobayashi compressibility has remained a relatively obscure notion, with the…