License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TQC.2018.4
URN: urn:nbn:de:0030-drops-92513
URL: http://drops.dagstuhl.de/opus/volltexte/2018/9251/
Go to the corresponding LIPIcs Volume Portal


Cade, Chris ; Montanaro, Ashley

The Quantum Complexity of Computing Schatten p-norms

pdf-format:
LIPIcs-TQC-2018-4.pdf (0.4 MB)


Abstract

We consider the quantum complexity of computing Schatten p-norms and related quantities, and find that the problem of estimating these quantities is closely related to the one clean qubit model of computation. We show that the problem of approximating Tr(|A|^p) for a log-local n-qubit Hamiltonian A and p=poly(n), up to a suitable level of accuracy, is contained in DQC1; and that approximating this quantity up to a somewhat higher level of accuracy is DQC1-hard. In some cases the level of accuracy achieved by the quantum algorithm is substantially better than a natural classical algorithm for the problem. The same problem can be solved for arbitrary sparse matrices in BQP. One application of the algorithm is the approximate computation of the energy of a graph.

BibTeX - Entry

@InProceedings{cade_et_al:LIPIcs:2018:9251,
  author =	{Chris Cade and Ashley Montanaro},
  title =	{{The Quantum Complexity of Computing Schatten p-norms}},
  booktitle =	{13th Conference on the Theory of Quantum Computation,  Communication and Cryptography (TQC 2018)},
  pages =	{4:1--4:20},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-080-4},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{111},
  editor =	{Stacey Jeffery},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9251},
  URN =		{urn:nbn:de:0030-drops-92513},
  doi =		{10.4230/LIPIcs.TQC.2018.4},
  annote =	{Keywords: Schatten p-norm, quantum complexity theory, complexity theory, one clean qubit model}
}

Keywords: Schatten p-norm, quantum complexity theory, complexity theory, one clean qubit model
Seminar: 13th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2018)
Issue Date: 2018
Date of publication: 11.07.2018


DROPS-Home | Imprint | Privacy Published by LZI