Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 8 of 8 for “"adiabatic quantum computation"”.

  1. Adiabatic quantum computation: Noise in the adiabatic theorem and using the Jordan-Wigner transform to find effective Hamiltonians

    This thesis explores two mathematical aspects of adiabatic quantum computation. Adiabatic quantum computation depends on the adiabatic theorem of quantum mechanics, and (a) we provide a rigorous formulation of the adiabatic theorem with explicit definitions of constants, and (b) we bound error in …

    maryland Repository record for Adiabatic quantum computation: Noise in the adiabatic theorem and using the Jordan-Wigner transform to find effective Hamiltonians (opens in a new tab)

  2. Solving Constraint Satisfaction Problems with Matrix Product States

    … an efficient method of modeling some many-body quantum spin systems. Since spin system Hamiltonians can be considered constraint satisfaction problems (CSPs), it follows that MPS should provide a versatile framework for studying a variety of general CSPs. In this thesis, we apply MPS to two …

    ucf Repository record for Solving Constraint Satisfaction Problems with Matrix Product States (opens in a new tab)

  3. Negotiating a Quantum Computation Network: Mechanics, Machines, Mindsets

    … the origins, development, and distribution of quantum computing from a socio-technical perspective. It depicts quantum computing as a result of the negotiations of heterogeneous actors using the concepts of ANT and socio-technical analyses of computing and infrastructure more generally. It …

    carleton Repository record for Negotiating a Quantum Computation Network: Mechanics, Machines, Mindsets (opens in a new tab)

  4. Adiabatic Quantum Computing with QUBO Formulations

    Quantum physics has the potential to revolutionize computer science by building what is called a quantum computer. Quantum computers can perform tasks that are impossible with Turing-machine based classical computers (e.g., generating random sequences of bits) and can outperform classical computers …

    auckland-ms Repository record for Adiabatic Quantum Computing with QUBO Formulations (opens in a new tab)

  5. On Quantum Simulators and Adiabatic Quantum Algorithms

    This Thesis focuses on different aspects of quantum computation theory: adiabatic quantum algorithms, decoherence during the adiabatic evolution and quantum simulators. After an overview on the area of quantum computation and setting up the formal ground for the rest of the Thesis we derive a …

    qucosa-diss

  6. Counterdiabatic, better, faster, stronger : optimal control for approximate counterdiabatic driving

    Adiabatic protocols are employed across a variety of quantum technologies, from implementing state preparation and individual operations that are building blocks of larger devices, to higher-level protocols in quantum annealing and adiabatic quantum computation. The main drawback of adiabatic …

    strathclyde Repository record for Counterdiabatic, better, faster, stronger : optimal control for approximate counterdiabatic driving (opens in a new tab)

  7. Harnessing Quantum Systems for Sensing, Simulation, and Optimization

    Quantum information science offers a remarkable promise: by thinking practically about how quantum systems can be put to work to solve computational and information processing tasks, we gain novel insights into the foundations of quantum theory and computer science. Or, conversely, by …

    maryland Repository record for Harnessing Quantum Systems for Sensing, Simulation, and Optimization (opens in a new tab)

  8. Parameterized query complexity in quantum computation

    … that are not self-dual. We give global and local adiabatic algorithms for both the problems. Our adiabatic algorithms have smaller query complexity as compared to the deterministic algorithms.

    lethbridge Repository record for Parameterized query complexity in quantum computation (opens in a new tab)