Non-Unitary Quantum Machine Learning
Jamie Heredge, Maxwell West, Lloyd Hollenberg, Martin Sevior

TL;DR
This paper presents novel probabilistic quantum algorithms using the Linear Combination of Unitaries (LCU) method to enhance quantum machine learning, including quantum ResNets, pooling, and subspace projections, improving efficiency and invariance handling.
Contribution
It introduces new quantum algorithms that overcome unitary restrictions, including quantum ResNets, pooling, and subspace projections, expanding quantum ML capabilities with the LCU method.
Findings
Quantum ResNets prevent barren plateaus.
Stable average pooling success probability on MNIST.
Enhanced classification with permutation and rotational invariance.
Abstract
We introduce several probabilistic quantum algorithms that overcome the normal unitary restrictions in quantum machine learning by leveraging the Linear Combination of Unitaries (LCU) method. Among our investigations are quantum native implementations of Residual Networks (ResNet), where we show that residual connections between layers of a variational ansatz can prevent barren plateaus in models which would otherwise contain them. Secondly, we implement a quantum analogue of average pooling layers from convolutional networks using single qubit controlled basic arithmetic operators and show that the LCU success probability remains stable for the MNIST database. This method can be further generalised to convolutional filters, while using exponentially fewer controlled unitaries than previous approaches. Finally, we propose a general framework for applying a linear combination of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture
