Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Nuclear Physics B - Proceedings Supplements

Framework and properties of cluster algorithms

Werner Kerler A

Published Mar 1, 1993• 2 citations
Publisher
DOI
10.1016/0920-5632(93)90211-n

Related papers

Studying few cluster resonances with quantum neural network driven iterative Harrow-Hassidim-Lloyd algorithm

Hantao Zhang, Bai, Dong, Zhongzhou Ren

By using the quantum computing the properties of hypernuclei ${}^5_Λ$He, ${}^{\ 6}_{ΛΛ}$He and ${}^9_Λ$Be can be investigated within microscopic cluster model. Our approach combines quantum neural network (QNN) with iterative Harrow-Hassidim-Lloyd (IHHL) algorithm (abbreviated as QNN-IHHL) to solve the quantum many-body problem. To efficiently describe resonance phenomena, we employ complex scaling and eigenvector continuation techniques, providing a robust framework for identifying few-cluster resonance parameters within quantum computing. To validate our quantum algorithm, the resonant $4^{+}$ state of ${}^9_Λ$Be is chosen as a core example. With QNN-IHHL algorithm we realize a fully quantum workflow, which provides a novel framework and some ground work for exploring resonance properties in complex nuclear many-body systems.

arXiv:2507.00074•Jun 29, 2025•1 citation

Cluster algorithms

Ferenc Niedermayer A

arXiv:hep-lat/9704009•Springer eBooks•Apr 6, 2008•15 citations

Efficient cluster algorithm for models

Bernard B. Beard, Michele Pepe A, S. Riederer +1 more

arXiv:hep-lat/0602018•Computer Physics Communications•Sep 27, 2006•9 citations

Quantum-Inspired Clustering Algorithms for High-Dimensional Data

Jincheng Zhang

High-dimensional data presents significant challenges to traditional clustering algorithms due to the "curse of dimensionality," leading to sparsity issues, increased computational complexity, and reduced cluster quality. This research investigates the application of quantum-inspired algorithms to enhance clustering performance in these scenarios. We propose a novel clustering framework leveraging concepts from quantum annealing and quantum walks to efficiently explore the feature space and identify clusters. The core idea is to mimic the probabilistic and superposition properties of quantum systems within the clustering process, allowing for more nuanced exploration of potential cluster configurations. The algorithms are designed to mitigate the effects of dimensionality by introducing stochastic search strategies and exploiting correlations between features. We evaluate the effectiveness of these algorithms on benchmark datasets, demonstrating improved clustering accuracy and reduced computational cost compared to established classical methods. The research highlights the potential of quantum-inspired approaches as a viable solution for high-dimensional clustering problems.

•Sep 7, 2026•0 citations

Experimental realization of the Deutsch-Jozsa algorithm with a six-qubit cluster state

Giuseppe Vallone, Gaia Donati, Natalia Bruno +2 more

We describe an experimental realization of the Deutsch-Jozsa quantum algorithm to evaluate the properties of a two-bit Boolean function in the framework of one-way quantum computation. For this purpose, a two-photon six-qubit cluster state was engineered. Its peculiar topological structure is the basis of the original measurement pattern allowing the algorithm realization. The good agreement of the experimental results with the theoretical predictions, obtained at $~1$ kHz success rate, demonstrates the correct implementation of the algorithm.

arXiv:1003.4607•Physical Review A•May 13, 2010•28 citations

Applications of the Probability-Changing Cluster Algorithm and Related Problems

Yutaka Okabe, Yusuke Tomita, Chiaki Yamaguchi

Springer proceedings in physics•Jan 1, 2002•0 citations
By using the quantum computing the properties of hypernuclei Λ5{}^5_ΛΛ5​He, ΛΛ 6{}^{\ 6}_{ΛΛ}ΛΛ 6​He and Λ9{}^9_ΛΛ9​Be can be investigated within microscopic cluster model. Our approach combines quantum neural network (QNN) with iterative Harrow-Hassidim-Lloyd (IHHL) algorithm (abbreviated as QNN-IHHL) to solve the quantum many-body problem. To efficiently describe resonance phenomena, we employ complex scaling and eigenvector continuation techniques, providing a robust framework for identifying few-cluster resonance parameters within quantum computing. To validate our quantum algorithm, the resonant 4+4^{+}4+ state of Λ9{}^9_ΛΛ9​Be is chosen as a core example. With QNN-IHHL algorithm we realize a fully quantum workflow, which provides a novel framework and some ground work for exploring resonance properties in complex nuclear many-body systems.
High-dimensional data presents significant challenges to traditional clustering algorithms due to the "curse of dimensionality," leading to sparsity issues, increased computational complexity, and reduced cluster quality. This research investigates the application of quantum-inspired algorithms to enhance clustering performance in these scenarios. We propose a novel clustering framework leveraging concepts from quantum annealing and quantum walks to efficiently explore the feature space and identify clusters. The core idea is to mimic the probabilistic and superposition properties of quantum systems within the clustering process, allowing for more nuanced exploration of potential cluster configurations. The algorithms are designed to mitigate the effects of dimensionality by introducing stochastic search strategies and exploiting correlations between features. We evaluate the effectiveness of these algorithms on benchmark datasets, demonstrating improved clustering accuracy and reduced computational cost compared to established classical methods. The research highlights the potential of quantum-inspired approaches as a viable solution for high-dimensional clustering problems.
We describe an experimental realization of the Deutsch-Jozsa quantum algorithm to evaluate the properties of a two-bit Boolean function in the framework of one-way quantum computation. For this purpose, a two-photon six-qubit cluster state was engineered. Its peculiar topological structure is the basis of the original measurement pattern allowing the algorithm realization. The good agreement of the experimental results with the theoretical predictions, obtained at  1~1 1 kHz success rate, demonstrates the correct implementation of the algorithm.