3 papers
quant-ph2025
Heuristic Quantum Advantage with Peaked Circuits
Hrant Gharibyan, Mohammed Zuhair Mullath, Nicholas E. Sherman +3
We design and demonstrate heuristic quantum advantage with peaked circuits (HQAP circuits) on Quantinuum's System Model H2 quantum processor. Through extensive experimentation with…
quant-ph2025
Complexity and hardness of random peaked circuits
Yuxuan Zhang
Near-term feasibility, classical hardness, and verifiability are the three requirements for demonstrating quantum advantage; most existing quantum advantage proposals achieve at mo…
quant-ph2025
Classical Simulability of Quantum Circuits with Shallow Magic Depth
Yifan Zhang, Yuxuan Zhang
Quantum magic is a necessary resource for quantum computers to be not efficiently simulable by classical computers. Previous results have linked the amount of quantum magic, charac…