Video URL
https://pirsa.org/24110085Brownian Circuits and Quantum Randomness
APA
(2024). Brownian Circuits and Quantum Randomness. Perimeter Institute for Theoretical Physics. https://pirsa.org/24110085
MLA
Brownian Circuits and Quantum Randomness. Perimeter Institute for Theoretical Physics, Nov. 27, 2024, https://pirsa.org/24110085
BibTex
@misc{ scivideos_PIRSA:24110085, doi = {10.48660/24110085}, url = {https://pirsa.org/24110085}, author = {}, keywords = {Quantum Information}, language = {en}, title = {Brownian Circuits and Quantum Randomness}, publisher = {Perimeter Institute for Theoretical Physics}, year = {2024}, month = {nov}, note = {PIRSA:24110085 see, \url{https://scivideos.org/index.php/pirsa/24110085}} }
Abstract
Abstract: Randomness is a powerful resource for information-processing applications. For example, classical randomness is essential for modern information security and underpins many cryptographic schemes. Similarly, quantum randomness can protect quantum information against noise or eavesdroppers who wish to access or manipulate that information. These observations raise a set of related questions: How quickly and efficiently can we generate quantum randomness? How much quantum randomness is necessary for a given task? What can we use quantum randomness for? In this talk, I address these questions using all-to-all Brownian circuits, a family of random quantum circuits for which exact results can often be obtained via mean-field theory. I will first demonstrate that all-to-all Brownian circuits form k-designs in a time that scales linearly with k. I will then discuss how these circuits can be applied to study Heisenberg-limited metrology and quantum advantage. In particular, I will discuss a time-reversal protocol that can achieve Heisenberg-limited precision in cavity QED and trapped ion setups; I will also discuss the application of these circuits to studying classical spoofing algorithms for the linear cross-entropy benchmark, a popular measure of quantum advantage.