3 papers
quant-ph2026
Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation
Yusei Mori, Hideaki Hakoshima, Keisuke Fujii
Quantum compilers that reduce the number of T gates are essential for minimizing the overhead of fault-tolerant quantum computation. Achieving further T-count reduction calls for i…
quant-ph2026
Efficient equivalence checking of Clifford-U circuits with shared single-qubit unitaries
Daisuke Sakamoto, Soshun Naito, Yusei Mori +1
Quantum circuit equivalence checking asks whether two circuits implement the same unitary. It guarantees compiler correctness and safe optimization, yet most existing approaches sc…
quant-ph2025
Quantum Circuit Unoptimization
Yusei Mori, Hideaki Hakoshima, Kyohei Sudo +3
Optimization of circuits is an essential task for both quantum and classical computers to improve their efficiency. In contrast, classical logic optimization is known to be difficu…