Kazuhiro Saito

Kazuhiro Saito

Auto-generated profile, based on publicly available information

Kazuhiro Saito

KDDI Research, Inc.,Fujimino-shi, Saitama,Japan

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 March 2025 in IEEE Transactions on Quantum Engineering
Verified
Journal Article
Open access
RSRei Sato
Rei Sato
CGCui Gordon
Cui Gordon
KSKazuhiro Saito
Kazuhiro Saito
HKHideyuki Kawashima
Hideyuki Kawashima
TNTetsuro Nikuni
Tetsuro Nikuni
SWShohei Watabe
Shohei Watabe
Quantum search algorithms, such as Grover's algorithm, are anticipated to efficiently solve constrained combinatorial optimization problems. However, applying these algorithms to the traveling salesman problem (TSP) on a quantum circuit presents a significant challenge. Existing quantum search algorithms for the TSP typically assume that an initial state—an equal superposition of all feasible solutions satisfying the problem's constraints—is pre-prepared. The query complexity of preparing this state using brute-force methods scales exponentially with the factorial growth of feasible solutions, creating a significant hurdle in designing quantum circuits for large-scale TSPs. To address this issue, we propose a two-step quantum search (TSQS) algorithm that employs two sets of operators. In the first step, all the feasible solutions are amplified into their equal superposition state. In the second step, the optimal solution state is amplified from this superposition state. The TSQS algorithm demonstrates greater efficiency compared to conventional search algorithms that employ a single oracle operator for finding a solution within the encoded space. Encoded in the higher-order unconstrained binary optimization (HOBO) representation, our approach significantly reduces the qubit requirements. This enables efficient initial state preparation through a unified circuit design, offering a quadratic speedup in solving the TSP without prior knowledge of feasible solutions.

25 April 2024
Verified
Book Chapter
Closed access
PDF file
RSRei Sato
Rei Sato
SHShuichiro Haruta
Shuichiro Haruta
KSKazuhiro Saito
Kazuhiro Saito
MKMori Kurokawa
Mori Kurokawa

12 October 2022
Verified
Conference Paper
Open access
KYKei Yonekawa
Kei Yonekawa
KSKazuhiro Saito
Kazuhiro Saito
MKMori Kurokawa
Mori Kurokawa
It is required to detect distribution shift in order to prevent a machine learning model from performance degradation, and human-mediated data analysis from erroneous conclusions. For the purpose of comparing between unknown distributions of high-dimensional data, histograms are suitable density estimators due to its computational efficiency. It is important for histograms for distribution shift detection to have uniform density, which has been demonstrated in existing tree-based or cluster-based histograms. However, existing histograms do not consider generalization capability to out-of-sample data, resulting in degraded detection performance at test time. In this paper, we propose a neural-based histogram for distribution shift detection, which generalizes well to out-of-sample data. The bins of histogram are determined by a model trained to discriminate between a handful reference instances, which reflects their underlying distribution. Due to the batch-wise maximum entropy regularizer calculated from a bootstrap sample, the bins as a subset of the feature space partitioned by the decision boundaries of the model generalize, and thus the histogram keeps its density uniform for out-of-sample data. We evaluate our method on distribution shift detection task using multi-domain real-world datasets. The results show that our method outperforms state-of-the-art histogram-based methods.

15 September 2024
Verified
Conference Paper
Closed access
RSRei Sato
Rei Sato
KSKazuhiro Saito
Kazuhiro Saito
In this paper, we propose a circuit design for implementing quantum walks on complex networks. Quantum walks are powerful tools for various graph-based applications such as spatial search, community detection, and node classification. Although many quantum-walk-based graph algorithms have been extensively studied, specific quantum circuits for implementing these algorithms have not yet been provided. To address this issue, we present a circuit design for implementing the discrete-time quantum walk on complex networks. We investigate the functionality of our circuit using the small-sized Watts-and-Strogatz model as the complex network model, comparing it with theoretical calculations. This work offers a new approach to constructing quantum circuits for implementing quantum walks on arbitrary complex networks.

6 April 2026
Verified
Conference Paper
Closed access
SSShogo Shimada
Shogo Shimada
PGPulak Ranjan Giri
Pulak Ranjan Giri
RSRei Sato
Rei Sato
KSKazuhiro Saito
Kazuhiro Saito
We investigate quantum walk-based hash functions, which are generated from the count distribution generated by a quantum walker on graphs. The method is expected to be one of the promising approaches for generating robust hash functions; however, the quantum computation in small systems is susceptible to spoofing via classical imitation. To address this issue, it is necessary to perform calculations in a quantum space size that classical algorithms are difficult to simulate. In such cases, simply increasing the quantum space size leads to an increase in the number of quantum circuit measurements, thereby increasing the time required to generate the ideal measurement distribution. Based on these facts, we propose a quantum hybrid algorithm combining a quantum walk with a shot-based random projection architecture. This method compresses the output into a fixed-length 256-bit hash by weighting and binarizing the measurement counts of each node. We investigate the proposed method through the numerical simulations of quantum walks on the Hanoi Network (HN4) with $N=4096$. The results demonstrate no hash collisions and an avalanche effect of approximately 49%, which is close to the ideal value of 50%. Additionally, we achieved the consensus robustness of up to 94%, compared to the ideal value of 100%. These results suggest the feasibility of a scalable quantum hash function for Proof of Quantum Work (PoQ) on quantum devices.

6 October 2025 in arXiv
Verified
Preprint
Open access
PDF file
PGPulak Ranjan Giri
Pulak Ranjan Giri
RSRei Sato
Rei Sato
KSKazuhiro Saito
Kazuhiro Saito
Quantum walk has emerged as an essential tool for searching marked vertices on various graphs. Recent advances in the discrete-time quantum walk search algorithm have enabled it to effectively handle multiple marked vertices, expanding its range of applications further. In this article, we propose a novel application of this advanced quantum walk search algorithm for the edge detection of images\textemdash a critical task in digital image processing. Given the probabilistic nature of quantum computing, obtaining measurement result with a high success probability is essential alongside faster computation time. Our quantum walk search algorithm demonstrates a high success probability in detecting the image edges compared to the existing quantum edge detection methods and outperforms classical edge detection methods with a quadratically faster speed. A small Qiskit circuit implementation of our method using a one-dimensional quantum walk search has been executed in Qiskit's $qasm\_simulator$ and $ibm\_sydney(fake)$ device.