A simplified version of the quantum OTOC$^{(2)}$ problem
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911226990166016 |
|---|---|
| author | King, Robbie Kothari, Robin Babbush, Ryan Boixo, Sergio Kechedzhi, Kostyantyn O'Brien, Thomas E. Smelyanskiy, Vadim |
| author_facet | King, Robbie Kothari, Robin Babbush, Ryan Boixo, Sergio Kechedzhi, Kostyantyn O'Brien, Thomas E. Smelyanskiy, Vadim |
| contents | This note presents a simplified version of the OTOC$^{(2)}$ 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_19751 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A simplified version of the quantum OTOC$^{(2)}$ problem King, Robbie Kothari, Robin Babbush, Ryan Boixo, Sergio Kechedzhi, Kostyantyn O'Brien, Thomas E. Smelyanskiy, Vadim Quantum Physics Computational Complexity This note presents a simplified version of the OTOC$^{(2)}$ 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. |
| title | A simplified version of the quantum OTOC$^{(2)}$ problem |
| topic | Quantum Physics Computational Complexity |
| url | https://arxiv.org/abs/2510.19751 |