19 citations · 37 across the 10 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
quant-ph2026
Computational Complexity of Clifford Template Compilation: Are Quantum Computers Useful for Compiling Quantum Circuits?
Keisuke Fujii
A Clifford template is a finite ordered family of repeatable Clifford operations, and an instantiation specifies how many times each operation is applied. The Clifford template com…
quant-ph2026
The Impact of Qubit Connectivity on Quantum Advantage in Noisy IQP Circuits
Leonardo Placidi, Enrico Rinaldi, Keisuke Fujii +1
Instantaneous Quantum Polynomial-time (IQP) circuits are a candidate for demonstrating near-term quantum advantage, as their sampling task is believed to be classically hard in the…