Browse/search for people

Publication - Dr Ashley Montanaro

    The Quantum Complexity of Computing Schatten p-norms

    Citation

    Cade, C & Montanaro, A, 2018, ‘The Quantum Complexity of Computing Schatten p-norms’. in: Stacey Jeffery (eds) 13th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2018. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, pp. 4:1-4:20

    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.

    Full details in the University publications repository