Maria Schuld

Maria Schuld

Auto-generated profile, based on publicly available information

Maria Schuld

University of KwaZulu-Natal

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2019 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
MSMaria Schuld
Maria Schuld
NKNathan Killoran
Nathan Killoran
A basic idea of quantum computing is surprisingly similar to that of kernel methods in machine learning, namely, to efficiently perform computations in an intractably large Hilbert space. In this Letter we explore some theoretical foundations of this link and show how it opens up a new avenue for the design of quantum machine learning algorithms. We interpret the process of encoding inputs in a quantum state as a nonlinear feature map that maps data to quantum Hilbert space. A quantum computer can now analyze the input data in this feature space. Based on this link, we discuss two approaches for building a quantum model for classification. In the first approach, the quantum device estimates inner products of quantum states to compute a classically intractable kernel. The kernel can be fed into any classical kernel method such as a support vector machine. In the second approach, we use a variational quantum circuit as a linear model that classifies data explicitly in Hilbert space. We illustrate these ideas with a feature map based on squeezing in a continuous-variable system, and visualize the working principle with two-dimensional minibenchmark datasets.

21 March 2019 in Physical Review A
Verified
Journal Article
Closed access
PDF file
MSMaria Schuld
Maria Schuld
VBVille Bergholm
Ville Bergholm
CGChristian Gogolin
Christian Gogolin
JIJosh Izaac
Josh Izaac
NKNathan Killoran
Nathan Killoran
An important application for near-term quantum computing lies in optimization tasks, with applications ranging from quantum chemistry and drug discovery to machine learning. In many settings, most prominently in so-called parametrized or variational algorithms, the objective function is a result of hybrid quantum-classical processing. To optimize the objective, it is useful to have access to exact gradients of quantum circuits with respect to gate parameters. This paper shows how gradients of expectation values of quantum measurements can be estimated using the same, or almost the same, architecture that executes the original circuit. It generalizes previous results for qubit-based platforms, and proposes recipes for the computation of gradients of continuous-variable circuits. Interestingly, in many important instances it is sufficient to run the original quantum circuit twice while shifting a single gate parameter to obtain the corresponding component of the gradient. More general cases can be solved by conditioning a single gate on an ancilla.

6 March 2020 in Physical Review A
Verified
Journal Article
Closed access
PDF file
MSMaria Schuld
Maria Schuld
ABAlex Bocharov
Alex Bocharov
KSKrysta M. Svore
Krysta M. Svore
NWNathan Wiebe
Nathan Wiebe
Variational quantum circuits are becoming tools of choice in quantum optimization and machine learning. In this paper we investigate a class of variational circuits for the purposes of supervised machine learning. We propose a circuit architecture suitable for predicting class labels of quantumly encoded data via measurements of certain observables. We observe that the required depth of a trainable classification circuit is related to the number of representative principal components of the data distribution. Quantum circuit architectures used in our design are validated by numerical simulation, which shows significant model size reduction compared to classical predictive models. Circuit-based models demonstrate good resilience to noise, which makes then robust and error tolerant.

15 October 2014 in Contemporary Physics
Verified
Journal Article
Closed access
MSMaria Schuld
Maria Schuld
ISIlya Sinayskiy
Ilya Sinayskiy
FPFrancesco Petruccione
Francesco Petruccione
Machine learning algorithms learn a desired input-output relation from examples in order to interpret new inputs. This is important for tasks such as image and speech recognition or strategy optimisation, with growing applications in the IT industry. In the last couple of years, researchers investigated if quantum computing can help to improve classical machine learning algorithms. Ideas range from running computationally costly algorithms or their subroutines efficiently on a quantum computer to the translation of stochastic methods into the language of quantum theory. This contribution gives a systematic overview of the emerging field of quantum machine learning. It presents the approaches as well as technical details in an accessible way, and discusses the potential of a future theory of quantum learning.

26 August 2014 in Quantum Information Processing
Verified
Journal Article
Closed access
PDF file
MSMaria Schuld
Maria Schuld
ISIlya Sinayskiy
Ilya Sinayskiy
FPFrancesco Petruccione
Francesco Petruccione

31 August 2020 in Quantum
Verified
Journal Article
Open access
PDF file
RSRyan Sweke
Ryan Sweke
FWFrederik Wilde
Frederik Wilde
JMJohannes Jakob Meyer
Johannes Jakob Meyer
MSMaria Schuld
Maria Schuld
PFPaul K. Faehrmann
Paul K. Faehrmann
JEJens Eisert
Jens Eisert
Within the context of hybrid quantum-classical optimization, gradient descent based optimizers typically require the evaluation of expectation values with respect to the outcome of parameterized quantum circuits. In this work, we explore the consequences of the prior observation that estimation of these quantities on quantum hardware results in a form ofstochasticgradient descent optimization. We formalize this notion, which allows us to show that in many relevant cases, including VQE, QAOA and certain quantum classifiers, estimating expectation values withkmeasurement outcomes results in optimization algorithms whose convergence properties can be rigorously well understood, for any value ofk. In fact, even using single measurement outcomes for the estimation of expectation values is sufficient. Moreover, in many settings the required gradients can be expressed as linear combinations of expectation values -- originating, e.g., from a sum over local terms of a Hamiltonian, a parameter shift rule, or a sum over data-set instances -- and we show that in these casesk-shot expectation value estimation can be combined with sampling over terms of the linear combination, to obtain ``doubly stochastic'' gradient descent optimizers. For all algorithms we prove convergence guarantees, providing a framework for the derivation of rigorous optimization results in the context of near-term quantum devices. Additionally, we explore numerically these methods on benchmark VQE, QAOA and quantum-enhanced machine learning tasks and show that treating the stochastic settings as hyper-parameters allows for state-of-the-art results with significantly fewer circuit executions and measurements.