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

One of the fundamental physical limits on the speed of time evolution of a quantum state is known in the form of the celebrated Mandelstam-Tamm inequality. This inequality gives an answer to the question on how fast an isolated quantum…

We consider the periods of the linear congruential and the power generators modulo $n$ and, for fixed choices of initial parameters, give lower bounds that hold for ``most'' $n$ when $n$ ranges over three different sets: the set of primes,…

Quantum gravity theories predict a minimal length at the order of magnitude of the Planck length, under which the concepts of space and time lose every physical meaning. In quantum mechanics, the insurgence of such minimal length can be…

The capacity of a quantum gate to produce entangled states on a bipartite system is quantified in terms of the entangling power. This quantity is defined as the average of the linear entropy of entanglement of the states produced after…

We analyze various scenarios for entangling two initially unentangled qubits. In particular, we propose an optimal universal entangler which entangles a qubit in unknown state $|\Psi>$ with a qubit in a reference (known) state $|0>$. That…

In this paper we construct quantum algorithms for matrix products over several algebraic structures called semirings, including the (max,min)-matrix product, the distance matrix product and the Boolean matrix product. In particular, we…

The closest pair problem is a fundamental problem of computational geometry: given a set of $n$ points in a $d$-dimensional space, find a pair with the smallest distance. A classical algorithm taught in introductory courses solves this…

We relate the the distinguishability of quantum states with their robustness of the entanglement, where the robustness of any resource quantifies how tolerant it is to noise. In particular, we identify upper and lower bounds on the…

We consider three-partite pure states in the Hilbert space $\mathbb{C}^2 \otimes \mathbb{C}^m \otimes \mathbb{C}^n$ and investigate to which states a given state can be locally transformed with a non-vanishing probability. Whenever the…

We discuss a formulation of quantum field theory on quantum space time where the perturbation expansion of the S-matrix is term by term ultraviolet finite. The characteristic feature of our approach is a quantum version of the Wick product…

We propose a new Wigner inequality suitable for test of the hypothesis of realism. We show that this inequality is not identical neither to the well-known Wigner inequality nor to the Leggett-Garg inequality in Wigner form. The obtained…

Let $\nu$ be a probability distribution over the semi-group of square matrices of size $d \ge 2$ over a locally compact field $\mathbb{K}$, \textit{e.g.} $\mathbb{R}$. We consider the random walk $\overline{\gamma}_n :=…

Inequalities of Mandelstam-Tamm and Margolus-Levitin type provide lower bounds on the time it takes for a quantum system to evolve from one state into another. Knowledge of such bounds, called quantum speed limits, is of utmost importance…

Determining the ultimate limits of quantum communication, such as the quantum capacity of a channel and the distillable entanglement of a shared state, remains a central challenge in quantum information theory, primarily due to the…

We propose a novel framework for the quantum geometry of expectation values over arbitrary sets of operators and establish a link between this geometry and the eigenstates of Hamiltonian families generated by these operators. We show that…

We derive explicit bounds for the average entropy characterizing measurements of a pure quantum state of size $N$ in $L$ orthogonal bases. Lower bounds lead to novel entropic uncertainty relations, while upper bounds allow us to formulate…

De Finetti theorems tell us that if we expect the likelihood of outcomes to be independent of their order, then these sequences of outcomes could be equivalently generated by drawing an experiment at random from a distribution, and…

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…

A fundamental question asks how uniformly finite sets of pure quantum states can be distributed in a Hilbert space. The Welch bounds address this question, and are saturated by $k$-designs, i.e. sets of states reproducing the $k$-th Haar…

Local Hamiltonians with topological quantum order exhibit highly entangled ground states that cannot be prepared by shallow quantum circuits. Here, we show that this property may extend to all low-energy states in the presence of an on-site…