Peter Zoller: Hybrid Classical-Quantum Algorithms on Programmable Quantum Simulators

Channel:
Subscribers:
2,450
Published on ● Video Link: https://www.youtube.com/watch?v=ZsK9whs_3EE



Duration: 50:01
323 views
0


A talk by Peter Zoller at the Workshop on Noisy Intermediate-Scale Quantum Technologies (NISQ), Day 2. NISQ was hosted June 6-7, 2019 by the Joint Center for Quantum Information and Computer Science at the University of Maryland (QuICS). More information about NISQ can be found at https://www.tqcconference.org.

Abstract: Programmable analog quantum simulators have recently emerged as a new paradigm in quantum information processing. In contrast to the universal quantum computer, programmable quantum simulators are non-universal quantum devices with restricted sets of quantum  operations, which however can be naturally scaled to a large number of qubits. In this talk we will focus on programmable analog quantum simulators with trapped ions and Rydberg tweezer arrays, and discuss various scenarios and applications of programming these quantum machines. We show results from a theory-experiment collaboration at Innsbruck demonstrating hybrid classical-quantum algorithms where  a 20 quit ion analog simulator computes the energy of the ground state of a lattice Schwinger model representing 1D QED. Remarkably, in this experiment we can not only compute the energy on the quantum co-processor but also the algorithmic error (error bar of the energy) by measuring the energy variance. Further examples include theoretical studies where variational algorithms are applied to generate optimal spin squeezed states for given (restricted) quantum resources provided by Rydberg tweezer arrays with application in quantum sensing. We conclude with a discussion of the generic question of cross platform verification of quantum computers and quantum simulators, where the goal is to compare quantum devices on the level of many-qubit wavefunctions in present day experiments.




Other Videos By QuICS


2020-06-04Steve Flammia: Characterization of Solvable Spin Models via Graph Invariants
2020-05-20Aram Harrow: Small Quantum Computers and Large Classical Data Sets
2020-02-05Dominik Hangleiter: (How) can we verify quantum supremacy?
2020-02-05Giacomo Torlai: Enhancing Quantum Simulators with Neural Networks
2019-11-21Felix Leditzky: Playing Games with Multiple Access Channels
2019-11-14Anand Natarajan: NEEXP ⊆ MIP*
2019-11-14Alex B. Grilo: Recent advances in Zero-knowledge proofs in the quantum setting
2019-10-03Andrea Coladangelo: A simple two-player dimension witness based on embezzlement
2019-09-06John Preskill: Quantum speedups in the NISQ era
2019-09-06Aditya Nema: Unitary Designs and quantum channels with super additive classical capacity
2019-09-06Peter Zoller: Hybrid Classical-Quantum Algorithms on Programmable Quantum Simulators
2019-09-06Albert H. Werner: Tensor network representations from the geometry of entangled states
2019-09-06Mischa Woods & Sepehr Nezami: Quantum error correction
2019-09-06Iman Marvian: Universal Quantum Emulator
2019-09-06Alessandro Bisio: Axiomatic theory of Higher-Order Quantum Computation
2019-09-06Tom Benjamin & Krithik Puthalath: Cambridge Quantum Computing - Focus Areas
2019-09-06Chris Granade: From Quantum Programming to Quantum Development
2019-09-06Johannes Borregaard: One-way quantum repeater with minimal-resources
2019-09-06András Gilyén: Quantum singular value transformations & its algorithmic applications
2019-09-06Ewin Tang: Building a classical framework to analyze quantum machine learning speedups
2019-09-06Yuan Su: Digital quantum simulation by product formulas