paper-with-me

Papers

Adiabatic Quantum Computing for Binary Clustering

2017-06-17 · Christian Bauckhage, Eduardo Brito, Kostadin Cvejoski, Cesar Ojeda, Rafet Sifa, Stefan Wrobel

Quantum computing for machine learning attracts increasing attention and recent technological developments suggest that especially adiabatic quantum computing may soon be of practical interest. In this paper, we therefore consider this paradigm and discuss how to adopt it to the problem of binary clustering. Numerical simulations demonstrate the feasibility of our approach and illustrate how systems of qubits adiabatically evolve towards a solution.

📄 PDF Abstract BibTeX arXiv:1706.05528

Code (0)

등록된 구현이 없습니다.

Tasks

BIG-bench Machine LearningClustering

Similar Papers 제목 키워드 기반

QUBO Formulations for Training Machine Learning Models

2020-08-05 · Prasanna Date, Davis Arthur, Lauren Pusey-Nazzaro

Training machine learning models on classical computers is usually a time and compute intensive process. With Moore's law coming to an end and ever increasing demand for large-scale data analysis using machine learning, …

BIG-bench Machine LearningClusteringregression

Quantum Vision Clustering

2023-09-18 · Xuan Bac Nguyen, Hugh Churchill, Khoa Luu, Samee U. Khan

Unsupervised visual clustering has garnered significant attention in recent times, aiming to characterize distributions of unlabeled visual images through clustering based on a parameterized appearance approach. Alternat…

Clustering

Training Neural Networks with Universal Adiabatic Quantum Computing

2023-08-24 · Steve Abel, Juan Carlos Criado, Michael Spannowsky

The training of neural networks (NNs) is a computationally intensive task requiring significant time and resources. This paper presents a novel approach to NN training using Adiabatic Quantum Computing (AQC), a paradigm …

Adiabatic Quantum Linear Regression

2020-08-05 · Prasanna Date, Thomas Potok

A major challenge in machine learning is the computational expense of training these models. Model training can be viewed as a form of optimization used to fit a machine learning model to a set of data, which can take up…

BIG-bench Machine Learningregression

Adiabatic Quantum Graph Matching with Permutation Matrix Constraints

2021-07-08 · Marcel Seelbach Benkner, Vladislav Golyanik, Christian Theobalt, Michael Moeller

Matching problems on 3D shapes and images are challenging as they are frequently formulated as combinatorial quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard. In this work, we a…

Graph Matchingvalid