Training-efficient density quantum machine learning
<|reference_start|>Training-efficient density quantum machine learning: Quantum machine learning requires powerful, flexible and efficiently trainable models to be successful in solving challenging problems. In this work, we present density quantum neural networks, a learning model incorporating randomisation over a set of trainable unitaries. These models generalise quantum neural networks using parameterised quantum circuits, and allow a trade-off between expressibility and efficient trainability, particularly on quantum hardware. We demonstrate the flexibility of the formalism by applying it to two recently proposed model families. The first are commuting-block quantum neural networks (QNNs) which are efficiently trainable but may be limited in expressibility. The second are orthogonal (Hamming-weight preserving) quantum neural networks which provide well-defined and interpretable transformations on data but are challenging to train at scale on quantum devices. Density commuting QNNs improve capacity with minimal gradient complexity overhead, and density orthogonal neural networks admit a quadratic-to-constant gradient query advantage with minimal to no performance loss. We conduct numerical experiments on synthetic translationally invariant data and MNIST image data with hyperparameter optimisation to support our findings. Finally, we discuss the connection to post-variational quantum neural networks, measurement-based quantum machine learning and the dropout mechanism.<|reference_end|>
@article{coyle2024training-efficient,
    title={Training-efficient density quantum machine learning},
    author={Brian Coyle, El Amine Cherrat, Nishant Jain, Natansh Mathur, Snehal
  Raj, Skander Kazdaghli, and Iordanis Kerenidis},
    journal={arXiv preprint arXiv:2405.20237},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.20237},
    primaryClass={quant-ph cs.AI cs.LG}
}