相关论文: A quantum lower bound for the collision problem
We prove bounds on operator growth and infinite temperature out-of-time-ordered correlators in many-body systems with $N$ spin-$\frac{1}{2}$ degrees of freedom which interact via two-body all-to-all interactions. Our results parametrically…
The Maximum Matching problem has a quantum query complexity lower bound of $\Omega(n^{3/2})$ for graphs on $n$ vertices represented by an adjacency matrix. The current best quantum algorithm has the query complexity $O(n^{7/4})$, which is…
Let $\phi$ be a smooth function on a compact interval $I$. Let $$\gamma(t)=\left (t,t^2,\cdots,t^{n-1},\phi(t)\right).$$ In this paper, we show that $$\left(\int_I \big|\hat f(\gamma(t))\big|^q \big|\phi^{(n)}(t)\big|^{\frac{2}{n(n+1)}}…
In order to provide a guaranteed precision and a more accurate judgement about the true value of the Cram\'{e}r-Rao bound and its scaling behavior, an upper bound (equivalently a lower bound on the quantum Fisher information) for precision…
Recent work has shown that local supersymmetry on a spacetime boundary in $\mathcal{N}$-extended AdS supergravity in chiral variables implies coupling to a boundary $\mathrm{OSp}(\mathcal{N}|2)_{\mathbb{C}}$ super Chern-Simons theory. We…
We show that $m$ points and $n$ smooth algebraic surfaces of bounded degree in $\mathbb{R}^3$ satisfying suitable nondegeneracy conditions can have at most $O(m^{\frac{2k}{3k-1}}n^{\frac{3k-3}{3k-1}}+m+n)$ incidences, provided that any…
We construct a minimal model within the general class of Pyramid Schemes, which is consistent with both supersymmetry breaking and electroweak symmetry breaking. In order to do computations, we make unjustified approximations to the low…
Large-scale quantum computation will only be achieved if experimentally implementable quantum error correction procedures are devised that can tolerate experimentally achievable error rates. We describe a quantum error correction procedure…
We study quantum algorithms for testing bipartiteness and expansion of bounded-degree graphs. We give quantum algorithms that solve these problems in time O(N^(1/3)), beating the Omega(sqrt(N)) classical lower bound. For testing expansion,…
Given $n$ non-vertical lines in 3-space, their vertical depth (above/below) relation can contain cycles. We show that the lines can be cut into $O(n^{3/2}\mathop{\mathrm{polylog}} n)$ pieces, such that the depth relation among these pieces…
We extend (and somewhat simplify) the algebraic proof technique of Guth and Katz \cite{GK}, to obtain several sharp bounds on the number of incidences between lines and points in three dimensions. Specifically, we show: (i) The maximum…
In this paper, we study the concurrence of arbitrary dimensional tripartite quantum systems. An explicit operational lower bound of concurrence is obtained in terms of the concurrence of sub-states. A given example show that our lower bound…
In this note we provide an explicit lower bound on the spectral gap of one-dimensional Schr\"odinger operators with non-negative bounded potentials and subject to Neumann boundary conditions.
The Element Distinctness problem is to decide whether each character of an input string is unique. The quantum query complexity of Element Distinctness is known to be $\Theta(N^{2/3})$; the polynomial method gives a tight lower bound for…
We consider a system of N nonrelativistic particles of spin 1/2 interacting with the quantized Maxwell field (mass zero and spin one) in the limit when the particles have a small velocity, imposing to the interaction an ultraviolet cutoff,…
We prove some refined asymptotic estimates for postive blowing up solutions to $\Delta u+\epsilon u=n(n-2)u^{\frac{n+2}{n-2}}$ on $\Omega$, $\partial_\nu u=0$ on $\partial\Omega$; $\Omega$ being a smooth bounded domain of $\rn$, $n\geq 3$.…
In this work, we study the phase estimation problem. We show an alternative, simpler and self-contained proof of query lower bounds. Technically, compared to the previous proofs [NW99, Bes05], our proof is considerably elementary.…
Exact low energy expressions are derived for the top-squark and higgs masses, taking into account radiative contributions due to a heavy top quark. Their masses are expressed as analytic functions of $m_{1/2}$, $m_{3/2}$, $m_t$ and…
We propose upper and lower bounds on the maximum success probability for discriminating given quantum states. The proposed upper bound is obtained from a suboptimal solution to the dual problem of the corresponding optimal state…
In this paper, we provide a simple framework for deriving one-shot achievable bounds for some problems in quantum information theory. Our framework is based on the joint convexity of the exponential of the collision relative entropy, and is…