Tetsuo Shibuya
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Tetsuo Shibuya has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Robert D. Barish
Institute of Medical Science, University of Tokyo
12 shared publications - Akito Yamamoto
The University of Tokyo
7 shared publications - Arda Akdemir
University of Tokyo
3 shared publications - Kunihiko Sadakane
The University of Tokyo
3 shared publications - Quentin Hillebrand
The University of Tokyo Tokyo Japan
3 shared publications - Vorapong Suppakitpaisarn
The University of Tokyo
3 shared publications
Latest Publications
- 5 August 2026
- Published by IOP Publishing in Physica Scripta
- Vol. 101 (31) , 315102
QuProFS: an evolutionary training-free approach to efficient quantum feature map search
The quest for effective quantum feature maps for data encoding presents significant challenges, particularly due to the flat training landscapes and lengthy training processes associated with parameterized quantum circuits. To address the gap between training-free search evaluation and downstream task performance, we propose Quantum Proxy-assisted Feature Search (QuProFS) framework that employs circuit-based heuristics focused on trainability, hardware robustness, generalization ability, expressivity, complexity, and kernel-target alignment. By ranking circuit architectures with various proxies, we reduce evaluation costs and incorporate hardware-aware circuits to enhance robustness against noise. We evaluate QuProFS on binary classification tasks using a quantum support vector machine on nine benchmark datasets, including Breast Cancer, MNIST-2, Fashion-MNIST-2, Coset-10, Two Curves, Hidden Manifold, Linearly Separable, Bars-and-Stripes, and Hyperplane, using both quantum simulators and IBM Quantum hardware. Compared with existing quantum architecture search methods, QuProFS achieves the highest accuracy on the majority of benchmark datasets while reducing architecture search time by up to 2 × . Furthermore, QuProFS achieves classification performance comparable to strong classical machine learning baselines on several benchmark datasets, demonstrating an efficient and scalable strategy for quantum feature map optimization.
- 5 August 2026
- Published by IOP Publishing in Physica Scripta
- Vol. 101 (31) , 315102
QuProFS: an evolutionary training-free approach to efficient quantum feature map search
The quest for effective quantum feature maps for data encoding presents significant challenges, particularly due to the flat training landscapes and lengthy training processes associated with parameterized quantum circuits. To address the gap between training-free search evaluation and downstream task performance, we propose Quantum Proxy-assisted Feature Search (QuProFS) framework that employs circuit-based heuristics focused on trainability, hardware robustness, generalization ability, expressivity, complexity, and kernel-target alignment. By ranking circuit architectures with various proxies, we reduce evaluation costs and incorporate hardware-aware circuits to enhance robustness against noise. We evaluate QuProFS on binary classification tasks using a quantum support vector machine on nine benchmark datasets, including Breast Cancer, MNIST-2, Fashion-MNIST-2, Coset-10, Two Curves, Hidden Manifold, Linearly Separable, Bars-and-Stripes, and Hyperplane, using both quantum simulators and IBM Quantum hardware. Compared with existing quantum architecture search methods, QuProFS achieves the highest accuracy on the majority of benchmark datasets while reducing architecture search time by up to 2 × . Furthermore, QuProFS achieves classification performance comparable to strong classical machine learning baselines on several benchmark datasets, demonstrating an efficient and scalable strategy for quantum feature map optimization.
- Open Access
- 4 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 1786-1798
Communication-Efficient Publication of Sparse Vectors under Differential Privacy via Poisson Private Representation
We present a method for privately publishing sparse vectors with communication and computation costs that scale linearly with the number of nonzero elements. The Poisson Private Representation (PPR) framework was introduced to compress any differentially private mechanism to achieve a communication cost of O(ϵ), where ϵ is the privacy budget. However, PPR and its variant, Chunk PPR, are not well suited for publishing sparse vectors under metric differential privacy: PPR incurs exponential computation cost, while Chunk PPR requires both execution and communication costs linear in the vector dimension. As a result, their guarantees are no stronger than those of non-compressed randomized response, which for a matrix with N users, n columns, and m nonzero elements, requires Ω(nN) communication—rendering it impractical for large-scale data. Our PPR-based algorithm overcomes these limitations, reducing communication to O (ϵm). Remarkably, this is even lower than the non-private baseline, which needs Ω(m log n) bits. Furthermore, as the privacy budget decreases, communication cost is further reduced, enabling stronger privacy with greater efficiency We provide theoretical guarantees showing that our method yields results equivalent to randomized response, and experimental evaluations confirm its advantages in accuracy, communication efficiency, and computational complexity. Finally, we demonstrate its applicability across domains such as social-network adjacency matrices, user-item interaction matrices in recommender systems, and single-nucleotide polymorphism (SNP) profiles in genomic data.
- 4 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 1786-1798
Open AccessCommunication-Efficient Publication of Sparse Vectors under Differential Privacy via Poisson Private Representation
We present a method for privately publishing sparse vectors with communication and computation costs that scale linearly with the number of nonzero elements. The Poisson Private Representation (PPR) framework was introduced to compress any differentially private mechanism to achieve a communication cost of O(ϵ), where ϵ is the privacy budget. However, PPR and its variant, Chunk PPR, are not well suited for publishing sparse vectors under metric differential privacy: PPR incurs exponential computation cost, while Chunk PPR requires both execution and communication costs linear in the vector dimension. As a result, their guarantees are no stronger than those of non-compressed randomized response, which for a matrix with N users, n columns, and m nonzero elements, requires Ω(nN) communication—rendering it impractical for large-scale data. Our PPR-based algorithm overcomes these limitations, reducing communication to O (ϵm). Remarkably, this is even lower than the non-private baseline, which needs Ω(m log n) bits. Furthermore, as the privacy budget decreases, communication cost is further reduced, enabling stronger privacy with greater efficiency We provide theoretical guarantees showing that our method yields results equivalent to randomized response, and experimental evaluations confirm its advantages in accuracy, communication efficiency, and computational complexity. Finally, we demonstrate its applicability across domains such as social-network adjacency matrices, user-item interaction matrices in recommender systems, and single-nucleotide polymorphism (SNP) profiles in genomic data.
- Open Access
- 3 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Privacy
- Vol. 3, 13-25
Central Piecewise Mechanism for Numeric Queries
With the flourishing of data science, further enhancement of privacy-preserving theories and techniques is required. Particularly, the concept of differential privacy has garnered attention in a wide range of fields and is being actively explored. Although various $\epsilon$-differentially private mechanisms have been proposed for a numeric query, a fundamental task in data analysis, the following two issues had remained unaddressed for a long time. The first is unrealistic results owing to the unbounded range of output values, and the second is the occurrence of bias in the modified results. The first methods to address these issues, the composite differentially private mechanisms (CDPMs), were recently proposed; however, room for improvement remains. The notable issues are complicated hyper-parameters making theoretical analysis of output errors difficult, and insufficient consideration of global sensitivity for noise generation. Therefore, this study first proposes a novel concise $\epsilon$-differentially private mechanism for a numeric query, the central piecewise mechanism (CPM). The CPM indeed provides bounded and unbiased output, and the variance of the output values is also shown theoretically. By capturing the characteristics of global sensitivity in detail, the amount of noise can be significantly reduced compared with the state-of-the-art CDPM. Subsequently, we further enhance the CPM for handling multiple numeric queries while considering a situation in which each query has its own privacy level. Given the required privacy level for each query, an optimal privacy guarantee when using the CPM can be achieved in its entirety. Moreover, we propose an efficient heuristic algorithm for providing sub-optimal guarantees. This ultimately improves the output accuracy when the overall privacy budget is fixed, because more budget can be distributed to each query. Experiments demonstrate that the proposed methods outperform existing methods by using real census data as well. Overall, this study is an important step in further exploring of bounded and unbiased $\epsilon$-differentially private mechanisms that provide more accurate and reliable outputs. The codes for the experiments are available at https://github.com/ay0408/Central-PM.
- 3 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Privacy
- Vol. 3, 13-25
Open AccessCentral Piecewise Mechanism for Numeric Queries
With the flourishing of data science, further enhancement of privacy-preserving theories and techniques is required. Particularly, the concept of differential privacy has garnered attention in a wide range of fields and is being actively explored. Although various $\epsilon$-differentially private mechanisms have been proposed for a numeric query, a fundamental task in data analysis, the following two issues had remained unaddressed for a long time. The first is unrealistic results owing to the unbounded range of output values, and the second is the occurrence of bias in the modified results. The first methods to address these issues, the composite differentially private mechanisms (CDPMs), were recently proposed; however, room for improvement remains. The notable issues are complicated hyper-parameters making theoretical analysis of output errors difficult, and insufficient consideration of global sensitivity for noise generation. Therefore, this study first proposes a novel concise $\epsilon$-differentially private mechanism for a numeric query, the central piecewise mechanism (CPM). The CPM indeed provides bounded and unbiased output, and the variance of the output values is also shown theoretically. By capturing the characteristics of global sensitivity in detail, the amount of noise can be significantly reduced compared with the state-of-the-art CDPM. Subsequently, we further enhance the CPM for handling multiple numeric queries while considering a situation in which each query has its own privacy level. Given the required privacy level for each query, an optimal privacy guarantee when using the CPM can be achieved in its entirety. Moreover, we propose an efficient heuristic algorithm for providing sub-optimal guarantees. This ultimately improves the output accuracy when the overall privacy budget is fixed, because more budget can be distributed to each query. Experiments demonstrate that the proposed methods outperform existing methods by using real census data as well. Overall, this study is an important step in further exploring of bounded and unbiased $\epsilon$-differentially private mechanisms that provide more accurate and reliable outputs. The codes for the experiments are available at https://github.com/ay0408/Central-PM.
- 22 September 2025
- Published by Springer Nature
- p. 291-303
Faster Algorithm for Bounded Damerau–Levenshtein Distance
- 22 September 2025
- Published by Springer Nature
- p. 291-303
Faster Algorithm for Bounded Damerau–Levenshtein Distance
- 11 September 2025
- Published by Springer Nature
- p. 45-56
Reconfiguring Planar Perfect Matchings via Bounded Length Alternating Cycles
- 11 September 2025
- Published by Springer Nature
- p. 45-56
Reconfiguring Planar Perfect Matchings via Bounded Length Alternating Cycles
- Open Access
LLM-Guided Ansätze Design for Quantum Circuit Born Machines in Financial Generative Modeling
Quantum generative modeling using quantum circuit Born machines (QCBMs) shows promising potential for practical quantum advantage. However, discovering ansätze that are both expressive and hardware-efficient remains a key challenge, particularly on noisy intermediate-scale quantum (NISQ) devices. In this work, we introduce a prompt-based framework that leverages large language models (LLMs) to generate hardware-aware QCBM architectures. Prompts are conditioned on qubit connectivity, gate error rates, and hardware topology, while iterative feedback, including Kullback-Leibler (KL) divergence, circuit depth, and validity, is used to refine the circuits. We evaluate our method on a financial modeling task involving daily changes in Japanese government bond (JGB) interest rates. Our results show that the LLM-generated ansätze are significantly shallower and achieve superior generative performance compared to the standard baseline when executed on real IBM quantum hardware using 12 qubits. These findings demonstrate the practical utility of LLM-driven quantum architecture search and highlight a promising path toward robust, deployable generative models for near-term quantum devices.
Open AccessLLM-Guided Ansätze Design for Quantum Circuit Born Machines in Financial Generative Modeling
Quantum generative modeling using quantum circuit Born machines (QCBMs) shows promising potential for practical quantum advantage. However, discovering ansätze that are both expressive and hardware-efficient remains a key challenge, particularly on noisy intermediate-scale quantum (NISQ) devices. In this work, we introduce a prompt-based framework that leverages large language models (LLMs) to generate hardware-aware QCBM architectures. Prompts are conditioned on qubit connectivity, gate error rates, and hardware topology, while iterative feedback, including Kullback-Leibler (KL) divergence, circuit depth, and validity, is used to refine the circuits. We evaluate our method on a financial modeling task involving daily changes in Japanese government bond (JGB) interest rates. Our results show that the LLM-generated ansätze are significantly shallower and achieve superior generative performance compared to the standard baseline when executed on real IBM quantum hardware using 12 qubits. These findings demonstrate the practical utility of LLM-driven quantum architecture search and highlight a promising path toward robust, deployable generative models for near-term quantum devices.
- 11 August 2025
- Published by Springer Nature
- p. 94-103
Counting 2-Factors of 4-Regular Bipartite Graphs is $\#P$-Complete- 11 August 2025
- Published by Springer Nature
- p. 94-103
Counting 2-Factors of 4-Regular Bipartite Graphs is $\#P$-Complete- 1 August 2025
- Published by Springer Nature
- p. 122-134
Efficient and Accurate Approximation Algorithms for Protein Structure Alignment
- 1 August 2025
- Published by Springer Nature
- p. 122-134
Efficient and Accurate Approximation Algorithms for Protein Structure Alignment
- 7 July 2025
- Published by Springer Nature
- p. 63-83
Direction-Oriented Smooth Sensitivity and Its Application to Genomic Statistical Analysis
- 7 July 2025
- Published by Springer Nature
- p. 63-83
Direction-Oriented Smooth Sensitivity and Its Application to Genomic Statistical Analysis
- Open Access
Communication-Efficient Publication of Sparse Vectors under Differential Privacy
In this work, we propose a differentially private algorithm for publishing matrices aggregated from sparse vectors. These matrices include social network adjacency matrices, user-item interaction matrices in recommendation systems, and single nucleotide polymorphisms (SNPs) in DNA data. Traditionally, differential privacy in vector collection relies on randomized response, but this approach incurs high communication costs. Specifically, for a matrix with $N$ users, $n$ columns, and $m$ nonzero elements, conventional methods require $Ω(n \times N)$ communication, making them impractical for large-scale data. Our algorithm significantly reduces this cost to $O(\varepsilon m)$, where $\varepsilon$ is the privacy budget. Notably, this is even lower than the non-private case, which requires $Ω(m \log n)$ communication. Moreover, as the privacy budget decreases, communication cost further reduces, enabling better privacy with improved efficiency. We theoretically prove that our method yields results identical to those of randomized response, and experimental evaluations confirm its effectiveness in terms of accuracy, communication efficiency, and computational complexity.Open AccessCommunication-Efficient Publication of Sparse Vectors under Differential Privacy
In this work, we propose a differentially private algorithm for publishing matrices aggregated from sparse vectors. These matrices include social network adjacency matrices, user-item interaction matrices in recommendation systems, and single nucleotide polymorphisms (SNPs) in DNA data. Traditionally, differential privacy in vector collection relies on randomized response, but this approach incurs high communication costs. Specifically, for a matrix with $N$ users, $n$ columns, and $m$ nonzero elements, conventional methods require $Ω(n \times N)$ communication, making them impractical for large-scale data. Our algorithm significantly reduces this cost to $O(\varepsilon m)$, where $\varepsilon$ is the privacy budget. Notably, this is even lower than the non-private case, which requires $Ω(m \log n)$ communication. Moreover, as the privacy budget decreases, communication cost further reduces, enabling better privacy with improved efficiency. We theoretically prove that our method yields results identical to those of randomized response, and experimental evaluations confirm its effectiveness in terms of accuracy, communication efficiency, and computational complexity.