5 papers · 1 filter
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…
Experimental Efficient Influence Sampling of Quantum Processes
Hao Zhan, Zongbo Bao, Zekun Ye +4
Characterizing quantum processes is essential for unlocking the potential of quantum devices. However, standard quantum process tomography is resource-intensive and becomes infeasi…
Efficient Non-Adaptive Quantum Algorithms for Tolerant Junta Testing
Zongbo Bao, Yuxuan Liu, Penghui Yao +2
We consider the problem of deciding whether an -qubit unitary (or -bit Boolean function) is -close to some -junta or -far from every -junt…
Distributed Quantum Simulation
Tianfeng Feng, Jue Xu, Wenjun Yu +3
Quantum simulation is a promising pathway toward practical quantum advantage by simulating large-scale quantum systems. In this work, we propose communication-efficient distributed…
On the exact quantum query complexity of and
Penghui Yao, Zekun Ye
The query model has generated considerable interest in both classical and quantum computing communities. Typically, quantum advantages are demonstrated by showcasing a quantum algo…