pith. sign in

arxiv: 1712.05771 · v1 · pith:IBOJMW3Knew · submitted 2017-12-15 · 🪐 quant-ph

Unsupervised Machine Learning on a Hybrid Quantum Computer

classification 🪐 quant-ph
keywords learningquantumclassicalmachineoptimizationalgorithmavailablechallenge
0
0 comments X p. Extension
pith:IBOJMW3K Add to your LaTeX paper What is a Pith Number?
\usepackage{pith}
\pithnumber{IBOJMW3K}

Prints a linked pith:IBOJMW3K badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original abstract

Machine learning techniques have led to broad adoption of a statistical model of computing. The statistical distributions natively available on quantum processors are a superset of those available classically. Harnessing this attribute has the potential to accelerate or otherwise improve machine learning relative to purely classical performance. A key challenge toward that goal is learning to hybridize classical computing resources and traditional learning techniques with the emerging capabilities of general purpose quantum processors. Here, we demonstrate such hybridization by training a 19-qubit gate model processor to solve a clustering problem, a foundational challenge in unsupervised learning. We use the quantum approximate optimization algorithm in conjunction with a gradient-free Bayesian optimization to train the quantum machine. This quantum/classical hybrid algorithm shows robustness to realistic noise, and we find evidence that classical optimization can be used to train around both coherent and incoherent imperfections.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Adversarial Effects on Expressibility and Trainability in Distributed Variational Quantum Algorithms

    quant-ph 2026-05 unverdicted novelty 7.0

    Adversaries perturbing shared entanglement in distributed VQAs can manipulate a new Kraus expressibility metric to keep gradients large but steer training to incorrect solutions.

  2. Quantum Spectral Clustering: Comparing Parameterized and Neuromorphic Quantum Kernels

    quant-ph 2025-07 unverdicted novelty 5.0

    Quantum neuromorphic kernels outperform parameterized quantum kernels on low-dimensional datasets like Iris but underperform on high-dimensional SDSS data in spectral clustering tasks.