Keisuke  Fujii

Prof. Keisuke Fujii


Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 September 2018 in Physical Review Applied
Verified
Journal Article
Closed access
PDF file
TFTaishi Furuta
Taishi Furuta
KFKeisuke Fujii
Keisuke Fujii
KNKohei Nakajima
Kohei Nakajima
STSumito Tsunegi
Sumito Tsunegi
HKHitoshi Kubota
Hitoshi Kubota
SMShinji Miwa
Shinji Miwa
The figures-of-merit for reservoir computing (RC), using spintronics devices called magnetic tunnel junctions (MTJs), are evaluated. RC is a type of recurrent neural network (RNN). The input information is stored in certain parts of the reservoir and computation can be performed by optimizing a linear transform matrix for the output. While all the network characteristics should be controlled in a general RNN, such optimization is not necessary for RC. The reservoir only has to possess a nonlinear response with memory effect. In this paper, macromagnetic simulation is conducted for the spin dynamics in MTJs for RC. It is determined that the MTJ system possesses the memory effect and nonlinearity required for RC. With RC using 5–7 MTJs, high performance can be obtained, similar to an echo-state network with 20–30 nodes, even if there are no magnetic and/or electrical interactions between the magnetizations.

1 March 2017 in New Journal of Physics
Verified
Journal Article
Open access
PDF file
KFKeisuke Fujii
Keisuke Fujii
TMTomoyuki Morimae
Tomoyuki Morimae
Instantaneous quantum polynomial-time (IQP) computation is a class of quantum computation consisting only of commuting two-qubit gates and is not universal. Nevertheless, it has been shown that if there is a classical algorithm that can simulate IQP efficiently, the polynomial hierarchy collapses to the third level, which is highly implausible. However, the origin of the classical intractability is still less understood. Here we establish a relationship between IQP and computational complexity of calculating the imaginary-valued partition functions of Ising models. We apply the established relationship in two opposite directions. One direction is to find subclasses of IQP that are classically efficiently simulatable by using exact solvability of certain types of Ising models. Another direction is applying quantum computational complexity of IQP to investigate (im)possibility of efficient classical approximations of Ising partition functions with imaginary coupling constants. Specifically, we show that a multiplicative approximation of Ising partition functions is #P-hard for almost all imaginary coupling constants even on planar lattices of a bounded degree.

9 November 2017 in Physical Review Letters
Verified
Journal Article
Open access
PDF file
YSYasunari Suzuki
Yasunari Suzuki
KFKeisuke Fujii
Keisuke Fujii
MKMasato Koashi
Masato Koashi
In order to realize fault-tolerant quantum computation, a tight evaluation of the error threshold under practical noise models is essential. While non-Clifford noise is ubiquitous in experiments, the error threshold under non-Clifford noise cannot be efficiently treated with known approaches. We construct an efficient scheme for estimating the error threshold of the one-dimensional quantum repetition code under non-Clifford noise. To this end, we employ the nonunitary free-fermionic formalism for efficient simulation of the one-dimensional repetition code under coherent noise. This allows us to evaluate the effect of coherence in noise on the error threshold without any approximation. The result shows that the error threshold becomes one-third when the noise is fully coherent. Our scheme is also applicable to the surface code undergoing a specific coherent noise model. The dependence of the error threshold on noise coherence can be explained with a leading-order analysis with respect to coherence terms in the noise map. We expect that this analysis is also valid for the surface code since it is a two-dimensional extension of the one-dimensional repetition code. Moreover, since the obtained threshold is accurate, our results can be used as a benchmark for the approximation or heuristic schemes for non-Clifford noise.

25 April 2017 in Physical Review A
Verified
Journal Article
Open access
PDF file
TMTomoyuki Morimae
Tomoyuki Morimae
KFKeisuke Fujii
Keisuke Fujii
HNHarumichi Nishimura
Harumichi Nishimura
The one-clean qubit model (or the DQC1 model) is a restricted model of quantum computing where only a single qubit of the initial state is pure and others are maximally mixed. Although the model is not universal, it can efficiently solve several problems whose classical efficient solutions are not known. Furthermore, it was recently shown that if the one-clean qubit model is classically efficiently simulated, the polynomial hierarchy collapses to the second level. A disadvantage of the one-clean qubit model is, however, that the clean qubit is too clean: for example, in realistic NMR experiments, polarizations are not high enough to have the perfectly pure qubit. In this paper, we consider a more realistic one-clean qubit model, where the clean qubit is not clean, but depolarized. We first show that, for any polarization, a multiplicative-error calculation of the output probability distribution of the model is possible in a classical polynomial time if we take an appropriately large multiplicative error. The result is in strong contrast with that of the ideal one-clean qubit model where the classical efficient multiplicative-error calculation (or even the sampling) with the same amount of error causes the collapse of the polynomial hierarchy. We next show that, for any polarization lower-bounded by an inverse polynomial, a classical efficient sampling (in terms of a sufficiently small multiplicative error or an exponentially small additive error) of the output probability distribution of the model is impossible unless BQP (bounded error quantum polynomial time) is contained in the second level of the polynomial hierarchy, which suggests the hardness of the classical efficient simulation of the one nonclean qubit model.

18 February 2019 in arXiv
Verified
Preprint
Open access
PDF file
ADAmarsanaa Davaasuren
Amarsanaa Davaasuren
YSYasunari Suzuki
Yasunari Suzuki
KFKeisuke Fujii
Keisuke Fujii
MKMasato Koashi
Masato Koashi
Quantum error correction is an essential technique for constructing a scalable quantum computer. In order to implement quantum error correction with near-term quantum devices, a fast and near-optimal decoding method is demanded. A decoder based on machine learning is considered as one of the most viable solutions for this purpose, since its prediction is fast once training has been done, and it is applicable to any quantum error correcting code and any noise model. So far, various formulations of the decoding problem as the task of machine learning have been proposed. Here, we discuss general constructions of machine-learning-based decoders. We found several conditions to achieve near-optimal performance, and proposed a criterion which should be optimized when a size of training data set is limited. We also discuss preferable constructions of neural networks, and proposed a decoder using spatial structures of topological codes using a convolutional neural network. We numerically show that our method can improve the performance of machine-learning-based decoders in various topological codes and noise models.

3 October 2017 in arXiv
Verified
Preprint
Open access
PDF file
YSYasunari Suzuki
Yasunari Suzuki
KFKeisuke Fujii
Keisuke Fujii
MKMasato Koashi
Masato Koashi
In order to realize fault-tolerant quantum computation, tight evaluation of error threshold under practical noise models is essential. While non-Clifford noise is ubiquitous in experiments, the error threshold under non-Clifford noise cannot be efficiently treated with known approaches. We construct an efficient scheme for estimating the error threshold of one-dimensional quantum repetition code under non-Clifford noise. To this end, we employ non-unitary free-fermionic formalism for efficient simulation of the one-dimensional repetition code under coherent noise. This allows us to evaluate the effect of coherence in noise on the error threshold without any approximation. The result shows that the error threshold becomes one third when noise is fully coherent. Our scheme is also applicable to the surface code undergoing a specific coherent noise model. The dependence of the error threshold on noise coherence can be explained with a leading-order analysis with respect to coherence terms in the noise map. We expect that this analysis is also valid for the surface code since it is a two-dimensional extension of the one-dimensional repetition code. Moreover, since the obtained threshold is accurate, our results can be used as a benchmark for approximation or heuristic schemes for non-Clifford noise.