Unconditional quantum magic advantage in shallow circuit computation
Abstract Quantum theory promises computational speed-ups over classical approaches. The celebrated Gottesman-Knill Theorem implies that the full power of quantum computation resides in the specific resource of “magic” states—the secret sauce to establish universal quantum computation. However, it is...
Saved in:
| Main Authors: | Xingjian Zhang, Zhaokai Pan, Guoding Liu |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2024-12-01
|
| Series: | Nature Communications |
| Online Access: | https://doi.org/10.1038/s41467-024-54864-0 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Classical Simulability of Quantum Circuits with Shallow Magic Depth
by: Yifan Zhang, et al.
Published: (2025-02-01) -
Unconditional advantage of noisy qudit quantum circuits over biased threshold circuits in constant depth
by: Michael de Oliveira, et al.
Published: (2025-04-01) -
Quantum Advantage from Measurement-Induced Entanglement in Random Shallow Circuits
by: Adam Bene Watts, et al.
Published: (2025-03-01) -
Magic spreading in random quantum circuits
by: Xhek Turkeshi, et al.
Published: (2025-03-01) -
The Magic of Universal Quantum Computing with Permutations
by: Michel Planat, et al.
Published: (2017-01-01)