The University of Osaka · Computer Science
Professor Keisuke Fujii's research lab specializes in quantum information science and quantum computing, with a focus on theoretical and computational aspects of quantum advantage, quantum algorithms, and hybrid quantum-classical computing. The lab explores foundational quantum models such as the one-clean-qubit model and develops practical techniques for simulating quantum operations using classical resources, including quasi-probability distributions and variational quantum algorithms. Additionally, the lab investigates quantum technologies applied to materials science and molecular systems, exemplified by studies on DNA nucleobases using X-ray spectroscopy. Their work bridges quantum theory with experimental applications, aiming to enable scalable quantum computation on near-term devices.
Figures are computed from collected data and may differ slightly.
Covers advancements in spacecraft and tactical and strategic missile systems, including subsystem design and application, mission design and analysis, materials and structures, developments in space sciences, space processing and manufacturing, space operations, and applications of space technologies to other fields.
Abstract We show a certain kind of non-local operations can be simulated by sampling a set of local operations with a quasi-probability distribution when the task of a quantum circuit is to evaluate an expectation value of observables. Utilizing the result, we describe a strategy to decompose a two-qubit gate to a sequence of single-qubit operations. Required operations are projective measurement of a qubit in Pauli basis, and π /2 rotation around x , y , and z axes. The required number of sampl
We summarize the physics case for the International Linear Collider (ILC). We review the key motivations for the ILC presented in the literature, updating the projected measurement uncertainties for the ILC experiments in accord with the expected schedule of operation of the accelerator and the results of the most recent simulation studies.
The one-clean-qubit model (or the deterministic quantum computation with one quantum bit model) is a restricted model of quantum computing where all but a single input qubits are maximally mixed. It is known that the probability distribution of measurement results on three output qubits of the one-clean-qubit model cannot be classically efficiently sampled within a constant multiplicative error unless the polynomial-time hierarchy collapses to the third level [T. Morimae, K. Fujii, and J. F. Fit
We propose a divide-and-conquer method for the quantum-classical hybrid algorithm to solve larger problems with small-scale quantum computers. Specifically, we concatenate a variational quantum eigensolver (VQE) with a reduction in the system dimension, where the interactions between divided subsystems are taken as an effective Hamiltonian expanded by the reduced basis. Then the effective Hamiltonian is further solved by the VQE, which we call deep VQE. Deep VQE allows us to apply quantum-classi
The near-edge X-ray absorption fine structure (NEXAFS) of evaporated thin films of DNA nucleobases on an Au-coated Si surface at room temperature has been investigated in the regions around the nitrogen and oxygen K-edges using highly monochromatic synchrotron soft X-rays. Each nucleobase shows a specific absorption spectrum originating from the resonant excitation of 1s electrons of nitrogen or oxygen to antibonding states, some of which strongly depend on the polarization angle of incident sof
We investigate an entanglement purification protocol with double-selection process, which works under imperfect local operations. Compared with the usual protocol with single selection, this double-selection method has higher noise thresholds for the local operations and quantum communication channels and achieves higher fidelity of purified states. It also provides a yield comparable to that of the usual protocol with single selection. We discuss on general grounds how some of the errors which
A series of experiments was performed on high-enthalpy effects on hypersonic boundary-layer transition using nitrogen, air, and carbon dioxideas test gases in the T5 hypervelocity shock tunnel. Previous experiments on a sharp cone showed significant high enthalpy effects. This series concerns the attachment line boundary layer on swept cylinders with sweep angles of 60 and 45 deg. The observed trend of transition Reynolds number with enthalpy, which is found to be similar to that in the cone res
Quantum systems, in general, cannot be simulated efficiently by a classical computer, and hence are useful for solving certain mathematical problems and simulating quantum many-body systems. This also implies, unfortunately, that verification of the output of the quantum systems is not so trivial, since predicting the output is exponentially hard. As another problem, the quantum system is very delicate for noise and thus needs an error correction. Here, we propose a framework for verification of
We propose a scalable way to construct a 3D cluster state for fault-tolerant topological one-way computation (TOWC) even if the entangling two-qubit gates succeed with a small probability. It is shown that fault-tolerant TOWC can be performed with the success probability of the two-qubit gate such as 0.5 (0.1) provided that the unheralded error probability of the two-qubit gate is less than 0.040% (0.016%). Furthermore, the resource usage is considerably suppressed compared to the conventional f
We demonstrate that repeated measurements in disordered systems can induce a quantum anti-Zeno effect under certain conditions to enhance quantum transport. The enhancement of energy transfer is really exhibited in multisite models under repeated measurements. The optimal measurement interval for the anti-Zeno effect and the maximal efficiency of energy transfer are specified in terms of the relevant physical parameters. Since the environment acts as frequent measurements on the system, the deco
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 o
Open papers in the app to read, cite, and organize with AI.