Quantum Complexity of Experiments

Abstract
We introduce a theoretical framework to study experimental physics using quantum complexity theory.  This allows us to address: what is the computational complexity of an experiment?  For several 'model' experiments, we prove that there is an exponential savings in resources if the experimentalist can entangle apparatuses with experimental samples.  A novel example is the experimental task of determining the symmetry class of a time evolution operator for a quantum many-body system.  Some of our complexity advantages have been realized on Google's Sycamore processor, demonstrating a real-world advantage for learning algorithms with a quantum memory.

References: ArXiv:2111.05881 ArXiv:2111.05874 ArXiv:2112.00778

About
The purpose of the Team-Net Quantum Computing Colloquium series is to expose Polish and international researchers, as well as interested peers, to the most important recent achievements and trends in the field of quantum computing. Seminars will be taking place on a monthly basis, on Wednesdays at 16:00 CET. Topics of the colloquium include, but are not limited to:

• Near-term quantum algorithms
• Quantum supremacy experiments
• Resource-theoretic approaches to quantum computing
• Quantum machine learning
• Practical quantum error correction and error mitigation
• Mathematical aspects of quantum computing and many-body physics

Webpage of the project: nisq.pl

‍

Zoom details

Link: https://us06web.zoom.us/j/83081794965

Passcode: teamnet