Related papers: A generic quantum Wielandt's inequality
We prove concentration bounds for the following classes of quantum states: (i) output states of shallow quantum circuits, answering an open question from [DPMRF22]; (ii) injective matrix product states; (iii) output states of dense…
Quantum resources like entanglement and magic are essential for characterizing the complexity of quantum states. However, when the number of copies of quantum states and the computational time are limited by numbers polynomial in the system…
We prove tight lower bounds for the following variant of the counting problem considered by Aaronson, Kothari, Kretschmer, and Thaler (2020). The task is to distinguish whether an input set $x\subseteq [n]$ has size either $k$ or…
The concept of quantum speed limit-time (QSL) was initially introduced as a lower bound to the time interval that a given initial state $\psi_I$ may need so as to evolve into a state orthogonal to itself. Recently [V. Giovannetti, S. Lloyd,…
It is an established fact that entanglement is a resource. Sharing an entangled state leads to non-local correlations and to violations of Bell inequalities. Such non-local correlations illustrate the advantage of quantum resources over…
Quantum data processing inequality bounds the set of bipartite states that can be generated by two far apart parties under local operations; Having access to a bipartite state as a resource, two parties cannot locally transform it to…
We give a new version of the adversary method for proving lower bounds on quantum query algorithms. The new method is based on analyzing the eigenspace structure of the problem at hand. We use it to prove a new and optimal strong direct…
Let P be a set of n weighted points, Q be a set of m unweighted points in the plane, and k a non-negative integer. We consider the problem of computing a subset $Q'\subseteq Q$ with size at most k such that the sum of the weights of the…
We study the classical compilation of quantum circuits for the preparation of matrix product states (MPS), which are quantum states of low entanglement with an efficient classical description. Our algorithm represents a near-term…
Given $n$ elements, an integer $k$ and a parameter $\varepsilon$, we study to select an element with rank in $(k-n\varepsilon,k+n\varepsilon]$ using unreliable comparisons where the outcome of each comparison is incorrect independently with…
We provide a method to describe quantum nonlocality for $n$-qubit systems. By treating the correlation function as an $n$-index tensor, we derive a generalized Bell inequality. Taking generalized Greenberger-Horne-Zeilinger (GHZ) state for…
Topological quantum computing is an alternative framework for avoiding the quantum decoherence problem in quantum computation. The problem of executing a gate in this framework can be posed as the problem of braiding quasiparticles. Because…
In this work we determine a lower bound to the mean value of the quantum potential for an arbitrary state. Furthermore, we derive a generalized uncertainty relation that is stronger than the Robertson-Schr\"odinger inequality and hence also…
Before global-scale quantum networks become operational, it is important to consider how to evaluate their performance so that they can be built to achieve the desired performance. We propose two practical figures of merit for the…
A classic no-go theorem in one-dimensional quantum mechanics can be evaded when the potentials are unbounded below, thus allowing for novel parity-paired degenerate energy bound states. We numerically determine the spectrum of one such…
Phenomenological approaches to quantum gravity try to infer model-independent laws by analyzing thought experiments and combining both quantum, relativistic, and gravitational ingredients. We first review these ingredients -three basic…
The logical consistency of a description of Quantum Theory in the context of General Relativity, which includes Minimal Coupling Principle, is analyzed from the point of view of Feynman's formulation in terms of path integrals. We will…
Consider a compact connected Lie group $G$ and the corresponding Lie algebra $\cal L$. Let $\{X_1,...,X_m\}$ be a set of generators for the Lie algebra $\cal L$. We prove that $G$ is uniformly finitely generated by $\{X_1,...,X_m\}$. This…
The Lie--Trotter product formula is a foundational approximation for the quantum partition function, yet obtaining rigorous error bounds for the unbounded Hamiltonians common in physics remains a significant challenge. This paper provides a…
Quantum relative entropy, a quantum generalization of the renowned Kullback-Leibler divergence, serves as a fundamental measure of the distinguishability between quantum states and plays a pivotal role in quantum information science.…