License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TQC.2015.163
URN: urn:nbn:de:0030-drops-55556
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/5555/
Go to the corresponding LIPIcs Volume Portal

Brandeho, Mathieu ; Roland, Jérémie

A Universal Adiabatic Quantum Query Algorithm

pdf-format:
11.pdf (0.5 MB)

Abstract

Quantum query complexity is known to be characterized by the so-called quantum adversary bound. While this result has been proved in the standard discrete-time model of quantum computation, it also holds for continuous-time (or Hamiltonian-based) quantum computation, due to a known equivalence between these two query complexity models. In this work, we revisit this result by providing a direct proof in the continuous-time model. One originality of our proof is that it draws new connections between the adversary bound, a modern technique of theoretical computer science, and early theorems of quantum mechanics. Indeed, the proof of the lower bound is based on Ehrenfest's theorem, while the upper bound relies on the adiabatic theorem, as it goes by constructing a universal adiabatic quantum query algorithm. Another originality is that we use for the first time in the context of quantum computation a version of the adiabatic theorem that does not require a spectral gap.

BibTeX - Entry

@InProceedings{brandeho_et_al:LIPIcs:2015:5555,
  author =	{Mathieu Brandeho and J{\'e}r{\'e}mie Roland},
  title =	{{A Universal Adiabatic Quantum Query Algorithm}},
  booktitle =	{10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015)},
  pages =	{163--179},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-96-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{44},
  editor =	{Salman Beigi and Robert Koenig},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/5555},
  URN =		{urn:nbn:de:0030-drops-55556},
  doi =		{10.4230/LIPIcs.TQC.2015.163},
  annote =	{Keywords: Quantum Algorithms, Query Complexity, Adiabatic Quantum Computation, Adversary Method}
}

Keywords: Quantum Algorithms, Query Complexity, Adiabatic Quantum Computation, Adversary Method
Collection: 10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015)
Issue Date: 2015
Date of publication: 04.11.2015

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI