arXiv subjects

Hayato Goto

Publications and source records attributed to Hayato Goto.

At least 19 recordsLinked to original sources

arXiv2026

Instantaneous-Frame Theory of Strongly Driven Parametric Gates

Parametric two-qubit gates using tunable couplers are a promising approach to scalable superconducting quantum processors. However, conventional theories formulated in the idle eigenbasis break down in the large-amplitude regime required for fast gate operations. Here, we show that parametric gates are more naturally and accurately described as coherent rotations between instantaneous eigenstates rather than idle eigenstates. This approach may appear counterintuitive, since instantaneous eigenbases are usually associated with adiabatic dynamics. However, they also form a natural moving frame for driven dynamics, where the non-Abelian Berry connection governs transitions and provides a compact description of the exchange and effective $ZZ$ couplings. We show that this theory achieves quantitative agreement with exact numerical simulations across representative tunable-coupler architectures, including double-transmon, capacitively shunted double-transmon, and single-transmon couplers. The description remains accurate even in regimes where idle-frame descriptions fail, while substantially reducing the reliance on computationally demanding exact simulations. These results establish an instantaneous-frame theory of parametric gates beyond conventional idle-frame models and provide a new perspective on driven quantum dynamics.

quant-ph↗

arXiv2026

Neural decoders for subsystem many-hypercube codes

To maximize the potential of quantum error-correcting codes, it is essential to develop high-performance decoders. The subsystem many-hypercube (MHC) codes have been developed to achieve both high encoding rates and low-weight syndrome-measurements, but the introduction of gauge degrees of freedom makes decoding more challenging. In this work, we develop neural-network-based decoders for the subsystem MHC codes in a circuit-level noise model. We demonstrate that even the gauge-measurement information can be utilized for decoding by carefully arranging the syndrome-measurement sequence, improving the decoding performance. We further show that recurrent neural decoders outperform simple fully connected neural decoders, and can decode syndrome-measurement sequences longer than those used during training.

quant-ph↗

arXiv2026

Parametrically Driven iSWAP Gate Using a Capacitively Shunted Double-Transmon Coupler at the Zero-Flux Sweet Spot

A double-transmon coupler (DTC) enables a fast, high-fidelity CZ gate between two highly detuned, fixed-frequency transmon qubits. Moreover, a recently proposed capacitively shunted DTC (CSDTC) realizes a small residual ZZ interaction over a wide flux-bias range around zero flux, eliminating the necessity of static flux biasing while maintaining high CZ-gate fidelity. However, CZ gates with the DTC and CSDTC require baseband flux pulses with large amplitudes, which are vulnerable to pulse distortion and decoherence due to large qubit-coupler hybridization. To address these issues, we experimentally demonstrate a parametrically driven iSWAP gate operated at zero flux bias between highly detuned, fixed-frequency transmon qubits coupled through a CSDTC. Using a simple flux-drive waveform without predistortion, we realize an average gate fidelity of 99.92(2)% at a total gate time of 112 ns. The observed high-fidelity performance is consistent with small qubit-coupler hybridization and small effective ZZ interaction during the gate. Our numerical simulations reproduce the experimentally observed iSWAP interaction rate and effective ZZ interaction, demonstrating the applicability of the theoretical model not only to spectral information but also to time-domain dynamics such as gate operations. These results boost further progress in the research of superconducting quantum computers.

quant-ph↗

arXiv2026

Quantum chemistry based on classical mechanics inspired by simulated bifurcation

Accurate quantum chemical calculations are critical for understanding molecular properties, yet their computational cost remains a major challenge. Full Configuration Interaction (FCI) provides exact solutions but is prohibitively expensive for large systems. To address this, quantum computers are expected to be useful, but developing practical quantum computers is still ongoing. Here we introduce an efficient Configuration Interaction (CI) computation algorithm based on classical mechanics, which we call Simulated Bifurcation-based CI (SBCI), because we derive this algorithm from a quantum inspired algorithm for combinatorial optimization called Simulated Bifurcation. Applying it to FCI computations of representative molecular systems and comparing the results with those by a standard method, we demonstrate that SBCI can reduce computation costs such as computation times and/or required memory sizes, while keeping high accuracy comparable to the standard method. Thus, SBCI will be promising for accelerating high-precision electronic structure calculations without compromising reliability.

quant-ph↗

arXiv2025

Unlocking the Power of Boltzmann Machines by Parallelizable Sampler and Efficient Temperature Estimation

Boltzmann machines (BMs) are powerful energy-based generative models, but their heavy training cost has largely confined practical use to Restricted BMs (RBMs) trained with an efficient learning method called contrastive divergence. More accurate learning typically requires Markov chain Monte Carlo (MCMC) Boltzmann sampling, but it is time-consuming due to the difficulty of parallelization for more expressive models. To address this limitation, we first propose a new Boltzmann sampler inspired by a quantum-inspired combinatorial optimization called simulated bifurcation (SB). This SB-inspired approach, which we name Langevin SB (LSB), enables parallelized sampling while maintaining accuracy comparable to MCMC. Furthermore, this is applicable not only to RBMs but also to BMs with general couplings. However, LSB cannot control the inverse temperature of the output Boltzmann distribution, which hinders learning and degrades performance. To overcome this limitation, we also developed an efficient method for estimating the inverse temperature during the learning process, which we call conditional expectation matching (CEM). By combining LSB and CEM, we establish an efficient learning framework for BMs with greater expressive power than RBMs. We refer to this framework as sampler-adaptive learning (SAL). SAL opens new avenues for energy-based generative modeling beyond RBMs.

cs.LG↗

arXiv2025

Optimized Many-Hypercube Codes toward Lower Logical Error Rates and Earlier Realization

Many-hypercube codes, concatenated ${[[n,n-2,2]]}$ quantum error-detecting codes ($n$ is even), have recently been proposed as high-rate quantum codes suitable for fault-tolerant quantum computing. While the original many-hypercube codes with ${n=6}$ can achieve remarkably high encoding rates (about 30% and 20% at concatenation levels 3 and 4, respectively), they have large code block sizes at high levels (216 and 1296 physical qubits per block at levels 3 and 4, respectively), making not only experimental realization difficult but also logical error rates per code block high. Toward earlier experimental realization and lower logical error rates, here we comprehensively investigate smaller many-hypercube codes with $[[6,4,2]]$ and/or $[[4,2,2]]$ codes, where, e.g., $D_{6,4,4}$ denotes the many-hypercube code using $[[6,4,2]]$ at level 1 and $[[4,2,2]]$ at levels 2 and 3. As a result, we found a counterintuitive fact that $D_{6,4,4}$ ($D_{6,6,4,4}$) can achieve lower logical error rates per code block than $D_{4,4,4}$ ($D_{4,4,4,4}$), despite its higher encoding rate and larger code block size. Focusing on level 3, we also developed efficient fault-tolerant encoders realizing about 60% overhead reduction while maintaining or even improving the performance, compared to the original design. Using them, we numerically confirmed that $D_{6,4,4}$ also achieves the best performance for logical controlled-NOT gates in a circuit-level noise model. These results are important for targeting a high-rate code toward early experimental realization of efficient fault-tolerant quantum computing.

quant-ph↗

arXiv2025

Single-shot conditional displacement gate between a trapped atom and traveling light

We propose a single-shot conditional displacement gate between a trapped atom as the control qubit and a traveling light pulse as the target oscillator, mediated by an optical cavity. Classical driving of the atom synchronized with the light reflection off the cavity realizes the single-shot implementation of the crucial gate for the universal control of hybrid systems. We further derive a concise gate model incorporating cavity loss and atomic decay, facilitating the evaluation and optimization of the gate performance. This proposal establishes a key practical tool for coherently linking stationary atoms with itinerant light, a capability essential for realizing hybrid quantum information processing.

quant-ph↗

arXiv2025

Subsystem many-hypercube codes: High-rate concatenated codes with low-weight syndrome measurements

Quantum error-correcting codes (QECCs) require high encoding rate in addition to high threshold unless a sufficiently large number of physical qubits are available. The many-hypercube (MHC) codes defined as the concatenation of the [[6,4,2]] quantum error-detecting code have been proposed as high-performance and high-encoding-rate QECCs. However, the concatenated codes have a disadvantage that the syndrome weight grows exponentially with respect to the concatenation level. To address this issue, here we propose subsystem quantum codes based on the MHC codes. In particular, we study the smallest subsystem MHC codes, namely, subsystem codes derived from the concatenated [[4,2,2]] error-detecting codes. The resulting codes have a constant syndrome-measurement weight of 4, while keeping high encoding rates. We build the block-MAP and neural-network decoders and show that they demonstrate superior performance to the bounded-distance decoder.

quant-ph↗

arXiv2025

Fault-tolerant quantum computing with a high-rate symplectic double code

High-rate and large-distance quantum codes are expected to make fault-tolerant quantum computing more efficient, but most of them lack efficient fault-tolerant encoded-state preparation methods. We propose such a fault-tolerant encoder for a [[30, 6, 5]] symplectic double code. The advantage of this code is its compactness, in addition to its high encoding rate, allowing for early experimental realization. Detecting crucial errors during encoding with as few auxiliary qubits as possible, our encoder can reduce resource overheads while keeping low logical error rates, compared to more naive methods. Numerical simulations with a circuit-level noise model demonstrate the reliability and effectiveness of the proposed method. We also develop an arbitrary-state encoder that enables the injection of arbitrary quantum states into the code space. Combined with basic fault-tolerant operations, this supports universal quantum computation. We thus demonstrate that efficient and reliable logical state preparation is achievable even for a compact and high-rate code, offering a potential step toward efficient fault-tolerant quantum computing suitable for near-term experiments.

quant-ph↗

arXiv2025

Edge-of-chaos enhanced quantum-inspired algorithm for combinatorial optimization

Nonlinear dynamical systems with continuous variables can be used for solving combinatorial optimization problems with discrete variables. Numerical simulations of them are also useful as heuristic algorithms with a desirable property, namely, parallelizability, which allows us to execute them in a massively parallel manner, leading to ultrafast performance. However, the dynamical-system approaches with continuous variables are usually less accurate than conventional approaches with discrete variables such as simulated annealing. To improve the solution accuracy of a quantum-inspired algorithm called simulated bifurcation (SB), which was found from classical simulation of a quantum nonlinear oscillator network exhibiting quantum bifurcation, here we generalize it by introducing nonlinear control of individual bifurcation parameters and show that the generalized SB (GSB) can achieve surprisingly high performance, namely, almost 100% success probabilities for some large-scale problems. As a result, the time to solution for a 2,000-variable problem is shortened to 10 ms by a GSB-based machine, which is two orders of magnitude shorter than the best known value, 1.3 s, previously obtained by an SB-based machine. To examine the reason for the ultrahigh performance, we investigated chaos in the GSB changing the nonlinear-control strength and found that the dramatic increase of success probabilities happens near the edge of chaos. That is, the GSB can find a solution with high probability by harnessing the edge of chaos. This finding suggests that dynamical-system approaches to combinatorial optimization will be enhanced by harnessing the edge of chaos, opening a broad possibility for physics-inspired approaches to combinatorial optimization.

quant-ph↗

arXiv2025

Capacitively Shunted Double-Transmon Coupler Realizing Bias-Free Idling and High-Fidelity CZ Gate

A high-fidelity CZ gate utilizing a double-transmon coupler (DTC) has recently been demonstrated as a building block for superconducting quantum processors. Like many other kinds of tunable couplers, however, the DTC requires a finite DC current for flux-biasing the coupler at the idling point to turn off the coupling, necessitating extra care for wiring and heat-load management. To address this issue, we theoretically propose and experimentally realize a novel coupling scheme by introducing a shunt capacitance between the two transmons of the DTC at zero-flux bias, which demonstrates high-fidelity CZ-gate performance comparable to the previous DTC. Through a comprehensive error budget analysis using multiple randomized benchmarking methods, we also identify that the current fidelity is limited by the decoherence through the coupler. Moreover, we experimentally demonstrate the wide operational flux range of the capacitively shunted DTC, which solves the challenging issue of remnant flux existing even with careful magnetic shielding.

quant-ph↗

arXiv2025

High-performance conditional-driving gate for Kerr parametric oscillator qubits

Kerr parametric oscillators (KPOs), two-photon driven Kerr-nonlinear resonators, can stably hold coherent states with opposite-sign amplitudes and are promising devices for quantum computing. Recently, we have theoretically proposed a two-qubit gate $R_{zz}$ for highly detuned KPOs and called it a conditional-driving gate [Chono $\textit{et al}$., Phys. Rev. Res. $\textbf{4}$, 043054 (2022)]. In this study, analyzing its superconducting-circuit model and deriving a corresponding static model, we find that an AC-Zeeman shift due to the flux pulse for the gate operation largely affects the gate performance. This effect becomes a more aggravating factor with shorter gate times, leading to an increase in the error rate. We thus propose a method to cancel this undesirable effect. Furthermore, through the use of shortcuts to adiabaticity and the optimization of flux pulses, we numerically demonstrate a conditional-driving gate with average fidelity exceeding 99.9$\%$ twice faster than that without the proposed method.

quant-ph↗

arXiv2025

Engineering propagating cat states with driving-assisted cavity QED

We propose a method for generating optical cat states in propagating pulses based on cavity quantum electrodynamics (QED). This scheme uses multiple four-level systems (4LSs) inside an optical cavity as a light source. Time-modulating driving stimulates it to produce a superposition of coherent states entangled with the 4LSs. The postselection of an appropriate state of the 4LSs leads to a multicomponent cat state in a propagating pulse. Taking atomic decay and cavity loss into account, we optimize the cavity external loss rate to maximize the fidelity. We find that its optimum value is formulated similarly to those of other generation methods for propagating states, suggesting a universal property of cavity-QED systems interacting with fields outside the cavity.

quant-ph↗

arXiv2025

Gaussian-wavepacket-model for single-photon generation based on cavity QED in the adiabatic and nonadiabatic conditions

For single-photon generation based on cavity quantum electrodynamics, we investigate a practical model assuming a Gaussian wavepacket. This model makes it possible to comprehensively analyze the temporal dynamics of an atom-cavity system with both adiabatic and nonadiabatic conditions using analytical expressions. These results enable us to clarify the relationship between pulse width and maximum success probability, over the full range of coupling regimes. We demonstrate how to achieve a high success probability while keeping a short pulse width by optimizing the cavity transmittance parameter and the time-controlled exexternal field. Our formulations provide a practical tool for efficient single-photon generation in a wide variety of experimental platforms.

quant-ph↗

arXiv2024

Realization of High-Fidelity CZ Gate based on a Double-Transmon Coupler

Striving for higher gate fidelity is crucial not only for enhancing existing noisy intermediate-scale quantum (NISQ) devices but also for unleashing the potential of fault-tolerant quantum computation through quantum error correction. A recently proposed theoretical scheme, the double-transmon coupler (DTC), aims to achieve both suppressed residual interaction and a fast high-fidelity two-qubit gate simultaneously, particularly for highly detuned qubits. Harnessing the state-of-the-art fabrication techniques and a model-free pulse-optimization process based on reinforcement learning, we translate the theoretical DTC scheme into reality, attaining fidelities of 99.90% for a CZ gate and 99.98% for single-qubit gates. The performance of the DTC scheme demonstrates its potential as a competitive building block for superconducting quantum processors.

quant-ph↗

arXiv2024

Many-hypercube codes: High-rate quantum error-correcting codes for high-performance fault-tolerant quantum computing

Standard approaches to quantum error correction for fault-tolerant quantum computing are based on encoding a single logical qubit into many physical ones, resulting in asymptotically zero encoding rates and therefore huge resource overheads. To overcome this issue, high-rate quantum codes, such as quantum low-density parity-check codes, have been studied over the past decade. In this case, however, it is difficult to perform logical gates in parallel while maintaining low overheads. Here we propose concatenated high-rate small-size quantum error-detecting codes as a new family of high-rate quantum codes. Their simple structure allows for a geometrical interpretation using hypercubes corresponding to logical qubits. We thus call them many-hypercube codes. They can realize both high rates, e.g., 30% (64 logical qubits are encoded into 216 physical ones), and parallelizability of logical gates. Developing dedicated decoder and encoders, we achieve high error thresholds even in a circuit-level noise model. Thus, the many-hypercube codes will pave the way to high-performance fault-tolerant quantum computing.

quant-ph↗

arXiv2024

High-performance multiqubit system with double-transmon couplers: Toward scalable superconducting quantum computers

Tunable couplers in superconducting quantum computers have enabled fast and accurate two-qubit gates, with reported high fidelities over 99% in various architectures and gate implementation schemes. However, there are few tunable couplers whose performance in multi-qubit systems is clarified, except for the most widely used one: single-transmon coupler (STC). Achieving similar accuracy to isolated two-qubit systems remains challenging due to various undesirable couplings but is necessary for scalability. In this work, we numerically analyze a system of three fixed-frequency qubits coupled via two double-transmon couplers (DTCs) where nearest-neighbor qubits are highly detuned and also next nearest-neighbor ones are nearly resonant. The DTC is a recently proposed tunable coupler, which consists of two fixed-frequency transmons coupled through a common loop with an additional Josephson junction. We find that the DTC can not only reduce undesired residual couplings sufficiently, as well as in isolated two-qubits systems, but also enables implementations of 30-ns CZ gates and individual and simultaneous 10-ns $π/2$ pulses with fidelities over 99.99%. For comparison, we also investigate the system where the DTCs are replaced by the STCs. The results show that the DTC outperforms the STC in terms of both residual coupling suppression and gate accuracy in the above systems. From these results, we expect that the DTC architecture is promising for realizing high-performance, scalable superconducting quantum computers.

quant-ph↗

arXiv2024

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↗