Pith. sign in

REVIEW 2 cited by

Completely Quantum Neural Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2202.11727 v1 pith:SFHEJ5BM submitted 2022-02-23 quant-ph cs.LGhep-phhep-th

classification quant-phcs.LGhep-phhep-th
keywords networkquantumtrainingannealerfunctionneuralbinaryencoding
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Artificial neural networks are at the heart of modern deep learning algorithms. We describe how to embed and train a general neural network in a quantum annealer without introducing any classical element in training. To implement the network on a state-of-the-art quantum annealer, we develop three crucial ingredients: binary encoding the free parameters of the network, polynomial approximation of the activation function, and reduction of binary higher-order polynomials into quadratic ones. Together, these ideas allow encoding the loss function as an Ising model Hamiltonian. The quantum annealer then trains the network by finding the ground state. We implement this for an elementary network and illustrate the advantages of quantum training: its consistency in finding the global minimum of the loss function and the fact that the network training converges in a single annealing step, which leads to short training times while maintaining a high classification performance. Our approach opens a novel avenue for the quantum training of general machine learning models.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Optimization by VarQITE on Adaptive Variational Quantum Kolmogorov-Arnold Network

    quant-ph 2025-06 conditional novelty 5.0 of 10

    Using variational quantum imaginary time evolution as a training rule can fit toy functions with a KAN-style quantum circuit, but classification performance remains worse than standard approaches.

  2. The effect of Quantum Time Crystal Computing to Quantum Machine Learning methods

    quant-ph 2025-06 reject novelty 4.0 of 10

    Adding controlled noise from a simulated time crystal improved fitting accuracy for two quantum neural network variants while degrading quantum reservoir computing, in small numerical tests.

Pith tools