Papers
Topics
Authors
Recent
Search
2000 character limit reached

DQC1-hardness of estimating correlation functions

Published 7 Nov 2024 in quant-ph and cs.CC | (2411.05208v1)

Abstract: Out-of-Time-Order Correlation function measures transport properties of dynamical systems. They are ubiquitously used to measure quantum mechanical quantities, such as scrambling times, criticality in phase transitions, and detect onset of thermalisation. We characterise the computational complexity of estimating OTOCs over all eigenstates and show it is Complete for the One Clean Qubit model (DQC1). We then generalise our setup to establish DQC1-Completeness of N-time Correlation functions over all eigenstates. Building on previous results, the DQC1-Completeness of OTOCs and N-time Correlation functions then allows us to highlight a dichotomy between query complexity and circuit complexity of estimating correlation functions.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.