2 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.CC2006★ 2 cited
On Polynomial Time Computable Numbers
Tetsushi Matsui
It will be shown that the polynomial time computable numbers form a field, and especially an algebraically closed field.
cs.CC2004★ 2 cited
A Note on Bulk Quantum Turing Machine
Tetsushi Matsui
Recently, among experiments for realization of quantum computers, NMR quantum computers have achieved the most impressive succession. There is a model of the NMR quantum computatio…