3 papers
quant-ph2026
On the Computational Complexity of Geometrically Local QAC0 circuits
Yangjing Dong, Fengning Ou, Penghui Yao
The computational complexity of , which are constant-depth, polynomial-size quantum circuit families consisting of arbitrary single-qubit unitaries and -qubit ge…
quant-ph2025
Linear-Size QAC0 Channels: Learning, Testing and Hardness
Yangjing Dong, Fengning Ou, Penghui Yao
Shallow quantum circuits have attracted increasing attention in recent years, due to the fact that current noisy quantum hardware can only perform faithful quantum computation for…
quant-ph2024
On the Computational Power of QAC0 with Barely Superlinear Ancillae
Anurag Anshu, Yangjing Dong, Fengning Ou +1
is the family of constant-depth polynomial-size quantum circuits consisting of arbitrary single qubit unitaries and multi-qubit Toffoli gates. It was introduced by…