Paper out! We prove worst-case classical hardness of sampling from unitary cluster Jastrow circuit, which automatically proves hardness for well-known UCC families. Congrats Hafid-san, Iwakiri-san, Kohda-san, and Kento for important step for QSCI/SQD! arxiv.org/abs/2504.12893

【Objective insights for quantum computing adoption】 QunaSys has released the preview of “QURI Bench” — a benchmarking tool to evaluate quantum hardware for enterprise R&D and DX teams. Helping you choose the right hardware & accelerate development. qunasys.com/en/news/posts/…

Fluid dynamics simulation is a promising application for quantum computing, and we are actively working on it. We've just published a blog post on the work led by our intern Ueno, demonstrating the quantum circuit implementations for fluid dynamics. tech.qunasys.com/en/posts/lbm_c…

[Paper published 🎉] Our paper on estimating Clifford+T gate decomposition error has been published in Quantum. This work can lead to the efficient use of early fault-tolerant quantum computers. quantum-journal.org/papers/q-2025-…

[New preprint 🎉] We have posted a preprint proposing a way to realize quantum many-body scar states, which are intriguing nonthermal states, as a stable phase of nonequilibrium steady states. arxiv.org/abs/2507.22583

【New preprint🎉】 We have posted a new paper on the quantum state simulation with a limited number of T gates, looking ahead the early-FTQC era. arxiv.org/abs/2508.14546

[New preprint on arXiv 🎉] We have posted a paper proposing a quantum algorithm for nonlinear plasma fluid simulation and its numerical verification. The method yields ~4th-order speedup in time scaling with grid size and polylog space complexity. arxiv.org/abs/2509.22503

【New preprint🎉】 Our joint work with Fujii Lab (UOsaka) on a new FTQC architecture “MB-FTQC”! Measurement-based approach aiming for large-scale QC on near-term devices, with new schemes like “higher-order zero-level magic state distillation.” arxiv.org/abs/2510.18652

【New preprint🎉】 We proved that simulating the hardware-efficient ansatzes (HEA), widely used in near-term algorithms, belongs to the class known as BQP-complete. This result strongly suggests that such simulations are classically intractable. arxiv.org/abs/2511.03870