📕 Paper
- D. Sakamoto, S. Naito, Y. Mori, K. Mitarai, “Efficient equivalence checking of Clifford-U circuits with shared single-qubit unitaries”, arXiv:2603.12697.
- Y. Mori, H. Hakoshima, K. Fujii, “Nontrivial multi-product commutation relation for reducing T-count in sequential Pauli-based computation”, arXiv:2509.20052. GitHub: mcr
- Y. Mori, H. Hakoshima, K. Sudo, T. Mori, K. Mitarai, K. Fujii, “Quantum Circuit Unoptimization”, Phys. Rev. Res. 7, 023139 (2025). GitHub: qcunopt
🗣️ Talk
- “Nontrivial multi-product commutation relation for reducing T-count”, APS Global Physics Summit, Denver, 16th-20th Mar. 2026.
- “Nontrivial multi-product commutation relation for reducing T-count in sequential Pauli-based computation”, 第16回量子ソフトウェア研究発表会, 茨城, 2025年10月.
- “Multi-product commutation relation for transpiling Clifford+T circuits”, 7th International Workshop on Quantum Compilation, Helsinki, 6th-7th Sep. 2025.
- “Clifford+T回路における多重積交換則と量子回路の等価変換”, Q-LEAP 量子AI学生研究会, 愛知, 2025年3月.
- “量子回路非最適化アルゴリズムの提案とコンパイラベンチマークへの応用”, 第49回量子情報技術研究会, 沖縄, 2023年12月.
- “量子回路の非最適化アルゴリズムの提案と量子コンパイラベンチマークへの応用”, Q-LEAP 量子AI学生研究会, 大阪, 2023年3月.
- “Quantum Circuit Un-optimization as a Benchmark Task for Quantum Compilers”, APS March Meeting 2023, Las Vegas, 5th-10th Mar. 2023.
📊 Poster
- “Nontrivial multi-product commutation relation for reducing T-count in sequential Pauli-based computation” 29th QIP, Riga, 24th-30th Jan. 2026.
- “Multi-product commutation relation for transpiling Clifford+T circuits”, 2025年度 量子情報関東・関西合同 Student Chapter, 茨城, 2025年9月.
- “A multi-product commutation relation for transpiling Clifford+T circuits”, Quantum Innovation, Osaka, 29th-31st Jul. 2025.
- “A multi-product commutation relation for transpiling Clifford+T circuits”, Quantinuum May 2025 Training Session, Osaka, 20th May 2025.
- “A multi-product commutation relation for transpiling Clifford+T circuits”, QCTiP 2025, Berlin, 23rd-25th Apr. 2025.