Non-Unitary Quantum Machine Learning
- URL: http://arxiv.org/abs/2405.17388v1
- Date: Mon, 27 May 2024 17:42:02 GMT
- Title: Non-Unitary Quantum Machine Learning
- Authors: Jamie Heredge, Maxwell West, Lloyd Hollenberg, Martin Sevior,
- Abstract summary: We introduce several novel probabilistic quantum algorithms that overcome the normal unitary restrictions in quantum machine learning.
Among our contributions are quantum native implementations of Residual Networks (ResNet); demonstrating a path to avoiding barren plateaus.
We also show how this framework can be used to parameterise and control the amount of symmetry in an encoding.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We introduce several novel probabilistic quantum algorithms that overcome the normal unitary restrictions in quantum machine learning by leveraging the Linear Combination of Unitaries (LCU) method. Among our contributions are quantum native implementations of Residual Networks (ResNet); demonstrating a path to avoiding barren plateaus while maintaining the complexity of models that are hard to simulate classically. Furthermore, by generalising to allow control of the strength of residual connections, we show that the lower bound of the LCU success probability can be set to any arbitrary desired value. We also implement a quantum analogue of average pooling layers from convolutional networks. Our empirical analysis demonstrates that the LCU success probability remains stable for the MNIST database, unlocking a potential quadratic advantage in terms of image size compared to classical techniques. Finally, we propose a general framework for irreducible subspace projections for quantum encoded data. Using this, we demonstrate a novel rotationally invariant encoding for point cloud data via Schur-Weyl duality. We also show how this framework can be used to parameterise and control the amount of symmetry in an encoding; demonstrating improved classification performance for partially permutation invariant encoded point cloud data when compared to non-invariant or fully permutation invariant encodings. These new general algorithmic frameworks are all constructed under the same LCU method, suggesting that even more novel algorithms could be achieved by utilising the LCU technique.
Related papers
- Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.
We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.
We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
arXiv Detail & Related papers (2024-05-03T17:32:55Z) - Determining the ability for universal quantum computing: Testing
controllability via dimensional expressivity [39.58317527488534]
Controllability tests can be used in the design of quantum devices to reduce the number of external controls.
We devise a hybrid quantum-classical algorithm based on a parametrized quantum circuit.
arXiv Detail & Related papers (2023-08-01T15:33:41Z) - Robust Dequantization of the Quantum Singular value Transformation and
Quantum Machine Learning Algorithms [0.0]
We show how many techniques from randomized linear algebra can be adapted to work under this weaker assumption.
We also apply these results to obtain a robust dequantization of many quantum machine learning algorithms.
arXiv Detail & Related papers (2023-04-11T02:09:13Z) - Riemannian quantum circuit optimization for Hamiltonian simulation [2.1227079314039057]
Hamiltonian simulation is a natural application of quantum computing.
For translation invariant systems, the gates in such circuit topologies can be further optimized on classical computers.
For the Ising and Heisenberg models on a one-dimensional lattice, we achieve orders of magnitude accuracy improvements.
arXiv Detail & Related papers (2022-12-15T00:00:17Z) - Automatic and effective discovery of quantum kernels [43.702574335089736]
Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.
We present a different approach, which employs optimization techniques, similar to those used in neural architecture search and AutoML.
The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
arXiv Detail & Related papers (2022-09-22T16:42:14Z) - Quantum Sparse Coding [5.130440339897477]
We develop a quantum-inspired algorithm for sparse coding.
The emergence of quantum computers and Ising machines can potentially lead to more accurate estimations.
We conduct numerical experiments with simulated data on Lightr's quantum-inspired digital platform.
arXiv Detail & Related papers (2022-09-08T13:00:30Z) - Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs)
We propose a new protocol for approximating TN states using realistic quantum circuits.
Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
arXiv Detail & Related papers (2022-09-01T17:08:41Z) - Variational Quantum and Quantum-Inspired Clustering [0.0]
We present a quantum algorithm for clustering data based on a variational quantum circuit.
The algorithm allows to classify data into many clusters, and can easily be implemented in few-qubit Noisy Intermediate-Scale Quantum (NISQ) devices.
arXiv Detail & Related papers (2022-06-20T17:02:19Z) - A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
We propose a hybrid quantum-classical algorithm for robust fitting.
Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs.
We present results obtained using an actual quantum computer.
arXiv Detail & Related papers (2022-01-25T05:59:24Z) - Nonuniform-to-Uniform Quantization: Towards Accurate Quantization via
Generalized Straight-Through Estimation [48.838691414561694]
Nonuniform-to-Uniform Quantization (N2UQ) is a method that can maintain the strong representation ability of nonuniform methods while being hardware-friendly and efficient.
N2UQ outperforms state-of-the-art nonuniform quantization methods by 0.71.8% on ImageNet.
arXiv Detail & Related papers (2021-11-29T18:59:55Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.