Determining whether a quantum evolution can be efficiently simulated classically is central to understanding the boundary between classical and quantum computation. However, polynomial-time simulability is an asymptotic statement, and does not by itself determine whether the (quantum-inspired) classical simulation is actually practical. Indeed, different polynomial scalings can lead to vastly different computational costs, particularly when expensive preprocessing or quantum data acquisition is required. In this work, we ask whether classically simulable quantum dynamics are in practice more resource-efficient to simulate classically than to execute directly on quantum hardware. We analyze this question using three resource metrics, quantum sample, quantum time, and classical time complexity, for several widely studied classically simulable circuit families. Using representative hardware-level estimates, we identify regimes in which quantum simulation can be faster despite the existence of a polynomial-time classical algorithm, as well as regimes in which classical simulation remains more efficient. At the same time, the large quantum sampling cost needed to characterize unknown input states can make this polynomial-time classical simulation prohibitively expensive with current cloud-based hardware access prices. Ultimately, our work indicates that guarantees of classical simulability with polynomial resources alone are insufficient to determine the preferred implementation.
The threshold for quantum-classical correspondence is D∼ℏ34
In chaotic quantum systems, an initially localized quantum state can deviate strongly from the corresponding classical phase-space distribution after the Ehrenfest time tE∼log(ℏ−1), even in the limit ℏ→0. Decoherence by the environment is often invoked to explain the persistence of the quantum-classical correspondence at longer timescales. Recent rigorous results for Lindblad dynamics with phase-space diffusion strength D show that quantum and classical evolutions remain close for times that are exponentially longer than the Ehrenfest time whenever D≫ℏ34, in units set by the classical Hamiltonian. At the same time, some heuristic arguments have suggested the weaker condition D≫ℏ2 always suffices. Here we construct an explicit Lindbladian that demonstrates that the scaling D∼ℏ34 is indeed the threshold for quantum-classical correspondence beyond the Ehrenfest time. Our example uses a smooth time-dependent Hamiltonian and linear Lindblad operators generating homogeneous isotropic diffusion. It exhibits an ℏ-independent quantum-classical discrepancy at the Ehrenfest time whenever D≪ℏ34, even for ℏ-independent "macroscopic" smooth observables.
We give an algorithm for the hidden subgroup problem for the dihedral group DN, or equivalently the cyclic hidden shift problem, that supersedes our first algorithm and is suggested by Regev's algorithm. It runs in exp(O(logN)) quantum time and uses exp(O(logN)) classical space, but only O(logN) quantum space. The algorithm also runs faster with quantumly addressable classical space than with fully classical space. In the hidden shift form, which is more natural for this algorithm regardless, it can also make use of multiple hidden shifts. It can also be extended with two parameters that trade classical space and classical time for quantum time. At the extreme space-saving end, the algorithm becomes Regev's algorithm. At the other end, if the algorithm is allowed classical memory with quantum random access, then many trade-offs between classical and quantum time are possible.