University of Cambridge > Talks.cam > CQIF Seminar > The Quantum Complexity of Computing Schatten p-norms

The Quantum Complexity of Computing Schatten p-norms

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Steve Brierley.

In this talk I will present some results on the quantum complexity of computing Schatten p-norms and related quantities. We 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.

This talk is part of the CQIF Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2017 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity