5 papers
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…
Non-Markovianity in Quantum Information Processing: Interplay with Quantum Error Mitigation
Suguru Endo, Hideaki Hakoshima, Tomohiro Shitara
Non-Markovian dynamics are typically present in the dynamics of open quantum systems. Despite the rich structure of non-Markovian dynamics, their relevance to quantum information p…
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…
Resource-efficient Generalized Quantum Subspace Expansion
Bo Yang, Nobuyuki Yoshioka, Hiroyuki Harada +5
Realizing practical quantum computing requires overcoming a number of computation errors and the limitation of device size, which have intensively been tackled by quantum error mit…
Hardware-efficient quantum annealing with error mitigation via classical shadow
Takaharu Yoshida, Yuta Shingu, Chihaya Shimada +3
Quantum annealing (QA) is an efficient method for finding the ground-state energy of the problem Hamiltonian. However, in practical implementation, the system suffers from decohere…