Limitations to the speed of evolution of quantum systems, typically referred to as quantum speed limits (QSLs), have important consequences for quantum control problems. However, in its standard formulation, is not straightforward to obtain meaningful QSL bounds for time-dependent Hamiltonians with unknown control parameters. In this paper we present a short introductory overview of quantum speed limit for unitary dynamics and its connection to quantum control. We then analyze potential methods for obtaining new bounds on control times inspired by the QSL. We finally extend the work in [Poggi, Lombardo and Wisniacki EPL 104 40005 (2013)] by studying the properties and limitations of these new bounds in the context of a driven two-level quantum system
We derive generalized quantum speed limit inequalities that represent limitations on the time evolution of quantum states. They are extensions of the original inequality and are applied to the overlap between the time-evolved state and an arbitrary state. We can discuss the lower limit of the overlap, in addition to the upper limit as in the original inequality, which allows us to estimate the minimum time for the evolution toward a target state. The inequalities are written by using an arbitrary reference state and are flexibly used to obtain a tight bound. We demonstrate these properties by …
The authors claim that they "strictly" closed locality loophole, but their work does not close the locality loophole. there are at least two local transinformation explanations. The two explanations are the counter-examples of their claim. No reason can make a conclusion be right when there are counter-examples of the conclusion. And the two explanations also illustrate that the space-time diagrams of the paper have at least two problems.
The quantum speed limit provides a fundamental bound on how fast a quantum system can evolve between the initial and the final states under any physical operation. The celebrated Mandelstam-Tamm (MT) bound has been widely studied for various quantum systems undergoing unitary time evolution. Here, we prove a new quantum speed limit using the tighter uncertainty relations for pure quantum systems undergoing arbitrary unitary evolution. We also derive a tighter uncertainty relation for mixed quantum states and then derive a new quantum speed limit for mixed quantum states from it such that it re…
The ability to identify cause-effect relations is an essential component of the scientific method. The identification of causal relations is generally accomplished through statistical trials where alternative hypotheses are tested against each other. Traditionally, such trials have been based on classical statistics. However, classical statistics becomes inadequate at the quantum scale, where a richer spectrum of causal relations is accessible. Here we show that quantum strategies can greatly speed up the identification of causal relations. We analyse the task of identifying the effect of a gi…
The quantum speed limit (QSL) is the theoretical lower limit of the time for a quantum system to evolve from a given state to another one. Interestingly, it has been shown that non-Markovianity can be used to speed-up the dynamics and to lower the QSL time, although this behavior is not universal. In this paper we further carry on the investigation on the connection between QSL and non-Markovianity by looking at the effects of P- and CP-divisibility of the dynamical map to the quantum speed limit. We show that the speed-up can also be observed under P- and CP-divisible dynamics, and that the s…
Recently, Chau [Quant. Inform. & Comp. 11, 721 (2011)] found a family of metrics and pseudo-metrics on $n$-dimensional unitary operators that can be interpreted as the minimum resources (given by certain tight quantum speed limit bounds) needed to transform one unitary operator to another. This result is closely related to the weighted $\ell^1$-norm on ${\mathbb R}^n$. Here we generalize this finding by showing that every weighted $\ell^p$-norm on ${\mathbb R}^n$ with $1\le p \le \limitingp$ induces a metric and a pseudo-metric on $n$-dimensional unitary operators with quantum information-theo…
Deffner and Lutz [J. Phys. A 46, 335302 (2013) and Phys. Rev. Lett. 111, 010402 (2013).] extended the Mandelstam-Tamm bound and the Margolus-Levitin bound to time-dependent and non-Markovian systems, respectively. Although the derivation of the Mandelstam-Tamm bound is correct, we point out that thier analysis of the Margolus-Levitin bound is incorrect. The Margolus-Levitin bound has not yet been established in time-dependent quantum systems, except for the adiabatic case.
The reverse quantum speed limit (RQSL) gives an upper limit to the time for evolution between initial and final quantum states. We show that, in conjunction with the existence of a minimum time scale, the RQSL implies a lower limit to the norm of the change in a quantum state, and confirm that this limit is satisfied in two-state and ideal-measurement models. Such a lower limit is of relevance for interpretational issues in probability and for understanding the meaning of probability in Everett quantum theory.
This paper initiates the study of quantum algorithms for matroid property problems. It is shown that quadratic quantum speedup is possible for the calculation problem of finding the girth or the number of circuits (bases, flats, hyperplanes) of a matroid, and for the decision problem of deciding whether a matroid is uniform or Eulerian, by giving a uniform lower bound $Ω(\sqrt{\binom{n}{\lfloor n/2\rfloor}})$ on the query complexity for all these problems. On the other hand, for the uniform matroid decision problem, an asymptotically optimal quantum algorithm is proposed which achieves the low…
Grover's algorithm constitutes the optimal quantum solution to the search problem and provides a quadratic speed-up over all possible classical search algorithms. Quantum interference between computational paths has been posited as a key resource behind this computational speed-up. However there is a limit to this interference, at most pairs of paths can ever interact in a fundamental way. Could more interference imply more computational power? Sorkin has defined a hierarchy of possible interference behaviours---currently under experimental investigation---where classical theory is at the firs…
The evaluation of the minimal evolution time between two distinguishable states of a system is important for assessing the maximal speed of quantum computers and communication channels. Lower bounds for this minimal time have been proposed for unitary dynamics. Here we show that it is possible to extend this concept to nonunitary processes, using an attainable lower bound that is connected to the quantum Fisher information for time estimation. This result is used to delimit the minimal evolution time for typical noisy channels.
We investigated the quantum speed limit time of a qubit system with non-Hermitian detuning. Our results show that, with respect to two distinguishable states of the non-Hermitian system, the evolutionary time does not have a nonzero lower bound. And the quantum evolution of the system can be effectively accelerated by adjusting the non-Hermitian detuning parameter, as well as the quantum speed limit time can be arbitrarily small even be zero.
In this paper, we investigate the relationship between the quantum speedup, nonMarkovianity and formation of a system-environment bound state. Previous results show a monotonic relation between these three such that providing stronger bound states can lead to a higher degree of non-Markovianity, and hence to greater speed of quantum evolution. By studying dynamics of a dissipative two-level system or a V-type three-level system in the presence of similar and additional systems, we reveal that the quantum speedup is exclusively related to the formation of the system-environment bound state, whi…
The Bhatia-Davis theorem provides a useful upper bound for the variance in mathematics, and in quantum mechanics, the variance of a Hamiltonian is naturally connected to the quantum speed limit due to the Mandelstam-Tamm bound. Inspired by this connection, we construct a formula, referred to as the Bhatia-Davis formula, for the characterization of the quantum speed limit in the Bloch representation. We first prove that the Bhatia-Davis formula is an upper bound for a recently proposed operational definition of the quantum speed limit, which means it can be used to reveal the closeness between …
The uncertainty of measurement on a quantum system can be reduced in presence of quantum memory [M. Berta et. al. Nature Phys. {\bf 6}, 659 (2010)]. By measurement on quantum memory, some information (non-classical information) is inaccessible, hence, it limits the lower bound of entropic uncertainty relation. In the present work, we improve the lower bound of entropic uncertainty relation in presence of quantum memory by considering inaccessibility of non classical correlation at Bob side and also compare the lower bound given by M. Berta et. al. and our prescription for two different kind of…
The "speed" of unitary quantum evolution was recently shown to be connected to entanglement in multipartite quantum systems. Here, we discuss a tighter version of the Mandelstam-Tamm uncertainty relation that depends on the Fisher information. The passage time is estimated by a lower bound that depends inversely proportional to the square root of the Fisher information. This leads to a better understanding of the origin of a fast quantum time evolution of entangled states.
In quantum field theory, virtual particles are carriers of relativistic wave fields, participate in vacuum fluctuations, and are a consequence of the implementation of the quantum uncertainty mechanism. Virtual particles, playing a fundamental role in our understanding and description of interaction processes, are themselves inaccessible to direct observation and measurement of their dynamic characteristics. We prove that the well-known Heisenberg uncertainty relations and Landau-Peierls uncertainty relations implicitly contain new "hidden" angular variables. On the basis of the relations obta…
Many computational problems are subject to a quantum speed-up: one might find that a problem having an O(n^3)-time or O(n^2)-time classic algorithm can be solved by a known O(n^1.5)-time or O(n)-time quantum algorithm. The question naturally arises: how much quantum speed-up is possible? The area of fine-grained complexity allows us to prove optimal lower-bounds on the complexity of various computational problems, based on the conjectured hardness of certain natural, well-studied problems. This theory has recently been extended to the quantum setting, in two independent papers by Buhrman, Patr…
We discuss our recent study of local quantum mechanical uncertainty relations in quantum many body systems. These lead to fundamental bounds for quantities such as the speed, acceleration, relaxation times, spatial gradients and the Lyapunov exponents. We additionally obtain bounds on various transport coefficients like the viscosity, the diffusion constant, and the thermal conductivity. Some of these bounds are related to earlier conjectures, such as the bound on chaos by Maldacena, Shenker and Stanford while others are new. Our approach is a direct way of obtaining exact bounds in fairly gen…
The presence of noise or the interaction with an environment can radically change the dynamics of observables of an otherwise isolated quantum system. We derive a bound on the speed with which observables of open quantum systems evolve. This speed limit divides into Mandalestam and Tamm's original time-energy uncertainty relation and a time-information uncertainty relation recently derived for classical systems, generalizing both to open quantum systems. By isolating the coherent and incoherent contributions to the system dynamics, we derive both lower and upper bounds to the speed of evolutio…
We study the first-order convex optimization problem, where we have black-box access to a (not necessarily smooth) function $f:\mathbb{R}^n \to \mathbb{R}$ and its (sub)gradient. Our goal is to find an $ε$-approximate minimum of $f$ starting from a point that is distance at most $R$ from the true minimum. If $f$ is $G$-Lipschitz, then the classic gradient descent algorithm solves this problem with $O((GR/ε)^{2})$ queries. Importantly, the number of queries is independent of the dimension $n$ and gradient descent is optimal in this regard: No deterministic or randomized algorithm can achieve be…
Bounds to the speed of evolution of a quantum system are of fundamental interest in quantum metrology, quantum chemical dynamics and quantum computation. We derive a time-energy uncertainty relation for open quantum systems undergoing a general, completely positive and trace preserving (CPT) evolution which provides a bound to the quantum speed limit. When the evolution is of the Lindblad form, the bound is analogous to the Mandelstam-Tamm relation which applies in the unitary case, with the role of the Hamiltonian being played by the adjoint of the generator of the dynamical semigroup. The ut…
QuSoft（量子软件联盟）；CWI（荷兰国家数学与计算机科学研究所）；University of Amsterdam（阿姆斯特丹大学）
Lasso and Ridge are important minimization problems in machine learning and statistics. They are versions of linear regression with squared loss where the vector $θ\in\mathbb{R}^d$ of coefficients is constrained in either $\ell_1$-norm (for Lasso) or in $\ell_2$-norm (for Ridge). We study the complexity of quantum algorithms for finding $\varepsilon$-minimizers for these minimization problems. We show that for Lasso we can get a quadratic quantum speedup in terms of $d$ by speeding up the cost-per-iteration of the Frank-Wolfe algorithm, while for Ridge the best quantum algorithms are linear in…
The focus of this paper is on {\em quantum distributed} computation, where we investigate whether quantum communication can help in {\em speeding up} distributed network algorithms. Our main result is that for certain fundamental network problems such as minimum spanning tree, minimum cut, and shortest paths, quantum communication {\em does not} help in substantially speeding up distributed algorithms for these problems compared to the classical setting. In order to obtain this result, we extend the technique of Das Sarma et al. [SICOMP 2012] to obtain a uniform approach to prove non-trivial l…
