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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

The Quantum Complexity of Computing Schatten p-norms

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Room GS15 at the William Gates Building and on Zoom: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon Webinar & FW11, Computer Laboratory, William Gates Building. Average on weekdays: 9029.13348416 kWh

Other talks

C2D3 Computational Biology Annual Symposium 2026 Cambridge RNA Club - ONLINE Talk TBC Genomic Medicine CPC Tea and Coffee Break The spread of environmental cost-benefit analysis in UK government, c.1966-1995: representing the public in the Anthropocene
 

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