Quantum Extremal Learning

Abstract

We propose a quantum algorithm for `extremal learning', which is the process of finding the input to a hidden function that extremizes the function output, without having direct access to the hidden function, given only partial input-output (training) data. The algorithm, called quantum extremal learning (QEL), consists of a parametric quantum circuit that is variationally trained to model data input-output relationships and where a trainable quantum feature map, that encodes the input data, is analytically differentiated in order to find the coordinate that extremizes the model. This enables the combination of established quantum machine learning modelling with established quantum optimization, on a single circuit/quantum computer. We have tested our algorithm on a range of classical datasets based on either discrete or continuous input variables, both of which are compatible with the algorithm. In case of discrete variables, we test our algorithm on synthetic problems formulated based on Max-Cut problem generators and also considering higher order correlations in the input-output relationships. In case of the continuous variables, we test our algorithm on synthetic datasets in 1D and simple ordinary differential functions. We find that the algorithm is able to successfully find the extremal value of such problems, even when the training dataset is sparse or a small fraction of the input configuration space. We additionally show how the algorithm can be used for much more general cases of higher dimensionality, complex differential equations, and with full flexibility in the choice of both modeling and optimization ansatz. We envision that due to its general framework and simple construction, the QEL algorithm will be able to solve a wide variety of applications in different fields, opening up areas of further research.

arXiv comment21 pages, 14 figures, initial version

References in corpus (38)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Supervised learning with quantum enhanced feature spaces
• DeepXDE: A deep learning library for solving differential equations
• Barren plateaus in quantum neural network training landscapes
• Quantum machine learning in feature Hilbert spaces
• Quantum Circuit Learning
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Evaluating analytic gradients on quantum hardware
• The power of quantum neural networks
• Noise-Induced Barren Plateaus in Variational Quantum Algorithms
• Simulating Hamiltonian dynamics with a truncated Taylor series
• The effect of data encoding on the expressive power of variational quantum machine learning models
• PPINN: Parareal Physics-Informed Neural Network for time-dependent PDEs
• Data re-uploading for a universal quantum classifier
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Toward the first quantum simulation with quantum speedup
• Adversarial Uncertainty Quantification in Physics-Informed Neural Networks
• An initialization strategy for addressing barren plateaus in parametrized quantum circuits
• Absence of Barren Plateaus in Quantum Convolutional Neural Networks
• Layerwise learning for quantum neural networks
• Inferring solutions of differential equations using noisy multi-fidelity data
• Effect of barren plateaus on gradient-free optimization
• Solving nonlinear differential equations with differentiable quantum circuits
• Expanding the horizon of automated metamaterials discovery via quantum annealing
• Resource-Efficient Quantum Algorithm for Protein Folding
• Trainability of Dissipative Perceptron-Based Quantum Neural Networks
• Large gradients via correlation in random parameterized quantum circuits
• Entanglement Devised Barren Plateau Mitigation
• Barren plateaus preclude learning scramblers
• Higher Order Derivatives of Quantum Neural Networks with Barren Plateaus
• Quantum Neural Network States: A Brief Review of Methods and Applications
• Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization
• Universal Approximation Property of Quantum Machine Learning Models in Quantum-Enhanced Feature Spaces
• Analyzing the barren plateau phenomenon in training quantum neural networks with the ZX-calculus
• How many qubits are needed for quantum computational supremacy?
• Quantum evolution kernel : Machine learning on graphs with programmable arrays of qubits

Cited by in corpus (1)

• On fundamental aspects of quantum extreme learning machines