Related papers: Lower Bounds on Coherent State Rank
We study the use of sampling for efficiently mining the top-K frequent itemsets of cardinality at most w. To this purpose, we define an approximation to the top-K frequent itemsets to be a family of itemsets which includes (resp., excludes)…
We show that static data structure lower bounds in the group (linear) model imply semi-explicit lower bounds on matrix rigidity. In particular, we prove that an explicit lower bound of $t \geq \omega(\log^2 n)$ on the cell-probe complexity…
The degree of a CSP instance is the maximum number of times that any variable appears in the scopes of constraints. We consider the approximate counting problem for Boolean CSP with bounded-degree instances, for constraint languages…
We obtain an analytical lower bound of entanglement quantified by concurrence for arbitrary bipartite quantum states. It is shown that our bound is tight for some mixed states and is complementary to the previous known lower bounds. On the…
Low-rank approximation is a technique to approximate a tensor or a matrix with a reduced rank to reduce the memory required and computational cost for simulation. Its broad applications include dimension reduction, signal processing,…
After exhaustive inspection of bosonic coherent states appearing in physical literature two of us, Horzela and Szafraniec, came in 2012 to the reasonably general definition which relies exclusively on reproducing kernels. The basic feature…
A single-mode squeezed vacuum is a foundational quantum state that, despite its nonclassical nature, exhibits classical-like, super-Poissonian photon statistics. This feature motivates a ``quantum-of-quantum'' inquiry: can the superposition…
This article reports on a program to obtain and understand coherent states for general systems. Most recently this has included supersymmetric systems. A byproduct of this work has been studies of squeezed and supersqueezed states. To…
Approximating a quantum state by the convex mixing of some given states has strong experimental significance and provides potential applications in quantum resource theory. Here we find a closed form of the minimal distance in the sense of…
Quantum coherence is one of the clearest departures from classical physics, exhibited when a system is in a superposition of different basis states. Here the coherent superposition of three motional Fock states of a single trapped ion is…
Performance of optimization on quadratic problems sensitively depends on the low-lying part of the spectrum. For large (effectively infinite-dimensional) problems, this part of the spectrum can often be naturally represented or approximated…
We quantify the internal structure of near-threshold bound, virtual, and resonance states in systems where Coulomb and short-range interactions coexist by evaluating the compositeness. Using the Coulomb-modified effective range expansion,…
A fundamental challenge in quantum physics is determining the ground-state properties of many-body systems. Whereas standard approaches, such as variational calculations, consist of writing down a wave function ansatz and minimizing over…
We construct a new class of quantum error-correcting codes for a bosonic mode which are advantageous for applications in quantum memories, communication, and scalable computation. These 'binomial quantum codes' are formed from a finite…
The entanglement content of superpositions of quantum states is investigated based on a measure called {\it concurrence}. Given a bipartite pure state in arbitrary dimension written as the quantum superposition of two other such states, we…
This paper provides the best bounds to date on the number of randomly sampled entries required to reconstruct an unknown low rank matrix. These results improve on prior work by Candes and Recht, Candes and Tao, and Keshavan, Montanari, and…
The Robbins-Monro stochastic approximation algorithm is a foundation of many algorithmic frameworks for reinforcement learning (RL), and often an efficient approach to solving (or approximating the solution to) complex optimal control…
Within the formalism of relativistic quantum field theory an adequate framework for the description of two-particle bound states, such as, for instance, all conventional (i.e., non-exotic) mesons, is provided by the Poincar\'e-covariant…
The $\epsilon$-approximate degree of a Boolean function $f: \{-1, 1\}^n \to \{-1, 1\}$ is the minimum degree of a real polynomial that approximates $f$ to within $\epsilon$ in the $\ell_\infty$ norm. We prove several lower bounds on this…
In this paper we consider the problem of uniformity testing with limited memory. We observe a sequence of independent identically distributed random variables drawn from a distribution $p$ over $[n]$, which is either uniform or is…