Complexity is simple!
Abstract In this note we investigate the role of Lloyd’s computational bound in holographic complexity. Our goal is to translate the assumptions behind Lloyd’s proof into the bulk language. In particular, we discuss the distinction between orthogonalizing and ‘simple’ gates and argue that these noti...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2018-02-01
|
| Series: | Journal of High Energy Physics |
| Subjects: | |
| Online Access: | http://link.springer.com/article/10.1007/JHEP02(2018)039 |