相关论文: A generic quantum Wielandt's inequality

Let $ \nu $ be a probability distribution over the linear semi-group $ \mathrm{End}(E) $ for $ E $ a finite dimensional vector space over a locally compact field. We assume that $ \nu $ is proximal, strongly irreducible and that $…

It is well known that under general regularity conditions the distribution of the maximum likelihood estimator (MLE) is asymptotically normal. Very recently, bounds of the optimal order $O(1/\sqrt n)$ on the closeness of the distribution of…

Quantum inequalities are lower bounds for local averages of quantum observables that have positive classical counterparts, such as the energy density or the Wick square. We establish such inequalities in general (possibly interacting)…

Optimization drives advances in quantum science and machine learning, yet most generative models aim to mimic data rather than to discover optimal answers to challenging problems. Here we present a variational generative optimization…

A leading proposal for verifying near-term quantum supremacy experiments on noisy random quantum circuits is linear cross-entropy benchmarking. For a quantum circuit $C$ on $n$ qubits and a sample $z \in \{0,1\}^n$, the benchmark involves…

We provide an analytical tripartite-study from the generalized $R$-matrix. It provides the upper bound of the maximum violation of Mermin's inequality. For a generic 2-qubit pure state, the concurrence or $R$-matrix characterizes the…

An ensemble of product states is said to exhibit "quantum nonlocality without entanglement" if the states cannot be optimally discriminated by local operations and classical communication (LOCC). We show that this property can depend on the…

By combining the Minkowski inequality and the quantum Chernoff bound, we derive easy-to-compute upper bounds for the error probability affecting the optimal discrimination of Gaussian states. In particular, these bounds are useful when the…

The entropy accumulation theorem states that the smooth min-entropy of an $n$-partite system $A = (A_1, \ldots, A_n)$ is lower-bounded by the sum of the von Neumann entropies of suitably chosen conditional states up to corrections that are…

A general inequality between entanglement entropy and a number of topologically ordered states is derived, even without using the properties of the parent Hamiltonian or the formalism of topological quantum field theory. Given a quantum…

We analyze the properties of entangled random pure states of a quantum system partitioned into two smaller subsystems of dimensions $N$ and $M$. Framing the problem in terms of random matrices with a fixed-trace constraint, we establish,…

We show that, as in the case of the principle of minimum action in classical and quantum mechanics, there exists an even more general principle in the very fundamental structure of {\it quantum space-time}: This is the principle of {\it…

We prove that any exact quantum algorithm searching an ordered list of N elements requires more than \frac{1}{\pi}(\ln(N)-1) queries to the list. This improves upon the previously best known lower bound of {1/12}\log_2(N) - O(1). Our proof…

We study the distribution of overlaps with the computational basis of a quantum state generated under generic quantum many-body chaotic dynamics, without conserved quantities, for a finite time $t$. We argue that, scaling time…

In this paper we slightly improve the regularity theory for the so called optimal design problem. We first establish the uniform rectifiability of the boundary of the optimal set, for a larger class of minimizers, in any dimension. As an…

The generalized quantum Stein's lemma provides an explicit expression for the optimal error exponent when distinguishing many independent and identically distributed (iid) copies of a given bipartite state from the set of separable…

We provide an $\Omega(log(n))$ lower bound for the depth of any quantum circuit generating the unique groundstate of Kitaev's spherical code. No circuit-depth lower bound was known before on this code in the general case where the gates can…

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…

A contemporary technological milestone is to build a quantum device performing a computational task beyond the capability of any classical computer, an achievement known as quantum adversarial advantage. In what ways can the entanglement…

In this paper we take a probabilistic look at Maclaurin's inequality, which is a refinement of the classical AM-GM inequality. In a natural randomized setting, we obtain limit theorems and show that a reverse inequality holds with high…