arXiv subjects

Hideaki Kawaguchi

Publications and source records attributed to Hideaki Kawaguchi.

At least 19 recordsLinked to original sources

arXiv2026

Quantum Sensing of Non-Repeatable Events Enhanced by In-Sensor Quantum Reservoir Computing

High-density nitrogen-vacancy (NV) ensembles in diamond enable sensitive magnetometry. Many quantum-sensing protocols rely on reproducible target fields, allowing repeated measurements under different sensing conditions. In dynamical decoupling (DD) magnetometry, sweeping the interval between $π$ pulses across repeated measurements enables estimation of the frequency and amplitude of an unknown alternating field. For non-repeatable events, however, the same field waveform cannot be reproduced for measurements under different settings. Here we propose NV-based in-sensor quantum reservoir computing (NV-QRC) for sensing such events. Field-driven many-body dynamics and simultaneous fluorescence readout from multiple spatial regions provide a classical classifier with multiple features from a single event. For binary phase classification, we benchmark NV-QRC against DD magnetometry using a single pulse sequence fixed in advance. We show that NV-QRC can retain class-dependent information in regimes where the fixed-DD protocol fails to capture it. These results identify non-repeatable-event sensing as a promising application of quantum reservoir computing.

quant-ph↗

arXiv2026

Digital Annealer-Assisted CNOT Oriented Quantum Circuit Transpilation with Integrated QUBO Mapping and Routing

Limited qubit counts and two-qubit gate errors motivate reducing CNOT overhead in noisy intermediate-scale quantum (NISQ) transpilation. In circuit-partitioning workflows, repeated hardware sampling can motivate additional classical search, although this study does not evaluate end-to-end runtime or hardware fidelity. We evaluate two Digital Annealer (DA) strategies on seven fixed standalone benchmark instances and a 64-node 8 x 8 square-grid. Hybrid combines DA-based global initial mapping with Qiskit routing, whereas Full DA applies DA to both initial mapping and iterative routing. Hybrid achieved lower mean equivalent CNOT counts than both configured baselines on four benchmarks and identical means on the remaining three. The unweighted macro-average reductions were 6.14% relative to Qiskit and 17.9% relative to $t|ket\rangle$. Among the six benchmarks with feasible Full DA outputs, Full DA achieved lower means than ISAAQ on five, with a success-conditioned macro-average reduction of 48.9%; however, it produced no feasible BV output and did not outperform Hybrid on any benchmark. These results identify DA-generated global placement followed by heuristic routing as the primary positive result and characterize the limitations of the evaluated short-horizon DA routing workflow. Equivalent CNOT count is a structural proxy and does not directly measure execution fidelity.

quant-ph↗

arXiv2026

Dense packing of the surface code: code deformation procedures and hook-error-avoiding gate scheduling

The surface code is one of the leading quantum error correction codes for realizing large-scale fault-tolerant quantum computing (FTQC). One major challenge in realizing surface-code-based FTQC is the extremely large number of qubits required. To mitigate this problem, fusing multiple codewords of the surface code into a densely packed configuration has been proposed. It is known that by using dense packing, the number of physical qubits required per logical qubit can be reduced to approximately three-fourths compared to simply placing surface-code patches side by side. Despite its potential, concrete deformation procedures and quantitative error-rate analyses have remained largely unexplored. In this work, we present a detailed code-deformation procedure that transforms multiple standard surface code patches into a densely packed, connected configuration, along with a conceptual microarchitecture to utilize this dense packing. We also propose a CNOT gate-scheduling for stabilizer measurement circuits that suppresses hook errors in the densely packed surface code. We performed circuit-level Monte Carlo noise simulation of densely packed surface codes using this gate scheduling. The numerical results demonstrate that as the code distance of the densely packed surface code increases and the physical error rate decreases, the logical error rate of the densely packed surface code becomes lower than that of the standard surface code. Furthermore, we find that only when employing hook-error-avoiding syndrome extraction can the densely packed surface code achieve a lower logical error rate than the standard surface code, while simultaneously reducing the space overhead.

quant-ph↗

arXiv2026

Practical Quantum Federated Learning for Privacy-Sensitive Healthcare: Communication Efficiency and Noise Resilience

AI-driven medical diagnostics increasingly requires collaborative model training across institutions, yet centralizing patient data conflicts with privacy regulations. Federated Learning enables distributed training without raw data sharing, but remains vulnerable to gradient inversion and model leakage attacks. Furthermore, harvest-now-decrypt-later attacks render computationally secure protocols insufficient for protecting long-lived medical records. Quantum communication offers information-theoretic security immune to such threats, making Quantum Federated Learning (QFL) a compelling framework for healthcare. However, practical deployment is constrained by communication overhead and quantum channel noise. We present a systematic quantitative study of communication, convergence, and noise trade-offs in QFL, introducing two complementary strategies to reduce quantum transmissions: (1) structured parameter reduction via light-cone feature selection in parameterized quantum circuits, and (2) a Hybrid QFL architecture that dynamically switches between centralized and decentralized aggregation. We show that Hybrid QFL reduces total quantum transmissions from $3\,TNMP$, the cost of pure Centralized QFL, to $\{3t + 2(T - t)\}\,NMP$ over $T$ rounds while preserving near-centralized convergence. We further demonstrate that decentralized aggregation is more noise-resilient under depolarizing noise, and evaluate Steane code-based quantum error correction in high-noise regimes. Our results provide an integrated design framework for communication-efficient, noise-aware QFL, clarifying practical trade-offs for scalable quantum-secure distributed learning in healthcare.

quant-ph↗

arXiv2026

QuBridge: Layer-wise Fidelity Decomposition in Quantum Computation Pipeline

Running a quantum circuit on current hardware involves a sequence of engineering decisions, each with tunable parameters and distinct error characteristics. Existing tools optimize each decision in isolation, leaving practitioners unable to determine how much each decision contributes to final output quality. We present QuBridge, a pipeline analysis tool that decomposes quantum computation into three decision layers and measures each layer's fidelity contribution through progressive ablation and isolation experiments. Applied to quantum teleportation under IBM-calibrated noise models, the framework surfaces three phenomena that end-to-end measurement obscures. Qubit selection narrows the worst-case fidelity band from 11.8% to under 2% with downstream layers held fixed, without changing the peak. Per-gate pulse-shape assignment adds a +0.9% residual gain whose attributed magnitude depends on upstream layout. Error-detection encoding is not uniformly advantageous, and its conditional benefit emerges for input states whose dominant error channel is detectable by the chosen code. QuBridge operates on cached calibration data without requiring live hardware access.

quant-ph↗

arXiv2026

Quantum-Enhanced Processing with Tensor-Network Frontends for Privacy-Aware Federated Medical Diagnosis

We propose a privacy-aware hybrid framework for federated medical image classification that combines tensor-network representation learning, MPC-secured aggregation, and post-aggregation quantum refinement. The framework is motivated by two practical constraints in privacy-aware federated learning: MPC can introduce substantial communication overhead, and direct quantum processing of high-dimensional medical images is unrealistic with a small number of qubits. To address both constraints within a single architecture, client-side tensor-network frontends, Matrix Product State (MPS), Tree Tensor Network (TTN), and Multi-scale Entanglement Renormalization Ansatz (MERA), compress local inputs into compact latent representations, after which a Quantum-Enhanced Processor (QEP) refines the aggregated latent feature through quantum-state embedding and observable-based readout. Experiments on PneumoniaMNIST show that the effect of the QEP is frontend-dependent rather than uniform across architectures. In the present setting, the TTN+QEP combination exhibits the most balanced overall profile. The results also suggest that the QEP behaves more stably when the qubit count is sufficiently matched to the latent dimension, while noisy conditions degrade performance relative to the noiseless setting. The MPC benchmark further shows that communication cost is governed primarily by the dimension of the protected latent representation. This indicates that tensor-network compression plays a dual role: it enables small-qubit quantum processing on compressed latent features and reduces the communication overhead associated with secure aggregation. Taken together, these results support a co-design perspective in which representation compression, post-aggregation quantum refinement, and privacy-aware deployment should be optimized jointly.

quant-ph↗

arXiv2026

Telemetry-Based Server Selection in the Quantum Internet via Cross-Layer Runtime Estimation

The Quantum Internet will allow clients to delegate quantum workloads to remote servers over heterogeneous networks, but choosing the server that minimizes end-to-end execution time is difficult because server processing, feedforward classical communication, and entanglement distribution can overlap in protocol-dependent ways and shift the runtime bottleneck. We propose $T_{\max}$, a lightweight runtime score that sums coarse telemetry from multiple layers to obtain a conservative ranking for online server selection without calibrating weights for each deployment. Using NetSquid discrete-event simulations of a modified parameter-blind VQE (PB-VQE) workload, we evaluate $T_{\max}$ on pools of 10,000 heterogeneous candidates (selecting among up to 100 per decision) across crossover and bottleneck-dominated regimes, including temporal jitter scenarios and jobs with multiple shots. $T_{\max}$ achieves single-digit mean regret normalized by the oracle (below 10%) in both regimes and remains in the single-digit range under classical communication latency jitter for multi-shot jobs, while performance degrades for single-shot jobs under severe jitter. To connect performance to deployment planning, we derive an operating map based on requirements relating distance and entanglement rate requirements to protocol level counts, quantify how simple multiuser contention shifts the crossover, and use Sobol global sensitivity analysis to identify regime-dependent bottlenecks. These findings suggest that simple cross-layer telemetry can enable practical server selection while providing actionable provisioning guidance for emerging Quantum Internet services.

quant-ph↗

arXiv2025

RuleSet Generation Framework for Application Layer Integration in Quantum Internet

Layered architectures for the Quantum Internet have been proposed, inspired by that of the classical Internet, which has demonstrated high maintainability even in large-scale systems. While lower layers in the Quantum Internet, such as entanglement generation and distribution, have been extensively studied, the application layer - responsible for translating user requests into executable quantum-network operations - remains largely unexplored. A significant challenge is translating application-level requests into the concrete instructions executable at lower layers. In this work, we introduce a RuleSet-based framework that explicitly incorporates the application layer into the layered architecture of the Quantum Internet. Our framework builds on a RuleSet-based protocol, clarifying communication procedures, organizing application request information, and introducing new Rules for application execution by embedding application specifications into RuleSets. To evaluate feasibility, we constructed state machines from the generated RuleSets. This approach enables a transparent integration from the application layer down to the physical layer, thereby lowering barriers to deploying new applications on the Quantum Internet.

quant-ph↗

arXiv2025

Extension of Dynamic Network Biomarker using the propensity score method: Simulation of causal effects on variance and correlation coefficient

In clinical biomarker studies, the Dynamic Network Biomarker (DNB) is sometimes used. DNB is a composite variable derived from the variance and the Pearson correlation coefficient of biological signals. When applying DNB to clinical data, it is important to account for confounding bias. However, little attention has been paid to statistical causal inference methods for variance and correlation coefficients. This study evaluates confounding adjustment using propensity score matching (PSM) through Monte Carlo simulations. Our results support the use of PSM to reduce bias and improve group comparisons when DNB is applied to clinical data.

stat.ME↗

arXiv2025

Quantitative Evaluation of Quantum/Classical Neural Network Using a Game Solver Metric

To evaluate the performance of quantum computing systems relative to classical counterparts and explore the potential, we propose a game-solving benchmark based on Elo ratings in the game of tic-tac-toe. We compare classical convolutional neural networks (CCNNs), quantum or quantum convolutional neural networks (QNNs, QCNNs), and hybrid classical-quantum neural networks (Hybrid NNs) by assessing their performance based on round-robin matches. Our results show that the Hybrid NNs engines achieve Elo ratings comparable to those of CCNNs engines, while the quantum engines underperform under current hardware constraints. Additionally, we implement a QNN integrated with quantum communication and evaluate its performance to quantify the overhead introduced by noisy quantum channels, and the communication overhead was found to be modest. These results demonstrate the viability of using game-based benchmarks for evaluating quantum computing systems and suggest that quantum communication can be incorporated with limited impact on performance, providing a foundation for future hybrid quantum applications.

quant-ph↗

arXiv2025

Enhancing the Dynamic Range of Quantum Sensing via Quantum Circuit Learning

Quantum metrology is a promising application of quantum technologies, enabling the precise measurement of weak external fields at a local scale. In typical quantum sensing protocols, a qubit interacts with an external field, and the amplitude of the field is estimated by analyzing the expectation value of a measured observable. Sensitivity can, in principle, be enhanced by increasing the number of qubits within a fixed volume, thereby maintaining spatial resolution. However, at high qubit densities, inter-qubit interactions induce complex many-body dynamics, resulting in multiple oscillations in the expectation value of the observable even for small field amplitudes. This ambiguity reduces the dynamic range of the sensing protocol. We propose a method to overcome the limitation in quantum metrology by adopting a quantum circuit learning framework using a parameterized quantum circuit to approximate a target function by optimizing the circuit parameters. In our method, after the qubits interact with the external field, we apply a sequence of parameterized quantum gates and measure a suitable observable. By optimizing the gate parameters, the expectation value is trained to exhibit a monotonic response within a target range of field amplitudes, thereby eliminating multiple oscillations and enhancing the dynamic range. This method offers a strategy for improving quantum sensing performance in dense qubit systems.

quant-ph↗

arXiv2025

Quantum Circuit Learning Using Non-Integrable System Dynamics

Quantum machine learning is an approach that aims to improve the performance of machine learning methods by leveraging the properties of quantum computers. In quantum circuit learning (QCL), a supervised learning method that can be implemented using variational quantum algorithms (VQAs), the process of encoding input data into quantum states has been widely discussed for its important role on the expressive power of learning models. In particular, the properties of the eigenvalues of the Hamiltonian used for encoding significantly influence model performance. Recent encoding methods have demonstrated that the expressive power of learning models can be enhanced by applying exponentially large magnetic fields proportional to the number of qubits. However, this approach poses a challenge as it requires exponentially increasing magnetic fields, which are impractical for implementation in large-scale systems. Here, we propose a QCL method that leverages a non-integrable Hamiltonian for encoding, aiming to achieve both enhanced expressive power and practical feasibility. We find that the thermalization properties of non-integrable systems over long timescales, implying that the energy difference has a low probability to be degenerate, lead to an enhanced expressive power for QCL. Since the required magnetic field strength remains within a practical range, our approach to using the non-integrable system is suitable for large-scale quantum computers. Our results bridge the dynamics of non-integrable systems and the field of quantum machine learning, suggesting the potential for significant interdisciplinary contributions.

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↗

arXiv2024

Light-cone feature selection for quantum machine learning

Feature selection plays an essential role in improving the predictive performance and interpretability of trained models in classical machine learning. On the other hand, the usability of conventional feature selection could be limited for quantum machine learning tasks; the technique might not provide a clear interpretation on embedding quantum circuits for classical data tasks and, more importantly, is not applicable to quantum data tasks. In this work, we propose a feature selection method with a specific focus on quantum machine learning. Our scheme treats the light-cones (i.e., subspace) of quantum models as features and then select relevant ones through training of the corresponding local quantum kernels. We numerically demonstrate its versatility for four different applications using toy tasks: (1) feature selection of classical inputs, (2) circuit architecture search for data embedding, (3) compression of quantum machine learning models and (4) subspace selection for quantum data. The proposed framework paves the way towards applications of quantum machine learning to practical tasks. Also, this technique could be used to practically test if the quantum machine learning tasks really need quantumness, while it is beyond the scope of this work.

quant-ph↗

arXiv2024

Towards quantum computing for clinical trial design and optimization: A perspective on new opportunities and challenges

Clinical trials are pivotal in the drug discovery process to determine the safety and efficacy of a drug candidate. The high failure rates of these trials are attributed to deficiencies in clinical model development and protocol design. Improvements in the clinical drug design process could therefore yield significant benefits for all stakeholders involved. This paper examines the current challenges faced in clinical trial design and optimization, reviews established classical computational approaches, and introduces quantum algorithms aimed at enhancing these processes. Specifically, the focus is on three critical aspects: clinical trial simulations, site selection, and cohort identification. This study aims to provide a comprehensive framework that leverages quantum computing to innovate and refine the efficiency and effectiveness of clinical trials.

quant-ph↗

arXiv2023

Estimation of mutual information via quantum kernel method

Recently, the importance of analysing data and collecting valuable insight efficiently has been increasing in various fields. Estimating mutual information (MI) plays a critical role to investigate the relationship among multiple random variables with a nonlinear correlation. Particularly, the task to determine whether they are independent or not is called the independence test, whose core subroutine is estimating MI from given data. It is a fundamental tool in statistics and data analysis that can be applied in a wide range of application such as hypothesis testing, causal discovery and more. In this paper, we propose a method for estimating mutual information using the quantum kernel. We investigate the performance under various problem settings, such as different sample size or the shape of the probability distribution. As a result, the quantum kernel method showed higher performance than the classical one under the situation that the number of samples is small, the variance is large or the variables posses highly non-linear relationships. We discuss this behavior in terms of the central limit theorem and the structure of the corresponding quantum reproducing kernel Hilbert space.

quant-ph↗

arXiv2022

Quantum Fisher kernel for mitigating the vanishing similarity issue

Quantum kernel method is a machine learning model exploiting quantum computers to calculate the quantum kernels (QKs) that measure the similarity between data. Despite the potential quantum advantage of the method, the commonly used fidelity-based QK suffers from a detrimental issue, which we call the vanishing similarity issue; detecting the difference between data becomes hard with the increase of the number of qubits, due to the exponential decrease of the expectation and the variance of the QK. This implies the need to design QKs alternative to the fidelity-based one. In this work, we propose a new class of QKs called the quantum Fisher kernels (QFKs) that take into account the geometric structure of the data source. We analytically and numerically demonstrate that the QFK based on the anti-symmetric logarithmic derivatives (ALDQFK) can avoid the issue when the alternating layered ansatzs (ALAs) are used, while the fidelity-based QK cannot even with the ALAs. Moreover, the Fourier analysis numerically elucidates that the ALDQFK can have expressivity comparable to that of the fidelity-based QK. These results indicate that the QFK paves the way for practical applications of quantum machine learning with possible quantum advantages.

quant-ph↗

arXiv2021

Application of quantum computing to a linear non-Gaussian acyclic model for novel medical knowledge discovery

Recently, with the digitalization of medicine, the utilization of real-world medical data collected from clinical sites has been attracting attention. In this study, quantum computing was applied to a linear non-Gaussian acyclic model to discover causal relationships from real-world medical data alone. Specifically, the independence measure of DirectLiNGAM, a causal discovery algorithm, was calculated using the quantum kernel and its accuracy on real-world medical data was verified. When DirectLiNGAM with the quantum kernel (qLiNGAM) was applied to real-world medical data, a case was confirmed in which the causal structure could be correctly estimated when the amount of data was small, which was not possible with existing methods. Furthermore, qLiNGAM was implemented on real quantum hardware in an experiment using IBMQ. It is suggested that qLiNGAM may be able to discover new medical knowledge and contribute to the solution of medical problems, even when only a small amount of data is available.

quant-ph↗