Complexity phase transitions in instantaneous quantum polynomial-time circuits
We study the classical hardness of learning the output distribution from instantaneous quantum polynomial-time circuits with a varying density of two-qubit gates. We first investigate the complexity phases relevant to simulating the output distribution. In addition to a known parameter regime for an...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
American Physical Society
2025-01-01
|
| Series: | Physical Review Research |
| Online Access: | http://doi.org/10.1103/PhysRevResearch.7.013001 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|