Runtime of unstructured search with a faulty Hamiltonian oracle

We show that it is impossible to obtain a quantum speedup for a faulty Hamiltonian oracle. The effect of dephasing noise to this continuous-time oracle model has first been investigated by Shenvi, Brown, and Whaley [Phys. Rev. A 68, 052313 (2003).]. The authors consider a faulty oracle described by a continuous-time master equation that acts as dephasing noise in the basis determined by the marked item. The analysis focuses on the implementation with a particular driving Hamiltonian. A universal lower bound for this oracle model, which rules out a better performance with a different driving Hamiltonian, has so far been lacking. Here, we derive an adversary-type lower bound which shows that the evolution time T has to be at least in the order of N , i.e., the size of the search space, when the error rate of the oracle is constant. This means that quadratic quantum speedup vanishes and the runtime assumes again the classical scaling. For the standard quantum oracle model this result was first proven by Regev and Schiff [in Automata, Languages and Programming, Lecture Notes in Computer Science Vol. 5125 (Springer, Berlin, 2008), pp. 773–781]. Here, we extend this result to the continuous-time setting

Non-commutative Nash inequalities

A set of functional inequalities - called Nash inequalities - are introduced and analyzed in the context of quantum Markov process mixing. The basic theory of Nash inequalities is extended to the setting of non-commutative Lp spaces, where their relationship to Poincare and log-Sobolev inequalities are fleshed out. We prove Nash inequalities for a number of unital reversible semigroups

Quantum logarithmic Sobolev inequalities and rapid mixing

A family of logarithmic Sobolev inequalities on finite dimensional quantum state spaces is introduced. The framework of non-commutative \bL_p-spaces is reviewed and the relationship between quantum logarithmic Sobolev inequalities and the hypercontractivity of quantum semigroups is discussed. This relationship is central for the derivation of lower bounds for the logarithmic Sobolev (LS) constants. Essential results for the family of inequalities are proved, and we show an upper bound to the generalized LS constant in terms of the spectral gap of the generator of the semigroup. These inequalities provide a framework for the derivation of improved bounds on the convergence time of quantum dynamical semigroups, when the LS constant and the spectral gap are of the same order. Convergence bounds on finite dimensional state spaces are particularly relevant for the field of quantum information theory. We provide a number of examples, where improved bounds on the mixing time of several semigroups are obtained; including the depolarizing semigroup and quantum expanders.Comment: Updated manuscript, 30 pages, no figure

How fast do stabilizer Hamiltonians thermalize?

We present rigorous bounds on the thermalization time of the family of quantum mechanical spin systems known as stabilizer Hamiltonians. The thermalizing dynamics are modeled by a Davies master equation that arises from a weak local coupling of the system to a large thermal bath. Two temperature regimes are considered. First we clarify how in the low temperature regime, the thermalization time is governed by a generalization of the energy barrier between orthogonal ground states. When no energy barrier is present the Hamiltonian thermalizes in a time that is at most quadratic in the system size. Secondly, we show that above a universal critical temperature, every stabilizer Hamiltonian relaxes to its unique thermal state in a time which scales at most linearly in the size of the system. We provide an explicit lower bound on the critical temperature. Finally, we discuss the implications of these result for the problem of self-correcting quantum memories with stabilizer Hamiltonians

A Quantum Version of Sch\"oning's Algorithm Applied to Quantum 2-SAT

We study a quantum algorithm that consists of a simple quantum Markov process, and we analyze its behavior on restricted versions of Quantum 2-SAT. We prove that the algorithm solves this decision problem with high probability for n qubits, L clauses, and promise gap c in time O(n^2 L^2 c^{-2}). If the Hamiltonian is additionally polynomially gapped, our algorithm efficiently produces a state that has high overlap with the satisfying subspace. The Markov process we study is a quantum analogue of Sch\"oning's probabilistic algorithm for k-SAT