Masaki Nakanishi
Masaki Nakanishi
Verified email at
Cited by
Cited by
An efficient conversion of quantum circuits to a linear nearest neighbor architecture
Y Hirata
Nara Institute of Science and Technology, 2009
An efficient method to convert arbitrary quantum circuits to ones on a linear nearest neighbor architecture
Y Hirata, M Nakanishi, S Yamashita, Y Nakashima
2009 Third International Conference on Quantum, Nano and Micro Technologies …, 2009
Ordered quantum branching programs are more powerful than ordered probabilistic branching programs under a bounded-width restriction
M Nakanishi, K Hamaguchi, T Kashiwabara
Computing and Combinatorics: 6th Annual International Conference, COCOON …, 2000
Microprocessor, a node terminal, a computer system and a program execution proving method
A Okazaki, M Nakanishi, S Yamashita, K Watanabe
US Patent 7,577,852, 2009
Quantum Cryptographic Communication Method
Y Murakami, M Nakanishi, S Yamashita
US Patent App. 12/224,625, 2009
An on-chip high speed serial communication method based on independent ring oscillators
S Kimura, T Hayakawa, T Horiyama, M Nakanishi, K Watanabe
2003 IEEE International Solid-State Circuits Conference, 2003. Digest of …, 2003
A new approach to online FPGA placement
M Tomono, M Nakanishi, S Yamashita, K Nakajima, K Watanabe
2006 40th Annual Conference on Information Sciences and Systems, 145-150, 2006
Minimization of fractional wordlength on fixed-point conversion for high-level synthesis
N Doi, T Horiyama, M Nakanishi, S Kimura
ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE …, 2004
Quantum versus classical pushdown automata in exact computation
Y Murakami, M Nakanishi, S Yamashita, K Watanabe
IPSJ Digital Courier 1, 426-435, 2005
Folding of logic functions and its application to look up table compaction
S Kimura, T Horiyama, M Nakanishi, H Kajihara
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided …, 2002
Quantum pushdown automata with garbage tape
M Nakanishi
International Journal of Foundations of Computer Science 29 (03), 425-446, 2018
On the power of non-deterministic quantum finite automata
M Nakanishi, T Indoh, K Hamaguchi, T Kashiwabara
IEICE TRANSACTIONS on Information and Systems 85 (2), 327-332, 2002
Classical and quantum counter automata on promise problems
M Nakanishi, A Yakaryılmaz
International Conference on Implementation and Application of Automata, 224-237, 2015
Exact affine counter automata
M Nakanishi, K Khadiev, K Prūsis, J Vihrovs, A Yakaryılmaz
arXiv preprint arXiv:1703.04281, 2017
Synthesis of quantum circuits for d-level systems by using cosine-sine decomposition
Y Nakajima, Y Kawano, H Sekigawa, M Nakanishi, S Yamashita, ...
Quantum Information & Computation 9 (5), 423-443, 2009
Anomaly detection by autoencoder based on weighted frequency domain loss
M Nakanishi, K Sato, H Terada
arXiv preprint arXiv:2105.10214, 2021
Quantum query complexity of boolean functions with small on-sets
A Ambainis, K Iwama, M Nakanishi, H Nishimura, R Raymond, S Tani, ...
International Symposium on Algorithms and Computation, 907-918, 2008
Average/worst-case gap of quantum query complexities by on-set size
A Ambainis, K Iwama, M Nakanishi, H Nishimura, R Raymond, S Tani, ...
arXiv preprint arXiv:0908.2468, 2009
An FPGA configuration scheme for bitstream protection
M Nakanishi
Reconfigurable Computing: Architectures, Tools and Applications: 4th …, 2008
Expressive power of quantum pushdown automata with classical stack operations under the perfect-soundness condition
M Nakanishi, K Hamaguchi, T Kashiwabara
IEICE transactions on information and systems 89 (3), 1120-1127, 2006
The system can't perform the operation now. Try again later.
Articles 1–20