Searcharxiv⌕ Search

arXiv subjects

Hayato Goto

Publications and source records attributed to Hayato Goto.

At least 37 records · Page 2Linked to original sources

Roadmap for Unconventional Computing with Nanotechnology

In the "Beyond Moore's Law" era, with increasing edge intelligence, domain-specific computing embracing unconventional approaches will become increasingly prevalent. At the same time, adopting a variety of nanotechnologies will offer benefits in energy cost, computational speed, reduced footprint, cyber resilience, and processing power. The time is ripe for a roadmap for unconventional computing with nanotechnologies to guide future research, and this collection aims to fill that need. The authors provide a comprehensive roadmap for neuromorphic computing using electron spins, memristive devices, two-dimensional nanomaterials, nanomagnets, and various dynamical systems. They also address other paradigms such as Ising machines, Bayesian inference engines, probabilistic computing with p-bits, processing in memory, quantum memories and algorithms, computing with skyrmions and spin waves, and brain-inspired computing for incremental learning and problem-solving in severely resource-constrained environments. These approaches have advantages over traditional Boolean computing based on von Neumann architecture. As the computational requirements for artificial intelligence grow 50 times faster than Moore's Law for electronics, more unconventional approaches to computing and signal processing will appear on the horizon, and this roadmap will help identify future needs and challenges. In a very fertile field, experts in the field aim to present some of the dominant and most promising technologies for unconventional computing that will be around for some time to come. Within a holistic approach, the goal is to provide pathways for solidifying the field and guiding future impactful discoveries.

cs.ET↗

Control of the $ZZ$ coupling between Kerr-cat qubits via transmon couplers

Kerr-cat qubits are a promising candidate for fault-tolerant quantum computers owing to the biased nature of their errors. The $ZZ$ coupling between the qubits can be utilized for a two-qubit entangling gate, but the residual coupling called $ZZ$ crosstalk is detrimental to precise computing. In order to resolve this problem, we propose a tunable $ZZ$-coupling scheme using two transmon couplers. By setting the detunings of the two couplers at opposite values, the residual $ZZ$ couplings via the two couplers cancel each other out. We also apply our scheme to the $R_{zz}(Θ)$ gate ($ZZ$ rotation with angle $Θ$), one of the two-qubit entangling gates. We numerically show that the fidelity of the $R_{zz}(-π/2)$ gate is higher than 99.9% in a case of $16$-ns gate time and without decoherence.

quant-ph↗

Fast elementary gates for universal quantum computation with Kerr parametric oscillator qubits

Kerr parametric oscillators (KPOs) can stabilize the superpositions of coherent states, which can be utilized as qubits, and are promising candidates for realizing hardware-efficient quantum computers. Although elementary gates for universal quantum computation with KPO qubits have been proposed, these gates are usually based on adiabatic operations and thus need long gate times, which result in errors caused by photon loss in KPOs realized by, e.g., superconducting circuits. In this work, we accelerate the elementary gates by experimentally feasible control methods, which are based on numerical optimization of pulse shapes for shortcuts to adiabaticity. By numerical simulations, we show that the proposed methods can achieve speedups compared to adiabatic ones by up to six times with high gate fidelities of 99.9%. These methods are thus expected to be useful for quantum computers with KPOs.

quant-ph↗

Measurement-free fault-tolerant logical zero-state encoding of the distance-three nine-qubit surface code in a one-dimensional qubit array

Generation of logical zero states encoded with a quantum error-correcting code is the first step for fault-tolerant quantum computation, but requires considerably large resource overheads in general. To reduce such overheads, we propose an efficient encoding method for the distance-three, nine-qubit surface code and show its fault tolerance. This method needs no measurement, unlike other fault-tolerant encoding methods. Moreover, this is applicable to a one-dimensional qubit array. Observing these facts, we experimentally demonstrate the logical zero-state encoding of the surface code using a superconducting quantum computer on the cloud. We also experimentally demonstrate the suppression of fast dephasing due to intrinsic residual interactions in this machine by a dynamical decoupling technique dedicated for the qubit array. To extend this method to larger codes, we also investigate the concatenation of the surface code with itself, resulting in a distance-nine, 81-qubit code. We numerically show that fault-tolerant encoding of this large code can be achieved by appropriate error detection. Thus, the proposed encoding method will provide a new way to low-overhead fault-tolerant quantum computation.

quant-ph↗

Fast parametric two-qubit gate for highly detuned fixed-frequency superconducting qubits using a double-transmon coupler

High-performance two-qubit gates have been reported with superconducting qubits coupled via a single-transmon coupler (STC). Most of them are implemented for qubits with a small detuning since reducing residual $ZZ$ coupling for highly detuned qubits by an STC is challenging. In terms of the frequency crowding and crosstalk, however, highly detuned qubits are desirable. Here, we numerically demonstrate a high-performance parametric gate for highly detuned fixed-frequency qubits using a recently proposed tunable coupler called a double-transmon coupler (DTC). Applying an ac flux pulse, we can perform a maximally entangling universal gate ($\sqrt{\rm iSWAP}$) with an average fidelity over 99.99$\%$ and a short gate time of about 24 ns. This speed is comparable to resonance-based gates for slightly detuned tunable qubits. Moreover, using a dc flux pulse alternatively, we can achieve another kind of entangling gate called a CZ gate with an average fidelity over 99.99$\%$ and a gate time of about 18 ns. Given the frexibility and feasible settings, we can expect that the DTC will contribute to realizing a high-performance quantum computer in the near future.

quant-ph↗

Simulated bifurcation for higher-order cost functions

High-performance Ising machines for solving combinatorial optimization problems have been developed with digital processors implementing heuristic algorithms such as simulated bifurcation (SB). Although Ising machines have been designed for second-order cost functions, there are practical problems expressed naturally by higher-order cost functions. In this work, we extend SB to such higher-order cost functions. By solving a problem having third-order cost functions, we show that the higher-order SB can outperform not only the second-order SB with additional spin variables, but also simulated annealing applied directly to the third-order cost functions. This result suggests that the higher-order SB can be practically useful.

math.OC↗

Two-qubit gate using conditional driving for highly detuned Kerr-nonlinear parametric oscillators

A Kerr-nonlinear parametric oscillator (KPO) is one of the promising devices to realize qubits for universal quantum computing. The KPO can stabilize two coherent states with opposite phases, yielding a quantum superposition called a Schrödinger cat state. Universal quantum computing with KPOs requires three kinds of quantum gates: $R_z, R_x$, and $R_{zz}$ gates. We theoretically propose a two-qubit gate $R_{zz}$ for highly detuned KPOs. In the proposed scheme, we add another two-photon drive for the first KPO. This leads to the $R_{zz}$ gate based on the driving of the second KPO depending on the first-KPO state, which we call "conditional driving." First, we perform simulations using a conventional KPO Hamiltonian derived from a superconducting-circuit model under some approximations and evaluate the gate fidelity. Next, we also perform numerical simulations of the two-qubit gate using the superconducting-circuit model without the approximations. The simulation results indicate that two-qubit gates can be implemented with high fidelity ($>99.9\%$) for rotation angles required for universality.

quant-ph↗

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↗

Double-Transmon Coupler: Fast Two-Qubit Gate with No Residual Coupling for Highly Detuned Superconducting Qubits

Although two-qubit entangling gates are necessary for universal quantum computing, they are notoriously difficult to implement with high fidelity. Recently, tunable couplers have become a key component for realizing high-fidelity two-qubit gates in superconducting quantum computers. However, it is still difficult to achieve tunable coupling free of unwanted residual coupling for highly detuned qubits, which are desirable for mitigating qubit-frequency crowding or errors due to crosstalk between qubits. We thus propose a design for this kind of tunable coupler, which we call a double-transmon coupler, because this is composed of two transmon qubits coupled through a common loop with an additional Josephson junction. Controlling the magnetic flux in the loop, we can achieve not only fast high-fidelity two-qubit gates, but also no residual coupling during idle time, where computational qubits are highly detuned fixed-frequency transmons. The proposed coupler is expected to offer an alternative approach to higher-performance superconducting quantum computers.

quant-ph↗

Quantum Gate for Kerr Nonlinear Parametric Oscillator Using Effective Excited States

A Kerr nonlinear parametric oscillator (KPO) can stabilize a quantum superposition of two coherent states with opposite phases, which can be used as a qubit. In a universal gate set for quantum computation with KPOs, an $R_x$ gate, which interchanges the two coherent states, is relatively hard to perform owing to the stability of the two states. We propose a method for a high-fidelity $R_x$ gate by exciting the KPO outside the qubit space with parity-selective transitions, which can be implemented by only adding a driving field. In this method, the utilization of higher effective excited states leads to a faster $R_x$ gate, rather than states near the qubit space. The proposed method can realize a continuous $R_x$ gate and thus is expected to be useful for, e.g., recently proposed variational quantum algorithms.

quant-ph↗

Simulated bifurcation assisted by thermal fluctuation

Various kinds of Ising machines based on unconventional computing have recently been developed for practically important combinatorial optimization. Among them, the machines implementing a heuristic algorithm called simulated bifurcation have achieved high performance, where Hamiltonian dynamics are simulated by massively parallel processing. To further improve the performance of simulated bifurcation, here we introduce thermal fluctuation to its dynamics relying on the Nosé-Hoover method, which has been used to simulate Hamiltonian dynamics at finite temperatures. We find that a heating process in the Nosé-Hoover method can assist simulated bifurcation to escape from local minima of the Ising problem, and hence lead to improved performance. We thus propose heated simulated bifurcation and demonstrate its performance improvement by numerically solving instances of the Ising problem with up to 2000 spin variables and all-to-all connectivity. Proposed heated simulated bifurcation is expected to be accelerated by parallel processing.

cond-mat.stat-mech↗

Chaos in coupled Kerr-nonlinear parametric oscillators

A Kerr-nonlinear parametric oscillator (KPO) can generate a quantum superposition of two oscillating states, known as a Schrödinger cat state, via quantum adiabatic evolution, and can be used as a qubit for gate-based quantum computing and quantum annealing. In this work, we investigate complex dynamics, i.e., chaos, in two coupled nondissipative KPOs at a few-photon level. After showing that a classical model for this system is nonintegrable and consequently exhibits chaotic behavior, we provide quantum counterparts for the classical results, which are quantum versions of the Poincaré surface of section and its lower-dimensional version defined with time integrals of the Wigner and Husimi functions, and also the initial and long-term behavior of out-of-time-ordered correlators. We conclude that some of them can be regarded as quantum signatures of chaos, together with energy-level spacing statistics (conventional signature). Thus, the system of coupled KPOs is expected to offer not only an alternative approach to quantum computing, but also a promising platform for the study on quantum chaos.

quant-ph↗

Requirements for fault-tolerant quantum computation with cavity-QED-based atom-atom gates mediated by a photon with a finite pulse length

We analyze the requirements for fault-tolerant quantum computation with atom-atom gates based on cavity quantum electrodynamics (cQED) mediated by a photon with a finite pulse length. For short photon pulses, the distorted shape of the reflected pulses from the cQED system is a serious error source. We optimize the cQED system parameters to minimize the infidelity due to the shape distortion and the photon losses in a well-balanced manner for the fault-tolerant scheme using probabilistic gates [H. Goto and K. Ichimura, Phys. Rev. A 80, 040303(R) (2009)]. Our optimization greatly relaxes the requirements for fault-tolerant quantum computation in some parameter regions, compared with the conventional optimization method where only the photon loss is minimized without considering the shape distortion [H. Goto and K. Ichimura, Phys. Rev. A 82, 032311 (2010)]. Finally, we show that reducing the cavity length is an effective way to reduce the errors of this type of gate in the case of short photon pulses.

quant-ph↗

Excited-State Adiabatic Quantum Computation Started with Vacuum States

Adiabatic quantum computation (AQC), which is particularly useful for combinatorial optimization, becomes more powerful by using excited states, instead of ground states. However, the excited-state AQC is prone to errors due to dissipation. Here we propose the excited-state AQC started with the most stable state, i.e., the vacuum state. This counterintuitive approach becomes possible by using a driven quantum system, or more precisely, a network of Kerr-nonlinear parametric oscillators (KPOs). By numerical simulations, we show that some hard instances, where standard ground-state AQC with KPOs fails to find their optimal solutions, can be solved by the present approach, where nonadiabatic transitions are rather utilized. We also show that the use of the vacuum state as an initial state leads to robustness against errors due to dissipation, as expected, compared to the use of a really excited (nonvacuum) state as an initial state. Thus, the present work offers new possibilities for quantum computation and driven quantum systems.

quant-ph↗

High-accuracy Ising machine using Kerr-nonlinear parametric oscillators with local four-body interactions

A two-dimensional array of Kerr-nonlinear parametric oscillators (KPOs) with local four-body interactions is a promising candidate for realizing an Ising machine with all-to-all spin couplings, based on adiabatic quantum computation in the Lechner-Hauke-Zoller (LHZ) scheme. However its performance has been evaluated for only a few KPOs. By numerically simulating more KPOs, here we show that the performance can be dramatically improved by reducing inhomogeneity in photon numbers induced by the four-body interactions. The discrepancies of the photon numbers can be corrected by tuning the detunings of KPOs depending on their positions, without monitoring their states during adiabatic time evolution. This correction can be used independent of the number of KPOs in the LHZ scheme and thus can be applied to large-scale implementation.

quant-ph↗

Reservoir Computing on Spin-Torque Oscillator Array

We numerically study reservoir computing on a spin-torque oscillator (STO) array, describing the magnetization dynamics of the STO array by a nonlinear oscillator model. The STOs exhibit synchronized oscillation due to coupling by magnetic dipolar fields. We show that reservoir computing can be performed using the synchronized oscillation state. The performance can be improved by increasing the number of STOs. The performance becomes highest at the boundary between the synchronized and disordered states. Using an STO array, we can achieve higher performance than that of an echo-state network with similar number of units. This result indicates that STO arrays are promising for hardware implementation of reservoir computing.

cond-mat.mes-hall↗

Quantum Computation Based on Quantum Adiabatic Bifurcations of Kerr-Nonlinear Parametric Oscillators

Quantum computers with Kerr-nonlinear parametric oscillators (KPOs) have recently been proposed by the author and others. Quantum computation using KPOs is based on quantum adiabatic bifurcations of the KPOs, which lead to quantum superpositions of coherent states, such as Schrodinger cat states. Therefore, these quantum computers are referred to as "quantum bifurcation machines (QbMs)." QbMs can be used for qauntum adiabatic optimization and universal quantum computation. Superconducting circuits with Josephson junctions, Josephson parametric oscillators (JPOs) in particular, are promising for physical implementation of KPOs. Thus, KPOs and QbMs offer not only a new path toward the realization of quantum bits (qubits) and quantum computers, but also a new application of JPOs. Here we theoretically explain the physics of KPOs and QbMs, comparing them with their dissipative counterparts. Their physical implementations with superconducting circuits are also presented.

quant-ph↗

Fundamental Limit on the Efficiency of Single-Photon Generation Based on Cavity Quantum Electrodynamics

We analytically derive the upper bound on the overall efficiency of single-photon generation based on cavity quantum electrodynamics (QED), where cavity internal loss is treated explicitly. The internal loss leads to a tradeoff relation between the internal generation efficiency and the escape efficiency, which results in a fundamental limit on the overall efficiency. The corresponding lower bound on the failure probability is expressed only with an "internal cooperativity," introduced here as the cooperativity parameter with respect to the cavity internal loss rate. The lower bound is obtained by optimizing the cavity external loss rate, which can be experimentally controlled by designing or tuning the transmissivity of the output coupler. The model used here is general enough to treat various cavity-QED effects, such as the Purcell effect, on-resonant or off-resonant cavity-enhanced Raman scattering, and vacuum-stimulated Raman adiabatic passage. A repumping process, where the atom is reused after its decay to the initial ground state, is also discussed.

quant-ph↗