---
res:
  bibo_abstract:
  - "This Ph.D. thesis presents a detailed investigation into Variational Quantum
    Algorithms\r\n(VQAs), a promising class of quantum algorithms that are well suited
    for near-term quantum\r\ncomputation due to their moderate hardware requirements
    and resilience to noise. Our\r\nprimary focus lies on two particular types of
    VQAs: the Quantum Approximate Optimization\r\nAlgorithm (QAOA), used for solving
    binary optimization problems, and the Variational Quantum\r\nEigensolver (VQE),
    utilized for finding ground states of quantum many-body systems.\r\nIn the first
    part of the thesis, we examine the issue of effective parameter initialization
    for\r\nthe QAOA. The work demonstrates that random initialization of the QAOA
    often leads to\r\nconvergence in local minima with sub-optimal performance. To
    mitigate this issue, we propose\r\nan initialization of QAOA parameters based
    on the Trotterized Quantum Annealing (TQA).\r\nWe show that TQA initialization
    leads to the same performance as the best of an exponentially\r\nscaling number
    of random initializations.\r\nThe second study introduces Transition States (TS),
    stationary points with a single direction\r\nof descent, as a tool for systematically
    exploring the QAOA optimization landscape. This\r\nleads us to propose a novel
    greedy parameter initialization strategy that guarantees for the\r\nenergy to
    decrease with increasing number of circuit layers.\r\nIn the third section, we
    extend the QAOA to qudit systems, which are higher-dimensional\r\ngeneralizations
    of qubits. This chapter provides theoretical insights and practical strategies
    for\r\nleveraging the increased computational power of qudits in the context of
    quantum optimization\r\nalgorithms and suggests a quantum circuit for implementing
    the algorithm on an ion trap\r\nquantum computer.\r\nFinally, we propose an algorithm
    to avoid “barren plateaus”, regions in parameter space with\r\nvanishing gradients
    that obstruct efficient parameter optimization. This novel approach relies\r\non
    defining a notion of weak barren plateaus based on the entropies of local reduced
    density\r\nmatrices and showcases how these can be efficiently quantified using
    shadow tomography.\r\nTo illustrate the approach we employ the strategy in the
    VQE and show that it allows to\r\nsuccessfully avoid barren plateaus in the initialization
    and throughout the optimization.\r\nTaken together, this thesis greatly enhances
    our understanding of parameter initialization and\r\noptimization in VQAs, expands
    the scope of QAOA to higher-dimensional quantum systems,\r\nand presents a method
    to address the challenge of barren plateaus using the VQE. These\r\ninsights are
    instrumental in advancing the field of near-term quantum computation.@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Stefan
      foaf_name: Sack, Stefan
      foaf_surname: Sack
      foaf_workInfoHomepage: http://www.librecat.org/personId=dd622248-f6e0-11ea-865d-ce382a1c81a5
    orcid: 0000-0001-5400-8508
  bibo_doi: 10.15479/at:ista:14622
  dct_date: 2023^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/2663-337X
  dct_language: eng
  dct_publisher: Institute of Science and Technology Austria@
  dct_title: 'Improving variational quantum algorithms: Innovative initialization
    techniques and extensions to qudit systems@'
...
