arXiv subjects

Takashi Imoto

Publications and source records attributed to Takashi Imoto.

At least 19 recordsLinked to original sources

arXiv2026

Experimental Measurement and Theoretical Analysis of Energy Relaxation Rates of an Interacting Two-Qubit System on a D-Wave Quantum Annealer

In D-Wave quantum annealers, various properties of the ground state have been clarified, whereas the correspondence between theory and experiment for energy relaxation rates in multiqubit excited states remains insufficiently understood. Here, we measured the energy relaxation rates of the first excited states in single-qubit systems and interacting two-qubit systems using a D-Wave quantum annealer. We analyzed the measured relaxation rates using a Gorini-Kossakowski-Sudarshan-Lindblad master equation with independent local $σ^{\,\,z}$-type noise channels. The calculated relaxation rates reproduced the overall trends observed experimentally, supporting the model at a qualitative level. We then used the relaxation rates measured for the uncoupled single-qubit systems to calibrate the local relaxation parameters and predict the relaxation rates of the interacting two-qubit systems. The predicted rates remained within a factor of approximately four of the measured rates. These results show that the relaxation measurements on individual qubits can provide a practical estimate of relaxation in small interacting quantum systems and may help clarify relaxation mechanisms in programmable quantum annealers.

quant-ph↗

arXiv2025

Quantifying the Energy Relaxation Rate of Quantum States Using D-Wave Device and the Discovery of Long-Lived Multiqubit States

Quantum annealing has been demonstrated with superconducting qubits. Such a quantum annealer has been used to solve combinatorial optimization problems. Moreover, it serves as a quantum simulator for investigating the properties of quantum many-body systems. However, the coherence properties of multi-qubit states provided by D-Wave Quantum Inc. have not been explored sufficiently. Here, using the D-Wave device, we measure the energy relaxation rate of superconducting qubits and find long-lived multi-qubit states. Specifically, we investigate the energy relaxation rate of the first excited states of a fully connected Ising model with a transverse field. We find that the decay rate of the excited states of such a system with four qubits is orders of magnitude smaller than that of the excited state of a single qubit, which demonstrates the existence of long-lived multi-qubit states. We elucidate the mechanism using an independent decoherence model that qualitatively describes the phenomenon. In addition, by using such a mechanism, we theoretically predict a long-lived entangled state whose energy relaxation rate is smaller than that of the separable states.

quant-ph↗

arXiv2025

Robust phase estimation of the ground-state energy without controlled time evolution on a quantum device

Estimating the ground-state energy of Hamiltonians in quantum systems is an important task. In this work, we demonstrate that the ground-state energy can be accurately estimated without controlled time evolution by using adiabatic state preparation (ASP) and Ramsey-type measurement. By considering the symmetry of the Hamiltonian governing the time evolution during ASP, we can prepare a superposition of the ground state and reference state whose eigenvalue is known. This enables the estimation of the ground-state energy via Ramsey-type measurement. Furthermore, our method is robust against non-adiabatic transitions, making it suitable for use with early fault-tolerant quantum computers and quantum annealing.

quant-ph↗

arXiv2025

Identification of Phase Plate Properties Using Photonic Quantum Sensor Networks

Quantum sensor networks (QSNs) have been widely studied for their potential of precise measurements. While most QSN research has focused on estimating continuous variables, recent studies have explored discrete-variable estimation. Here, we propose a method for high-precision identification of phase plate properties using a photon-based QSN, which is categorized as discrete-variable estimation. We consider an interaction of a single photon with $N$ phase plates. There are some distinct properties of the phase plates, and we aim to identify such properties. Specifically, we investigate two cases: (i) distinguishing between phase plates that impart uniformly random phases in the range $[0, 2π]$ and those that impart the same phase, and (ii) distinguishing between phase plates that impart uniformly random phases in $[0, 2π]$ and those that impart phases within a narrower range $[- δ, δ]$ ($0< δ\ll 1$). For this distinction, we consider two approaches: one in which a single photon is prepared in a nonlocal state before interacting with the phase plates, and the other in which the single photon remains in a local state. Our results demonstrate that the nonlocal state enables more precise identification when $N$ is large.

quant-ph↗

arXiv2025

Universal quantum computation using quantum annealing with the transverse-field Ising Hamiltonian

Quantum computation is a promising emerging technology, and by utilizing the principles of quantum mechanics, it is expected to achieve faster computations than classical computers for specific problems. There are two distinct architectures for quantum computation: gate-based quantum computers and quantum annealing. In gate-based quantum computation, we implement a sequence of quantum gates that manipulate qubits. This approach allows us to perform universal quantum computation, yet they pose significant experimental challenges for large-scale integration. On the other hand, with quantum annealing, the solution of the optimization problem can be obtained by preparing the ground state. Conventional quantum annealing devices with transverse-field Ising Hamiltonian, such as those manufactured by D-Wave Inc., achieving around 5000 qubits, are relatively more amenable to large-scale integration but are limited to specific computations. In this paper, we present a practical method for implementing universal quantum computation within the conventional quantum annealing architecture using the transverse-field Ising Hamiltonian. Our innovative approach relies on an adiabatic transformation of the Hamiltonian, changing from transverse fields to a ferromagnetic interaction regime, where the ground states become degenerate. Notably, our proposal is compatible with D-Wave devices, opening up possibilities for realizing large-scale gate-based quantum computers. This research bridges the gap between conventional quantum annealing and gate-based quantum computation, offering a promising path toward the development of scalable quantum computing platforms.

quant-ph↗

arXiv2024

Linear Regression Using Quantum Annealing with Continuous Variables

Linear regression is a data analysis technique, which is categorized as supervised learning. By utilizing known data, we can predict unknown data. Recently, researchers have explored the use of quantum annealing (QA) to perform linear regression where parameters are approximated to discrete values using binary numbers. However, this approach has a limitation: we need to increase the number of qubits to improve the accuracy. Here, we propose a novel linear regression method using QA that leverages continuous variables. In particular, the boson system facilitates the optimization of linear regression without resorting to discrete approximations, as it directly manages continuous variables while engaging in QA. The major benefit of our new approach is that it can ensure accuracy without increasing the number of qubits as long as the adiabatic condition is satisfied.

quant-ph↗

arXiv2024

Exact Bethe quantum numbers of the massive XXZ chain in the two down-spin sector

Every solution of the Bethe ansatz equations (BAE) is characterized by a set of quantum numbers called the Bethe quantum numbers, which are fundamental for evaluating it numerically. We rigorously derive the Bethe quantum numbers for the real solutions of the spin-1/2 massive XXZ spin chain in the two down-spin sector, assuming the existence of solutions to some form of BAE. In the sector the quantum numbers $J_1$ and $J_2$ were derived for complex solutions, but not for real solutions. We show the exact results in the sector as follows. (\si) When two Bethe quantum numbers are different, i.e., for $J_1 \ne J_2$, we introduce a graphical method, which we call a contour method, for deriving the solution of BAE to a given set of Bethe quantum numbers. By the method, we can readily show the existence and the uniqueness of the solution. (\sii) When two Bethe quantum numbers are equal, i.e. for $J_1 = J_2$, we derive the criteria for the collapse of two-strings and the emergence of an extra two-string by an analytic method. (\siii) We obtain the number of real solutions, which depends on the site number $N$ and the XXZ anisotropy parameter $ζ$. (\siv) We derive all infinite-valued solutions of BAE for the XXX spin chain in the two down-spin sector through the XXX limit. (\sv) We explicitly show the completeness of the Bethe ansatz in terms of the Bethe quantum numbers.

math-ph↗

arXiv2024

Quantum annealing showing an exponentially small success probability despite a constant energy gap with polynomial energy

Quantum annealing (QA) is a method for solving combinatorial optimization problems. We can estimate the computational time for QA using the adiabatic condition. The adiabatic condition consists of two parts: an energy gap and a transition matrix. Most past studies have focused on the relationship between the energy gap and computational time. The success probability of QA is considered to decrease exponentially owing to the exponentially decreasing energy gap at the first-order phase-transition point. In this study, through a detailed analysis of the relationship between the energy gap, transition matrix, and computational cost during QA, we propose a general method for constructing counterintuitive models wherein QA with a constant annealing time fails despite a constant energy gap, based on polynomial energy. We assume that the energy of the total Hamiltonian is at most $Θ(L)$, where $L$ is the number of qubits. In our formalism, we choose a known model that exhibits an exponentially small energy gap during QA, and modify the model by adding a specific penalty term to the Hamiltonian. In the modified model, the transition matrix in the adiabatic condition becomes exponentially large as the number of qubits increases, while the energy gap remains constant. Moreover, we achieve a quadratic speedup, for which the upper bound for improvement in the adiabatic condition is determined by the polynomial energy. As examples, we consider the adiabatic Grover search and the $p$-spin model. In these cases, with the addition of the penalty term, although the success probability of QA on the modified models becomes exponentially small despite a constant energy gap; we can achieve a success probability considerably higher than that of conventional QA. Moreover, we numerically show the scaling of the computational cost is quadratically improved compared to the conventional QA.

quant-ph↗

arXiv2023

Demonstration of the excited-state search on the D-wave quantum annealer

Quantum annealing is a way to prepare an eigenstate of the problem Hamiltonian. Starting from an eigenstate of a trivial Hamiltonian, we slowly change the Hamiltonian to the problem Hamiltonian, and the system remains in the eigenstate of the Hamiltonian as long as the so-called adiabatic condition is satisfied. By using devices provided by D-Wave Systems Inc., there were experimental demonstrations to prepare a ground state of the problem Hamiltonian. However, up to date, there are no demonstrations to prepare the excited state of the problem Hamiltonian with quantum annealing. Here, we demonstrate the excited-state search by using the D-wave processor. The key idea is to use the reverse quantum annealing with a hot start where the initial state is the excited state of the trivial Hamiltonian. During the reverse quantum annealing, we control not only the transverse field but also the longitudinal field and slowly change the Hamiltonian to the problem Hamiltonian so that we can obtain the desired excited state. As an example of the exited state search, we adopt a two-qubit Ising model as the problem Hamiltonian and succeed to prepare the excited state. Also, we solve the shortest vector problem where the solution is embedded into the first excited state of the Ising Hamiltonian. Our results pave the way for new applications of quantum annealers to use the excited states.

quant-ph↗

arXiv2023

A general method to construct mean field counter diabatic driving for a ground state search

The counter diabatic (CD) driving has attracted much attention for suppressing non-adiabatic transition in quantum annealing (QA). However, it can be intractable to construct the CD driving in the actual experimental setup due to the non-locality of the CD dariving Hamiltonian and necessity of exact diagonalization of the QA Hamiltonian in advance. In this paper, using the mean field (MF) theory, we propose a general method to construct an approximated CD driving term consisting of local operators. We can efficiently construct the MF approximated CD (MFCD) term by solving the MF dynamics of magnetization using a classical computer. As an example, we numerically perform QA with MFCD driving for the spin glass model with transverse magnetic fields. We numerically show that the MF dynamics with MFCD driving is equivalent to the solution of the self-consistent equation in MF theory. Also, we clarify that a ground state of the spin glass model with transverse magnetic field can be obtained with high fidelity compared to the conventional QA without the CD driving. Moreover, we experimentally demonstrate our method by using a D-wave quantum annealer and obtain the experimental result supporting our numerical simulation.

quant-ph↗

arXiv2023

Nonstoquastic catalyst for bifurcation-based quantum annealing of ferromagnetic $p$-spin model

Introducing a nonstoquastic catalyst is a promising avenue to improve quantum annealing with the transverse field. In the present paper, we propose a nonstoquastic catalyst for bifurcation-based quantum annealing described by the spin-1 operators to improve the efficiency of a ground-state search. To investigate the effect of the nonstoquastic catalyst, we study the ferromagnetic $p$-spin model, which has difficulty with finding the ground state due to the first-order phase transition for quantum annealing. A semiclassical analysis shows that the problematic first-order phase transition can be eliminated by introducing the proposed nonstoquastic catalyst with the appropriate amplitude. We also numerically calculate the minimum energy gap for a finite-size system by diagonalizing the Hamiltonian. We find that while the energy gap decreases exponentially with increasing system size for the original Hamiltonian, it decreases polynomially against the system size for the Hamiltonian with the nonstoquastic catalyst. This result implies that the proposed nonstoquastic catalyst has the potential to improve the performance of bifurcation-based quantum annealing.

quant-ph↗

arXiv2022

Catastrophic failure of quantum annealing owing to non-stoquastic Hamiltonian and its avoidance by decoherence

Quantum annealing (QA) is a promising method for solving combinatorial optimization problems whose solutions are embedded into a ground state of the Ising Hamiltonian. This method employs two types of Hamiltonians: a driver Hamiltonian and a problem Hamiltonian. After a sufficiently slow change from the driver Hamiltonian to the problem Hamiltonian, we can obtain the target ground state that corresponds to the solution. The inclusion of non-stoquastic terms in the driver Hamiltonian is believed to enhance the efficiency of the QA. Meanwhile, decoherence is regarded as of the main obstacles for QA. Here, we present examples showing that non-stoaquastic Hamiltonians can lead to catastrophic failure of QA, whereas a certain decoherence process can be used to avoid such failure. More specifically, when we include anti-ferromagnetic interactions (i.e., typical non-stoquastic terms) in the Hamiltonian, we are unable to prepare the target ground state even with an infinitely long annealing time for some specific cases. In our example, owing to a symmetry, the Hamiltonian is block-diagonalized, and a crossing occurs during the QA, which leads to a complete failure of the ground-state search. Moreover, we show that, when we add a certain type of decoherence, we can obtain the ground state after QA for these cases. This is because, even when symmetry exists in isolated quantum systems, the environment breaks the symmetry. Our counter intuitive results provide a deep insight into the fundamental mechanism of QA.

quant-ph↗

arXiv2022

Quantum annealing with symmetric subspaces

Quantum annealing (QA) is a promising approach for not only solving combinatorial optimization problems but also simulating quantum many-body systems such as those in condensed matter physics. However, non-adiabatic transitions constitute a key challenge in QA. The choice of the drive Hamiltonian is known to affect the performance of QA because of the possible suppression of non-adiabatic transitions. Here, we propose the use of a drive Hamiltonian that preserves the symmetry of the problem Hamiltonian for more efficient QA. Owing to our choice of the drive Hamiltonian, the solution is searched in an appropriate symmetric subspace during QA. As non-adiabatic transitions occur only inside the specific subspace, our approach can potentially suppress unwanted non-adiabatic transitions. To evaluate the performance of our scheme, we employ the XY model as the drive Hamiltonian in order to find the ground state of problem Hamiltonians that commute with the total magnetization along the $z$ axis. We find that our scheme outperforms the conventional scheme in terms of the fidelity between the target ground state and the states after QA.

quant-ph↗

arXiv2022

Analysis of the shortest vector problems with the quantum annealing to search the excited states

The shortest vector problem (SVP) is one of the lattice problems and is mathematical basis for the lattice-based cryptography, which is expected to be post-quantum cryptography. The SVP can be mapped onto the Ising problem, which in principle can be solved by quantum annealing (QA). However, one issue in solving the SVP using QA is that the solution of the SVP corresponds to the first excited state of the problem Hamiltonian. Therefore, QA, which searches for ground states, cannot provide a solution with high probability. In this paper, we propose to adopt an excited-state search of the QA to solve the shortest vector problem. We numerically show that the excited-state search provides a solution with a higher probability than the ground-state search.

quant-ph↗

arXiv2022

Emergence of Hilbert Space Fragmentation in Ising Models with a Weak Transverse Field

The transverse-field Ising model is one of the fundamental models in quantum many-body systems, yet a full understanding of its dynamics remains elusive in higher than one dimension. Here, we show for the first time the breakdown of ergodicity in $d$-dimensional Ising models with a weak transverse field in a prethermal regime. We demonstrate that novel Hilbert-space fragmentation occurs in the effective non-integrable model with $d\geq2$ as a consequence of only one emergent global conservation law of the domain wall number. Our results indicate nontrivial initial-state dependence for non-equilibrium dynamics of the Ising models in a weak transverse field.

cond-mat.stat-mech↗

arXiv2022

Generation of multipartite entanglement between spin-1 particles with bifurcation-based quantum annealing

Quantum annealing is a way to solve a combinational optimization problem where quantum fluctuation is induced by transverse fields. Recently, a bifurcation-based quantum annealing with spin-1 particles was suggested as another mechanism to implement the quantum annealing. In the bifurcation-based quantum annealing, each spin is initially prepared in $|0\rangle$, let this state evolve by a time-dependent Hamiltonian in an adiabatic way, and we find a state spanned by $|\pm 1\rangle$ at the end of the evolution. Here, we propose a scheme to generate multipartite entanglement, namely GHZ states, between spin-1 particles by using the bifurcation-based quantum annealing. We gradually decrease the detuning of the spin-1 particles while we adiabatically change the amplitude of the external driving fields. Due to the dipole-dipole interactions between the spin-1 particles, we can prepare the GHZ state after performing this protocol. We discuss possible implementations of our scheme by using nitrogen vacancy centers in diamond.

quant-ph↗

arXiv2021

Preparing ground states of the XXZ model using the quantum annealing with inductively coupled superconducting flux qubits

Preparing ground states of Hamiltonians is important in the condensed matter physics and the quantum chemistry. The interaction Hamiltonians typically contain not only diagonal but also off-diagonal elements. Although quantum annealing provides a way to prepare a ground state of a Hamiltonian, we can only use the Hamiltonian with Ising interaction by using currently available commercial quantum annealing devices. In this work, we propose a quantum annealing for the XXZ model, which contains both Ising interaction and energy-exchange interaction, by using inductively coupled superconducting flux qubits. The key idea is to use a recently proposed spin-lock quantum annealing where the qubits are driven by microwave fields. As long as the rotating wave approximation is valid, the inductive coupling between the superconducting flux qubits produces the desired Hamiltonian in the rotating frame, and we can use such an interaction for the quantum annealing while the microwave fields driving play a role of the transverse fields. To quantify the performance of our scheme, we implement numerical simulations, and show that we can prepare ground states of the two-dimensional Heisenberg model with a high fidelity.

quant-ph↗

arXiv2021

Quantum annealing with twisted fields

Quantum annealing is a promising method for solving combinational optimization problems and performing quantum chemical calculations. The main sources of errors in quantum annealing are the effects of decoherence and non-adiabatic transition. We propose a method for suppressing both these effects using inhomogeneous twist operators corresponding to the twist angles of transverse fields applied to qubits. Furthermore, we adopt variational methods to determine the optimal inhomogeneous twist operator for minimizing the energy of the state after quantum annealing. Our approach is useful for increasing the energy gap and/or making the quantum states robust against decoherence during quantum annealing. In summary, our results can pave the way to a new approach for realizing practical quantum annealing.

quant-ph↗