Quantum supremacy in driven quantum many-body systems

Abstract

A crucial milestone in the field of quantum simulation and computation is to demonstrate that a quantum device can compute certain tasks that are impossible to reproduce by a classical computer with any reasonable resources. Such a demonstration is referred to as quantum supremacy. One of the most important questions is to identify setups that exhibit quantum supremacy and can be implemented with current quantum technology. The two standard candidates are boson sampling and random quantum circuits. Here, we show that quantum supremacy can be obtained in generic periodically-driven quantum many-body systems. Our analysis is based on the eigenstate thermalization hypothesis and strongly-held conjectures in complexity theory. To illustrate our work, We give examples of simple disordered Ising chains driven by global magnetic fields and Bose-Hubbard chains with modulated hoppings. Our proposal opens the way for a large class of quantum platforms to demonstrate and benchmark quantum supremacy.

References in corpus (16)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum computational advantage using photons
• Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
• Strong quantum computational advantage using a superconducting quantum processor
• Photonic Boson Sampling in a Tunable Circuit
• Equilibrium states of generic quantum systems subject to periodic driving
• Boson sampling with 20 input photons in 60-mode interferometers at $10^{14}$ state spaces
• Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
• Testing whether all eigenstates obey the Eigenstate Thermalization Hypothesis
• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
• Unsupervised Machine Learning on a Hybrid Quantum Computer
• Computational advantage of quantum random sampling
• Quantum Supremacy for Simulating A Translation-Invariant Ising Spin Model
• Expressibility and trainability of parameterized analog quantum systems for machine learning applications
• Quantum supremacy and quantum phase transitions
• Quantifying Quantum Computational Advantage on a Processor of Ultracold Atoms

Cited by in corpus (3)

• Quantifying Quantum Computational Advantage on a Processor of Ultracold Atoms
• High performance Boson Sampling simulation via data-flow engines
• DisQu: Investigating the Impact of Disorder in Quantum Generative Models