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: | Chae-Yeun Park, Michael J. Kastoryano |
---|---|
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!
|
Similar Items
-
Quantum complexity phase transitions in monitored random circuits
by: Ryotaro Suzuki, et al.
Published: (2025-02-01) -
Universal early-time growth in quantum circuit complexity
by: S. Shajidul Haque, et al.
Published: (2024-10-01) -
DEFINITION OF THE PLACE OF SHORT CIRCUITS ON POWER LINES OF 110 KV AND ABOVE ON INSTANTANEOUS VALUES OF CURRENTS AND VOLTAGES
by: N. S. Burjanina, et al.
Published: (2017-12-01) -
Time Jitter in Phase Controlled Thyristor Circuits
by: D. S. Palmer, et al.
Published: (1975-01-01) -
Classical variational optimization of a PREPARE circuit for quantum phase estimation of quantum chemistry Hamiltonians
by: Hayata Morisaki, et al.
Published: (2024-11-01)