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

Lecture notes in computer science

An Ising Framework for Constrained Clustering on Special Purpose Hardware

Eldan Cohen, Arik Senderovich, J. Christopher Beck

Published Jan 1, 2020• 17 citations
Publisher
DOI
10.1007/978-3-030-58942-4_9

Related papers

Cluster algorithm special purpose computer for the three-dimensional Ising model

A. L. Talapov, Щур Лев Николаевич, Henk W. J. Blöte

•Jul 1, 1995•1 citation

Special-Purpose Computers for the Random Ising Model

A. L. Talapov, V. B. Andreǐchenko, Виктор Степанович Доценко +1 more

Springer proceedings in physics•Jan 1, 1993•2 citations

Cluster-based Index Tracking Via QUBO and Digital Annealing

Seo Woo Hong

The cardinality constrained index-tracking problem seeks to find a combination of financial assets to replicate the return of a broad market index while using only a small subset of the asset universe. However, finding this combination of assets is NP-hard. In this thesis, we show the computational efficacy of solving a quadratic unconstrained binary optimization (QUBO) problem using purpose-built hardware Digital Annealer. We express an intra-cluster distance minimization problem as a QUBO problem and examine the computational performance between Digital Annealer and a commercial solver Gurobi running on conventional hardware. Moreover, we develop a new framework to solve the cardinality constrained index-tracking problem using the quadratic k-medoids clustering method on a market graph. To circumvent the nature of NP-hardness, we use the penalty method to formulate the problem as a QUBO problem, allowing us to utilize purpose-built hardware to solve the problem.

•Mar 1, 2021•0 citations

Framework and properties of cluster algorithms

Werner Kerler A

Nuclear Physics B - Proceedings Supplements•Mar 1, 1993•2 citations

CLUSTER ALGORITHM SPECIAL PURPOSE PROCESSOR

A. L. Talapov, Щур Лев Николаевич, V. B. Andreǐchenko +1 more

We describe a Special Purpose Processor, realizing the Wolff algorithm in hardware, which is fast enough to study the critical behaviour of 2D Ising-like systems containing more than one million spins. The processor has been checked to produce correct results for a pure Ising model and for Ising model with random bonds. Its data also agree with the Nishimori exact results for spin glass. Only minor changes of the SPP design are necessary to increase the dimensionality and to take into account more complex systems such as Potts models.

Modern Physics Letters B•Aug 10, 1992•7 citations

A Quantum Annealing-Based Approach to Extreme Clustering

Tim Jaschek, Marko Bucyk, Jaspreet S. Oberoi

arXiv:1903.08256•Advances in intelligent systems and computing•Jan 1, 2020•5 citations
The cardinality constrained index-tracking problem seeks to find a combination of financial assets to replicate the return of a broad market index while using only a small subset of the asset universe. However, finding this combination of assets is NP-hard. In this thesis, we show the computational efficacy of solving a quadratic unconstrained binary optimization (QUBO) problem using purpose-built hardware Digital Annealer. We express an intra-cluster distance minimization problem as a QUBO problem and examine the computational performance between Digital Annealer and a commercial solver Gurobi running on conventional hardware. Moreover, we develop a new framework to solve the cardinality constrained index-tracking problem using the quadratic k-medoids clustering method on a market graph. To circumvent the nature of NP-hardness, we use the penalty method to formulate the problem as a QUBO problem, allowing us to utilize purpose-built hardware to solve the problem.
We describe a Special Purpose Processor, realizing the Wolff algorithm in hardware, which is fast enough to study the critical behaviour of 2D Ising-like systems containing more than one million spins. The processor has been checked to produce correct results for a pure Ising model and for Ising model with random bonds. Its data also agree with the Nishimori exact results for spin glass. Only minor changes of the SPP design are necessary to increase the dimensionality and to take into account more complex systems such as Potts models.