arXiv subjects

Yuichiro Matsuzaki

Publications and source records attributed to Yuichiro Matsuzaki.

At least 73 records · Page 4Linked to original sources

arXiv2022

Fast tunable coupling scheme of Kerr parametric oscillators based on shortcuts to adiabaticity

Kerr parametric oscillators (KPOs), which can be implemented with superconducting parametrons possessing large Kerr nonlinearity, have been attracting much attention in terms of their applications to quantum annealing, universal quantum computation and studies of quantum many-body systems. It is of practical importance for these studies to realize fast and accurate tunable coupling between KPOs in a simple manner. We develop a simple scheme of fast tunable coupling of KPOs with high tunability in speed and amplitude using the fast transitionless rotation of a KPO in the phase space based on the shortcuts to adiabaticity. Our scheme enables rapid switching of the effective coupling between KPOs, and can be implemented with always-on linear coupling between KPOs, by controlling the phase of the pump field and the resonance frequency of the KPO without controlling the amplitude of the pump field nor using additional drive fields and couplers. We apply the coupling scheme to a two-qubit gate, and show that our scheme realizes high gate fidelity compared to a purely adiabatic one, by mitigating undesired nonadiabatic transitions.

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

Spectroscopic estimation of the photon number for superconducting Kerr parametric oscillators

Quantum annealing (QA) is a way to solve combinational optimization problems. Kerr nonlinear parametric oscillators (KPOs) are promising devices for implementing QA. When we solve the combinational optimization problems using KPOs, it is necessary to precisely control the photon number of the KPOs. Here, we propose a feasible method to estimate the photon number of the KPO. We consider coupling an ancillary qubit to the KPO and show that spectroscopic measurements on the ancillary qubit provide information on the photon number of the KPO.

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

Quantum battery based on superabsorption

A quantum battery is a device where an energy is charged by using a quantum effect. Here, we propose a quantum battery with a charger system composed of $N$ qubits by utilizing a collective effect called a superabsorption. Importantly, the coupling strength between the quantum battery and charger system can be enhanced due to an entanglement. While the charger time scales as $Θ\left(N^{-1/2}\right)$ by applying a conventional scheme, we can achieve a charging time $Θ\left(N^{-1}\right)$ in our scheme. Our results open the path to ultra-fast charging of a quantum battery.

quant-ph↗

arXiv2022

Efficient classical simulation of open bosonic quantum systems

We propose a computationally efficient method to solve the dynamics of operators of bosonic quantum systems coupled to their environments. The method maps the operator under interest to a set of complex-valued functions, and its adjoint master equation to a set of partial differential equations for these functions, which are subsequently solved numerically. In the limit of weak coupling to the environment, the mapping of the operator enables storing the operator efficiently during the simulation, leading to approximately quadratic improvement in the memory consumption compared with the direct approach of solving the adjoint master equation in the number basis, while retaining the computation time comparable. Moreover, the method enables efficient parallelization which allows to optimize for the actual computational time to reach an approximately quadratic speed up, while retaining the memory consumption comparable to the direct approach. We foresee the method to prove useful, e.g., for the verification of the operation of superconducting quantum processors.

quant-ph↗

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↗

arXiv2022

Generalized quantum subspace expansion

One of the major challenges for erroneous quantum computers is undoubtedly the control over the effect of noise. Considering the rapid growth of available quantum resources that are not fully fault-tolerant, it is crucial to develop practical hardware-friendly quantum error mitigation (QEM) techniques to suppress unwanted errors. Here, we propose a novel generalized quantum subspace expansion method which can handle stochastic, coherent, and algorithmic errors in quantum computers. By fully exploiting the substantially extended subspace, we can efficiently mitigate the noise present in the spectra of a given Hamiltonian, without relying on any information of noise. The performance of our method is discussed under two highly practical setups: the quantum subspaces are mainly spanned by powers of the noisy state $ρ^m$ and a set of error-boosted states, respectively. We numerically demonstrate in both situations that we can suppress errors by orders of magnitude, and show that out protocol inherits the advantages of previous error-agnostic QEM techniques as well as overcoming their drawbacks.

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

Vector DC magnetic-field sensing with reference microwave field using perfectly aligned nitrogen-vacancy centers in diamond

The measurement of vector magnetic fields with high sensitivity and spatial resolution is important for both fundamental science and engineering applications. In particular, magnetic-field sensing with nitrogen-vacancy (NV) centers in diamond is a promising approach that can outperform existing methods. Recent studies have demonstrated vector DC magnetic-field sensing with perfectly aligned NV centers, which showed a higher readout contrast than NV centers having four equally distributed orientations. However, to estimate the azimuthal angle of the target magnetic field with respect to the NV axis in these previous approaches, it is necessary to apply a strong reference DC magnetic field, which can perturb the system to be measured. This is a crucial problem, especially when attempting to measure vector magnetic fields from materials that are sensitive to applied DC magnetic fields. Here, we propose a method to measure vector DC magnetic fields using perfectly aligned NV centers without reference DC magnetic fields. More specifically, we used the direction of linearly polarized microwave fields to induce Rabi oscillation as a reference and estimated the azimuthal angle of the target fields from the Rabi frequency. We further demonstrate the potential of our method to improve sensitivity by using entangled states to overcome the standard quantum limit. Our method of using a reference microwave field is a novel technique for sensitive vector DC magnetic-field sensing.

quant-ph↗

arXiv2021

Quantum metrology based on symmetry-protected adiabatic transformation: Imperfection, finite time duration, and dephasing

The aim of quantum metrology is to estimate target parameters as precisely as possible. In this paper, we consider quantum metrology based on symmetry-protected adiabatic transformation. We introduce a ferromagnetic Ising model with a transverse field as a probe and consider the estimation of a longitudinal field. Without the transverse field, the ground state of the probe is given by the Greenberger-Horne-Zeilinger state, and thus the Heisenberg limit estimation of the longitudinal field can be achieved through parity measurement. In our scheme, full information of the longitudinal field encoded on parity is exactly mapped to global magnetization by symmetry-protected adiabatic transformation, and thus the parity measurement can be replaced with global magnetization measurement. Moreover, this scheme requires neither accurate control of individual qubits nor that of interaction strength. We discuss the effects of the finite transverse field and nonadiabatic transitions as imperfection of adiabatic transformation. By taking into account finite time duration for state preparation, sensing, and readout, we also compare performance of the present scheme with a classical scheme in the absence and presence of dephasing.

quant-ph↗

arXiv2021

Boltzmann machine learning with a variational quantum algorithm

Boltzmann machine is a powerful tool for modeling probability distributions that govern the training data. A thermal equilibrium state is typically used for Boltzmann machine learning to obtain a suitable probability distribution. The Boltzmann machine learning consists of calculating the gradient of the loss function given in terms of the thermal average, which is the most time consuming procedure. Here, we propose a method to implement the Boltzmann machine learning by using Noisy Intermediate-Scale Quantum (NISQ) devices. We prepare an initial pure state that contains all possible computational basis states with the same amplitude, and apply a variational imaginary time simulation. Readout of the state after the evolution in the computational basis approximates the probability distribution of the thermal equilibrium state that is used for the Boltzmann machine learning. We actually perform the numerical simulations of our scheme and confirm that the Boltzmann machine learning works well by our scheme.

quant-ph↗

arXiv2021

Calculation of Gibbs partition function with imaginary time evolution on near-term quantum computers

The Gibbs partition function is an important quantity in describing statistical properties of a system in thermodynamic equilibrium. There are several proposals to calculate the partition functions on near-team quantum computers. However, the existing schemes require many copies of the Gibbs states to perform an extrapolation for the calculation of the partition function, and these could be costly performed on the near-term quantum computers. Here, we propose an efficient scheme to calculate the Gibbs function with the imaginary time evolution. To calculate the Gibbs function of $N$ qubits, only $2N$ qubits are required in our scheme. After preparing Gibbs states with different temperatures by using the imaginary time evolution, we measure the overlap between them on a quantum circuit, and this allows us to calculate the Gibbs partition function.

quant-ph↗

arXiv2021

Polarizing electron spins with a superconducting flux qubit

Electron spin resonance (ESR) is a useful tool to investigate properties of materials in magnetic fields where high spin polarization of target electron spins is required in order to obtain high sensitivity. However, the smaller magnetic fields becomes, the more difficult high polarization is passively obtained by thermalization. Here, we propose to employ a superconducting flux qubit (FQ) to polarize electron spins actively. We have to overcome a large energy difference between the FQ and electron spins for efficient energy transfer among them. For this purpose, we adopt a spin-lock technique on the FQ where the Rabi frequency associated with the spin-locking can match the resonance (Larmor) one of the electron spins. We find that adding dephasing on the spins is beneficial to obtain high polarization of them, because otherwise the electron spins are trapped in dark states that cannot be coupled with the FQ. We show that our scheme can achieve high polarization of electron spins in realistic experimental conditions.

quant-ph↗

arXiv2021

Variational secure cloud quantum computing

Variational quantum algorithms (VQAs) have been considered to be useful applications of noisy intermediate-scale quantum (NISQ) devices. Typically, in the VQAs, a parametrized ansatz circuit is used to generate a trial wave function, and the parameters are optimized to minimize a cost function. On the other hand, blind quantum computing (BQC) has been studied in order to provide the quantum algorithm with security by using cloud networks. A client with a limited ability to perform quantum operations hopes to have access to a quantum computer of a server, and BQC allows the client to use the server's computer without leakage of the client's information (such as input, running quantum algorithms, and output) to the server. However, BQC is designed for fault-tolerant quantum computing, and this requires many ancillary qubits, which may not be suitable for NISQ devices. Here, we propose an efficient way to implement the NISQ computing with guaranteed security for the client. In our architecture, only N+ 1 qubits are required, under an assumption that the form of ansatzes is known to the server, where N denotes the necessary number of the qubits in the original NISQ algorithms. The client only performs single-qubit measurements on an ancillary qubit sent from the server, and the measurement angles can specify the parameters for the ansatzes of the NISQ algorithms. No-signaling principle guarantees that neither parameters chosen by the client nor the outputs of the algorithm are leaked to the server. This work paves the way for new applications of NISQ devices.

quant-ph↗

arXiv2021

Entanglement-enhanced sensing using a chain of qubits with always-on nearest-neighbor interactions

Quantum metrology is the use of genuinely quantum properties such as entanglement as a resource to outperform classical sensing strategies. Typically, entanglement is created by implementing gate operations or inducing many-body interactions. However, existing sensing schemes with these approaches require accurate control of the probe system such as switching on and off the interaction among qubits, which can be challenging for practical applications. Here, we propose an entanglement-enhanced sensing scheme with an always-on nearest-neighbor interaction between qubits. We adopt the transverse field Ising chain as the probe system, making use of the so-called quantum domino dynamics for the generation of the entangled states. In addition to the advantage that our scheme can be implemented without controlling the interactions, it only requires initialization of the system, projective measurements on a single qubit, and control of the uniform magnetic fields. We can achieve an improved sensitivity beyond the standard quantum limit even under the effect of realistic decoherence.

quant-ph↗