相关论文: A generic quantum Wielandt's inequality
We consider a random symmetric matrix ${\bf X} = [X_{jk}]_{j,k=1}^n$ with upper triangular entries being i.i.d. random variables with mean zero and unit variance. We additionally suppose that $\mathbb E |X_{11}|^{4 + \delta} =:…
The local Hamiltonian problem consists of estimating the ground-state energy (given by the minimum eigenvalue) of a local quantum Hamiltonian. First, we show the existence of a good product-state approximation for the ground-state energy of…
Quantum correlations are the singular, defining resource of quantum information science and metrology, forming the basis of every operational advantage that quantum systems hold over classical ones. Yet exact bounds on these…
We study an online vector balancing problem, in which $n$ independent Gaussian random vectors $\boldsymbol{\zeta}(1),\dots,\boldsymbol{\zeta}(n) \sim \mathcal{N}(0, I_n)$, each of dimension $n$, arrive one at a time. The goal is to choose…
Worldline quantum inequalities provide lower bounds on weighted averages of the renormalised energy density of a quantum field along the worldline of an observer. In the context of real, linear scalar field theory on an arbitrary globally…
Under reasonable algebraic assumptions and under an infinite second order moment assumption, we show that the logarithm of the norm (log-norm) of a product of random i.i.d. matrices with entries in $\mathbb{R}$ or in any other local field…
In communication complexity-like problems, previous studies have shown either an exponential quantum advantage or an unbounded quantum advantage with an exponentially large input set $\Theta(2^{n})$ bits with respect to classical…
In the framework of deterministic finslerian models, a mechanism producing dissipative dynamics at the Planck scale is discussed. It is based on a geometric evolution from Finsler to Riemann structures defined on the fiber bundle ${ TM}\to…
The generalized Dickman distribution ${\cal D}_\theta$ with parameter $\theta>0$ is the unique solution to the distributional equality $W=_d W^*$, where \begin{eqnarray} W^*=_d U^{1/\theta}(W+1) \qquad (1) \end{eqnarray} with $W$…
Under successive Renormalization Group transformations applied to a quantum state $\ket{\Psi}$ of finite correlation length $\xi$, there is typically a loss of entanglement after each iteration. How good it is then to replace $\ket{\Psi}$…
Consider the Klein-Gordon equation (KGE) in $\R^n$, $n\ge 2$, with constant or variable coefficients. We study the distribution $\mu_t$ of the random solution at time $t\in\R$. We assume that the initial probability measure $\mu_0$ has zero…
Quantum channel discrimination is a fundamental problem in quantum information science. In this study, we consider general quantum channel discrimination problems, and derive the lower bounds of the error probability. Our lower bounds are…
We solve a problem, which while not fitting into the usual paradigm, can be viewed as a quantum computation. Suppose we are given a quantum system described by an N dimensional Hilbert space with a Hamiltonian of the form $E |w >< w|$ where…
We propose a new measure of non-classicality of quantum gates which is particularly suitable for probabilistic devices. This measure enables to compare, e.g., deterministic devices which prepare entangled states with low amount of…
It is now experimentally possible to entangle thousands of qubits, and efficiently measure each qubit in parallel in a distinct basis. To fully characterize an unknown entangled state of $n$ qubits, one requires an exponential number of…
The scaled standard Wigner matrix (symmetric with mean zero, variance one i.i.d. entries), and its limiting eigenvalue distribution, namely the semi-circular distribution, has attracted much attention. The $2k$th moment of the limit equals…
One of the most important quantum algorithms ever discovered is Grover's algorithm for searching an unordered set. We give a new lower bound in the query model which proves that Grover's algorithm is exactly optimal. Similar to existing…
In this paper we provide new quantum algorithms with polynomial speed-up for a range of problems for which no such results were known, or we improve previous algorithms. First, we consider the approximation of the frequency moments $F_k$ of…
Let $\prec$ be the product order on $\mathbb{R}^k$ and assume that $X_1,X_2,\ldots,X_n$ ($n\geq3$) are i.i.d. random vectors distributed uniformly in the unit hypercube $[0,1]^k$. Let $S$ be the (random) set of vectors in $\mathbb{R}^k$…
Distance metrics are central to machine learning, yet distances between ensembles of quantum states remain poorly understood due to fundamental quantum measurement constraints. We introduce a hierarchy of integral probability metrics,…