arXiv subjects

Naoki Kanazawa

Publications and source records attributed to Naoki Kanazawa.

17 recordsLinked to original sources

arXiv2025

Observability Architecture for Quantum-Centric Supercomputing Workflows

Quantum-centric supercomputing (QCSC) workflows often involve hybrid classical-quantum algorithms that are inherently probabilistic and executed on remote quantum hardware, making them difficult to interpret and limiting the ability to monitor runtime performance and behavior. The high cost of quantum circuit execution and large-scale high-performance computing (HPC) infrastructure further restricts the number of feasible trials, making comprehensive evaluation of execution results essential for iterative development. We propose an observability architecture tailored for QCSC workflows that decouples telemetry collection from workload execution, enabling persistent monitoring across system and algorithmic layers and retaining detailed execution data for reproducible and retrospective analysis, eliminating redundant runs. Applied to a representative workflow involving sample-based quantum diagonalization, our system reveals solver behavior across multiple iterations. This approach enhances transparency and reproducibility in QCSC environments, supporting infrastructure-aware algorithm design and systematic experimentation.

quant-ph↗

arXiv2025

Shift of quantum critical point of discrete time crystal on a noisy quantum simulator

Recent advances in quantum technology have enabled the simulation of quantum many-body systems on real quantum devices. However, such quantum simulators are inherently subject to decoherence, and its impact on system dynamics - particularly near quantum phase transitions - remains insufficiently understood. In this work, we experimentally investigate how decoherence in quantum devices affects the dynamics of quantum time crystals, using a 156-qubit IBM Quantum system. We find that decoherence shifts the location of critical behavior associated with the phase transition, suggesting that noisy simulations can lead to inaccurate identification of phase boundaries. Our results underscore the importance of understanding and mitigating decoherence to reliably simulate quantum many-body systems on near-term quantum hardware.

quant-ph↗

arXiv2024

Qudit-Generalization of the Qubit Echo and Its Application to a Qutrit-Based Toffoli Gate

The fidelity of certain gates on noisy quantum computers may be improved when they are implemented using more than two levels of the involved transmons. The main impediments to achieving this potential are the dynamic gate phase errors that cannot be corrected via calibration. The standard tool for countering such phase errors in two-level qubits is the echo protocol, often referred to as the dynamical decoupling sequence, where the evolution of a qubit is punctuated by an even number of X gates. We introduce basis cycling, which is a direct generalization of the qubit echo to general qudits, and provide an analytic framework for designing gate sequences to produce desired effects using this technique. We then apply basis cycling to a Toffoli gate decomposition incorporating a qutrit and obtain CCZ gate fidelity values up to 93.8$\pm$0.1%, measured by quantum process tomography, on IBM quantum computers. The gate fidelity remains stable without recalibration even while the resonant frequency of the qutrit fluctuates, highlighting the dynamical nature of phase error cancellation through basis cycling. Our results demonstrate that one of the biggest difficulties in implementing qudit-based gate decompositions on superconducting quantum computers can be systematically overcome when certain conditions are met, and thus open a path toward fulfilling the promise of qudits as circuit optimization agents.

quant-ph↗

arXiv2024

Current-induced magnon trapping in spin torque oscillation

Spin torque nano-oscillators realized by magnetization dynamics trapped in a current-induced potential are reported. We fabricated Ni$_{81}$Fe$_{19}$/Pt nanostructures and measured current-induced microwave emission from the structures. The result shows an increase in the magnitude and spectral narrowing of the microwave emission. We demonstrate that the current-induced magnetic field suppresses magnon radiation loss and significantly reduces the linewidth and the threshold current required for the spin torque oscillation.

cond-mat.mes-hall↗

arXiv2024

Dynamics of measurement-induced state transitions in superconducting qubits

We have investigated temporal fluctuation of superconducting qubits via the time-resolved measurement for an IBM Quantum system. We found that the qubit error rate abruptly changes during specific time intervals. Each high error state persists for several tens of seconds, and exhibits an on-off behavior. The observed temporal instability can be attributed to qubit transitions induced by a measurement stimulus. Resonant transition between fluctuating dressed states of the qubits coupled with high-frequency resonators can be responsible for the error-rate change.

quant-ph↗

arXiv2023

Three-qubit Parity Gate via Simultaneous Cross Resonance Drives

Native multi-qubit parity gates have various potential quantum computing applications, such as entanglement creation, logical state encoding and parity measurement in quantum error correction. Here, using simultaneous cross-resonance drives on two control qubits with a common target, we demonstrate an efficient implementation of a three-qubit parity gate. We have developed a calibration procedure based on the one for the echoed cross-resonance gate. We confirm that our use of simultaneous drives leads to higher interleaved randomized benchmarking fidelities than a naive implementation with two consecutive CNOT gates. We also demonstrate that our simultaneous parity gates can significantly improve the parity measurement error probability for the heavy-hexagon code on an IBM Quantum processor using seven superconducting qubits with all-microwave control.

quant-ph↗

arXiv2023

Qutrit state discrimination with mid-circuit measurements

Qutrit state readout is an important technology not only for execution of qutrit algorithms but also for erasure detection in error correction circuits and leakage error characterization of the gate set. Conventional technique using a specialized IQ discriminator requires memory intensive IQ data for input, and has difficulty in scaling up the system size. In this study, we propose the mid-circuit measurement based discrimination technique which exploits a binary discriminator for qubit readout. Our discriminator shows comparable performance with the IQ discriminator, and readily available for standard quantum processors calibrated for qubit control. We also demonstrate our technique can reimplement typical benchmarking and characterization experiments such as leakage randomized benchmarking and state population decay measurement.

quant-ph↗

arXiv2023

Detection of temporal fluctuation in superconducting qubits for quantum error mitigation

We have investigated instability of a superconducting quantum computer by continuously monitoring the qubit output. We found that qubits exhibit a step-like change in the error rates. This change is repeatedly observed, and each step persists for several minutes. By analyzing the correlation between the increased errors and anomalous variance of the output, we demonstrate quantum error mitigation based on post-selection. Numerical analysis on the proposed method was also conducted.

quant-ph↗

arXiv2023

Floquet Analysis of Frequency Collisions

Implementation of high-fidelity gate operations on integrated-qubit systems is of vital importance for fault-tolerant quantum computation. Qubit frequency allocation is an essential part of improving control fidelity. A metric for qubit frequency allocation, frequency collision, has been proposed on simple systems of only a few qubits driven by a mono-modal microwave drive. However, frequency allocation for quantum processors for more advanced purposes, such as quantum error correction, needs further investigation. In this study, we propose a Floquet analysis of frequency collisions. The key to our proposed method is a reinterpretation of frequency collisions as an unintended degeneracy of Floquet states, which allows a collision analysis on more complex systems with many qubits driven by multi-modal microwave drives. Although the Floquet state is defined in an infinite-dimensional Hilbert space, we develop algorithms, based on operation perturbation theory, to truncate the Hilbert space down to the optimal computational complexity. In particular, we show that the computational complexity of the collision analysis for a sparse qubit lattice is linear with the number of qubits. Finally, we demonstrate our proposed method on Cross-Resonance based experimental protocols. We first study the Cross-Resonance gate in an isolated three-qubit system, where the effectiveness of our method is verified by comparing it with previous studies. We next consider the more complex problem of syndrome extraction in the heavy-hexagon code. Our proposed method advances our understanding of quantum control for quantum processors and contributes to their improved design and control.

quant-ph↗

arXiv2022

Minimum quantum run-time characterization and calibration via restless measurements with dynamic repetition rates

The performance of a quantum processor depends on the characteristics of the device and the quality of the control pulses. Characterizing cloud-based quantum computers and calibrating the pulses that control them is necessary for high-fidelity operations. However, this time intensive task eats into the availability of the device. Here, we show restless measurements with a dynamic repetition rate that speed-up calibration and characterization tasks. Randomized benchmarking is performed 5.3 times faster on the quantum device than when an active reset is used and without discarding any data. In addition, we calibrate a qubit with parameter scans and error-amplifying gate sequences and show speed-ups of up to a factor of forty on the quantum device over active reset. Finally, we present a methodology to perform restless quantum process tomography that mitigates restless state preparation errors. These results reduce the footprint of characterization and calibration tasks. Quantum computers can thus either spend more time running applications or run calibrations more often to maintain gate fidelity.

quant-ph↗

arXiv2022

Experimental Bayesian estimation of quantum state preparation, measurement, and gate errors in multi-qubit devices

We introduce a Bayesian method for the estimation of single qubit errors in quantum devices, and use it to characterize these errors on three 27-qubit superconducting qubit devices. We self-consistently estimate up to seven parameters of each qubit's state preparation, readout, and gate errors, analyze the stability of these errors as a function of time, and demonstrate easily implemented approaches for mitigating different errors before a quantum computation experiment. On the investigated devices we find non-negligible qubit reset errors that cannot be parametrized as a diagonal mixed state, but manifest as a coherent phase of a superposition with a small contribution from the qubit's excited state. We are able to mitigate such errors by applying pre-rotations on the initialized qubits, which we demonstrate with multi-qubit entangled states. Our results demonstrate that Bayesian estimation can resolve small parameters - including those pertaining to quantum gate errors - with a high relative accuracy, at a lower measurement cost as compared with standard characterization approaches.

quant-ph↗

arXiv2021

Implementing a Ternary Decomposition of the Toffoli Gate on Fixed-FrequencyTransmon Qutrits

Quantum computation is conventionally performed using quantum operations acting on two-level quantum bits, or qubits. Qubits in modern quantum computers suffer from inevitable detrimental interactions with the environment that cause errors during computation, with multi-qubit operations often being a primary limitation. Most quantum devices naturally have multiple accessible energy levels beyond the lowest two traditionally used to define a qubit. Qudits offer a larger state space to store and process quantum information, reducing complexity of quantum circuits and improving efficiency of quantum algorithms. Here, we experimentally demonstrate a ternary decomposition of a multi-qubit operation on cloud-enabled fixed-frequency superconducting transmons. Specifically, we realize an order-preserving Toffoli gate consisting of four two-transmon operations, whereas the optimal order-preserving binary decomposition uses eight \texttt{CNOT}s on a linear transmon topology. Both decompositions are benchmarked via truth table fidelity where the ternary approach outperforms on most sets of transmons on \texttt{ibmq\_jakarta}, and is further benchmarked via quantum process tomography on one set of transmons to achieve an average gate fidelity of 78.00\% $\pm$ 1.93\%.

quant-ph↗

arXiv2021

Experimental implementation of non-Clifford interleaved randomized benchmarking with a controlled-S gate

Hardware efficient transpilation of quantum circuits to a quantum devices native gateset is essential for the execution of quantum algorithms on noisy quantum computers. Typical quantum devices utilize a gateset with a single two-qubit Clifford entangling gate per pair of coupled qubits, however, in some applications access to a non-Clifford two-qubit gate can result in more optimal circuit decompositions and also allows more flexibility in optimizing over noise. We demonstrate calibration of a low error non-Clifford Controlled-$\fracπ{2}$ phase (CS) gate on a cloud based IBM Quantum computing using the Qiskit Pulse framework. To measure the gate error of the calibrated CS gate we perform non-Clifford CNOT-Dihedral interleaved randomized benchmarking. We are able to obtain a gate error of $5.9(7) \times 10^{-3}$ at a gate length 263 ns, which is close to the coherence limit of the associated qubits, and lower error than the backends standard calibrated CNOT gate.

quant-ph↗

arXiv2021

Cross cross resonance gate

Implementation of high-fidelity swapping operations is of vital importance to execute quantum algorithms on a quantum processor with limited connectivity. We present an efficient pulse control technique, cross-cross resonance (CCR) gate, to implement iSWAP and SWAP operations with dispersively-coupled fixed-frequency transmon qubits. The key ingredient of the CCR gate is simultaneously driving both of the coupled qubits at the frequency of another qubit, wherein the fast two-qubit interaction roughly equivalent to the XY entangling gates is realized without strongly driving the qubits. We develop the calibration technique for the CCR gate and evaluate the performance of iSWAP and SWAP gates The CCR gate shows roughly two-fold improvement in the average gate error and more than 10~\% reduction in gate times from the conventional decomposition based on the cross resonance gate.

quant-ph↗

arXiv2020

Demonstration of quantum volume 64 on a superconducting quantum computing system

We improve the quality of quantum circuits on superconducting quantum computing systems, as measured by the quantum volume, with a combination of dynamical decoupling, compiler optimizations, shorter two-qubit gates, and excited state promoted readout. This result shows that the path to larger quantum volume systems requires the simultaneous increase of coherence, control gate fidelities, measurement fidelities, and smarter software which takes into account hardware details, thereby demonstrating the need to continue to co-design the software and hardware stack for the foreseeable future.

quant-ph↗

arXiv2020

Qiskit Pulse: Programming Quantum Computers Through the Cloud with Pulses

The quantum circuit model is an abstraction that hides the underlying physical implementation of gates and measurements on a quantum computer. For precise control of real quantum hardware, the ability to execute pulse and readout-level instructions is required. To that end, we introduce Qiskit Pulse, a pulse-level programming paradigm implemented as a module within Qiskit-Terra \cite{Qiskit}. To demonstrate the capabilities of Qiskit Pulse, we calibrate both un-echoed and echoed variants of the cross-resonance entangling gate with a pair of qubits on an IBM Quantum system accessible through the cloud. We perform Hamiltonian characterization of both single and two-pulse variants of the cross-resonance entangling gate with varying amplitudes on a cloud-based IBM Quantum system. We then transform these calibrated sequences into a high-fidelity CNOT gate by applying pre and post local-rotations to the qubits, achieving average gate fidelities of $F=0.981$ and $F=0.979$ for the un-echoed and echoed respectively. This is comparable to the standard backend CNOT fidelity of $F_{CX}=0.984$. Furthermore, to illustrate how users can access their results at different levels of the readout chain, we build a custom discriminator to investigate qubit readout correlations. Qiskit Pulse allows users to explore advanced control schemes such as optimal control theory, dynamical decoupling, and error mitigation that are not available within the circuit model.

quant-ph↗

arXiv2019

Recent Advances in Physical Reservoir Computing: A Review

Reservoir computing is a computational framework suited for temporal/sequential data processing. It is derived from several recurrent neural network models, including echo state networks and liquid state machines. A reservoir computing system consists of a reservoir for mapping inputs into a high-dimensional space and a readout for pattern analysis from the high-dimensional states in the reservoir. The reservoir is fixed and only the readout is trained with a simple method such as linear regression and classification. Thus, the major advantage of reservoir computing compared to other recurrent neural networks is fast learning, resulting in low training cost. Another advantage is that the reservoir without adaptive updating is amenable to hardware implementation using a variety of physical systems, substrates, and devices. In fact, such physical reservoir computing has attracted increasing attention in diverse fields of research. The purpose of this review is to provide an overview of recent advances in physical reservoir computing by classifying them according to the type of the reservoir. We discuss the current issues and perspectives related to physical reservoir computing, in order to further expand its practical applications and develop next-generation machine learning systems.

cs.ET↗