GLORIA

GEOMAR Library Ocean Research Information Access

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften ; 2021
    In:  Quantum Vol. 5 ( 2021-11-17), p. 582-
    In: Quantum, Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften, Vol. 5 ( 2021-11-17), p. 582-
    Abstract: A large body of recent work has begun to explore the potential of parametrized quantum circuits (PQCs) as machine learning models, within the framework of hybrid quantum-classical optimization. In particular, theoretical guarantees on the out-of-sample performance of such models, in terms of generalization bounds, have emerged. However, none of these generalization bounds depend explicitly on how the classical input data is encoded into the PQC. We derive generalization bounds for PQC-based models that depend explicitly on the strategy used for data-encoding. These imply bounds on the performance of trained PQC-based models on unseen data. Moreover, our results facilitate the selection of optimal data-encoding strategies via structural risk minimization, a mathematically rigorous framework for model selection. We obtain our generalization bounds by bounding the complexity of PQC-based models as measured by the Rademacher complexity and the metric entropy, two complexity measures from statistical learning theory. To achieve this, we rely on a representation of PQC-based models via trigonometric functions. Our generalization bounds emphasize the importance of well-considered data-encoding strategies for PQC-based models.
    Type of Medium: Online Resource
    ISSN: 2521-327X
    Language: English
    Publisher: Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften
    Publication Date: 2021
    detail.hit.zdb_id: 2931392-2
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften ; 2020
    In:  Quantum Vol. 4 ( 2020-08-31), p. 314-
    In: Quantum, Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften, Vol. 4 ( 2020-08-31), p. 314-
    Abstract: 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 of s t o c h a s t i c gradient 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 with k measurement outcomes results in optimization algorithms whose convergence properties can be rigorously well understood, for any value of k . 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 cases k -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.
    Type of Medium: Online Resource
    ISSN: 2521-327X
    Language: English
    Publisher: Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften
    Publication Date: 2020
    detail.hit.zdb_id: 2931392-2
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    American Physical Society (APS) ; 2023
    In:  Physical Review A Vol. 107, No. 4 ( 2023-4-13)
    In: Physical Review A, American Physical Society (APS), Vol. 107, No. 4 ( 2023-4-13)
    Type of Medium: Online Resource
    ISSN: 2469-9926 , 2469-9934
    RVK:
    Language: English
    Publisher: American Physical Society (APS)
    Publication Date: 2023
    detail.hit.zdb_id: 2844156-4
    detail.hit.zdb_id: 209769-2
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 4
    Online Resource
    Online Resource
    Springer Science and Business Media LLC ; 2022
    In:  Communications Physics Vol. 5, No. 1 ( 2022-06-16)
    In: Communications Physics, Springer Science and Business Media LLC, Vol. 5, No. 1 ( 2022-06-16)
    Type of Medium: Online Resource
    ISSN: 2399-3650
    Language: English
    Publisher: Springer Science and Business Media LLC
    Publication Date: 2022
    detail.hit.zdb_id: 2921913-9
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 5
    Online Resource
    Online Resource
    IOP Publishing ; 2019
    In:  Journal of Physics A: Mathematical and Theoretical Vol. 52, No. 42 ( 2019-10-18), p. 424003-
    In: Journal of Physics A: Mathematical and Theoretical, IOP Publishing, Vol. 52, No. 42 ( 2019-10-18), p. 424003-
    Type of Medium: Online Resource
    ISSN: 1751-8113 , 1751-8121
    Language: Unknown
    Publisher: IOP Publishing
    Publication Date: 2019
    detail.hit.zdb_id: 1363010-6
    detail.hit.zdb_id: 209217-7
    detail.hit.zdb_id: 3115688-5
    SSG: 11
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 6
    Online Resource
    Online Resource
    IOP Publishing ; 2021
    In:  Machine Learning: Science and Technology Vol. 2, No. 2 ( 2021-06-01), p. 025005-
    In: Machine Learning: Science and Technology, IOP Publishing, Vol. 2, No. 2 ( 2021-06-01), p. 025005-
    Abstract: Topological error correcting codes, and particularly the surface code, currently provide the most feasible road-map towards large-scale fault-tolerant quantum computation. As such, obtaining fast and flexible decoding algorithms for these codes, within the experimentally realistic and challenging context of faulty syndrome measurements, without requiring any final read-out of the physical qubits, is of critical importance. In this work, we show that the problem of decoding such codes can be naturally reformulated as a process of repeated interactions between a decoding agent and a code environment, to which the machinery of reinforcement learning can be applied to obtain decoding agents. While in principle this framework can be instantiated with environments modelling circuit level noise, we take a first step towards this goal by using deepQ learning to obtain decoding agents for a variety of simplified phenomenological noise models, which yield faulty syndrome measurements without including the propagation of errors which arise in full circuit level noise models.
    Type of Medium: Online Resource
    ISSN: 2632-2153
    Language: Unknown
    Publisher: IOP Publishing
    Publication Date: 2021
    detail.hit.zdb_id: 3017004-7
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 7
    Online Resource
    Online Resource
    Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften ; 2021
    In:  Quantum Vol. 5 ( 2021-03-23), p. 417-
    In: Quantum, Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften, Vol. 5 ( 2021-03-23), p. 417-
    Abstract: Here we study the comparative power of classical and quantum learners for generative modelling within the Probably Approximately Correct (PAC) framework. More specifically we consider the following task: Given samples from some unknown discrete probability distribution, output with high probability an efficient algorithm for generating new samples from a good approximation of the original distribution. Our primary result is the explicit construction of a class of discrete probability distributions which, under the decisional Diffie-Hellman assumption, is provably not efficiently PAC learnable by a classical generative modelling algorithm, but for which we construct an efficient quantum learner. This class of distributions therefore provides a concrete example of a generative modelling problem for which quantum learners exhibit a provable advantage over classical learning algorithms. In addition, we discuss techniques for proving classical generative modelling hardness results, as well as the relationship between the PAC learnability of Boolean functions and the PAC learnability of discrete probability distributions.
    Type of Medium: Online Resource
    ISSN: 2521-327X
    Language: English
    Publisher: Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften
    Publication Date: 2021
    detail.hit.zdb_id: 2931392-2
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...