A simplified version of the quantum OTOC$^{(2)}$ problem
Robbie King, Robin Kothari, Ryan Babbush, Sergio Boixo, Kostyantyn Kechedzhi, Thomas E. O'Brien, Vadim Smelyanskiy
TL;DR
This paper introduces a simplified formulation of the quantum OTOC$^{(2)}$ problem, inspired by recent experimental work, aiming to facilitate further theoretical research in quantum chaos and information scrambling.
Contribution
It provides a new, simplified version of the quantum OTOC$^{(2)}$ problem for increasing input sizes, encouraging more theoretical investigations.
Findings
Simplified formulation of the quantum OTOC$^{(2)}$ problem
Connection to recent experimental implementations
Encourages further theoretical work
Abstract
This note presents a simplified version of the OTOC problem that was recently experimentally implemented by Google Quantum AI and collaborators. We present a formulation of the problem for growing input size and hope this spurs further theoretical work on the problem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Mechanics and Applications · Quantum Information and Cryptography