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 17 of 17 for “"Quantum speedup"”.

  1. Towards a Quantum Speedup via Applications and Architectures

    Since their original proposal in the 70s and 80s, quantum computers have evolved from an interesting theoretical concept to a physically realisable technology. This has been particularly exemplified with a recent publication by Arute et al. (<i>Nature</i>, 574(7779):505-510, 2019), which has …

    bristol Repository record for Towards a Quantum Speedup via Applications and Architectures (opens in a new tab) Download PDF for Towards a Quantum Speedup via Applications and Architectures (opens in a new tab)

  2. Quantum Speedups: Structure, Design, and Application

    A quantum speedup occurs when a computational problem can be solved faster on a quantum computer than on a classical computer. This thesis studies the circumstances under which quantum speedups can arise from three perspectives. First, we study the structure of the problem. We characterize how a …

    maryland Repository record for Quantum Speedups: Structure, Design, and Application (opens in a new tab)

  3. Quantum Computing for Optimization and Machine Learning

    Quantum Computing leverages the quantum properties of subatomic matter to enable computations faster than those possible on a regular computer. Quantum Computers have become increasingly practical in recent years, with some small-scale machines becoming available for public use. The rising …

    maryland Repository record for Quantum Computing for Optimization and Machine Learning (opens in a new tab)

  4. CIRCUIT-BASED QUANTUM ALGORITHMS

    The topic of this thesis is circuit-based quantum algorithms, which consists of three parts. First, it investigates the potential of the unbounded fan-out gate and the global tunable gate in building constant-depth quantum circuits. Two types of constant-depth constructions are proposed for …

    nus Repository record for CIRCUIT-BASED QUANTUM ALGORITHMS (opens in a new tab) Download file for CIRCUIT-BASED QUANTUM ALGORITHMS (opens in a new tab)

  5. Kvantinių sistemų triukšmo simuliacijos /

    The purpose of this study is to investigate quantum systems noise in “IBMQ” architecture and create model that can repeat it. In the first section of this paper author explains basic mathematical principles of quantum computing. Second chapter is dedicated to “IBMQ” architecture. There briefly …

    vilnius Repository record for Kvantinių sistemų triukšmo simuliacijos / (opens in a new tab)

  6. Software Techniques to Mitigate Errors on Noisy Quantum Computers

    Quantum computers are domain-specific accelerators that can provide a large speedup for important problems. Quantum computers with few tens of qubits have already been demonstrated, and machines with 100+ qubits are expected soon. These machines face significant reliability and scalability …

    gatech Repository record for Software Techniques to Mitigate Errors on Noisy Quantum Computers (opens in a new tab)

  7. Quantum Speed-ups for Boolean Satisfiability and Derivative-Free Optimization

    … free optimization in the context of large scale quantum computers. In the first part, we survey well known classical techniques for solving satisfiability. We compute the approximate time it would take to solve SAT instances using quantum techniques and compare it with state-of-the heart …

    waterloo Repository record for Quantum Speed-ups for Boolean Satisfiability and Derivative-Free Optimization (opens in a new tab)

  8. Quantum Approaches to Option Pricing under Time-Changed Stochastic ModelS

    … time change from both classical and quantum computational perspectives. The operational-time pricing expectation is approximated by truncating and discretizing the inverse clock and, in the direct formulation, the latent Gaussian variables. Direct and conditional finite-state …

    calgary Repository record for Quantum Approaches to Option Pricing under Time-Changed Stochastic ModelS (opens in a new tab)

  9. Quantum Computation Inspired Constraint Handling and Intelligent Learning for Data-Driven Combinatorial Optimal Decision-Making in Operations Engineering

    … engineering applications. The emerging field of quantum inspired computation has shown some salient features of quantum information processing that are promised to excel in quantum speedup contributing to solving operational optimization problems of practical relevance more efficiently than …

    gatech Repository record for Quantum Computation Inspired Constraint Handling and Intelligent Learning for Data-Driven Combinatorial Optimal Decision-Making in Operations Engineering (opens in a new tab)

  10. Quantum evolution: The case of weak localization for a 3D alloy-type Anderson model and application to Hamiltonian based quantum computation

    Over the years, people have found Quantum Mechanics to be extremely useful in explaining various physical phenomena from a microscopic point of view. Anderson localization, named after physicist P. W. Anderson, states that disorder in a crystal can cause non-spreading of wave packets, which is one …

    vt Repository record for Quantum evolution: The case of weak localization for a 3D alloy-type Anderson model and application to Hamiltonian based quantum computation (opens in a new tab)

  11. SPARSITY AND WEAK SUPERVISION IN QUANTUM MACHINE LEARNING

    Quantum computing is an interdisciplinary field at the intersection of computer science, mathematics, and physics that studies information processing tasks on a quantum computer. A quantum computer is a device whose operations are governed by the laws of quantum mechanics. As building quantum …

    vcu Repository record for SPARSITY AND WEAK SUPERVISION IN QUANTUM MACHINE LEARNING (opens in a new tab)

  12. Applications and verification of quantum computers

    Quantum computing devices can solve problems that are infeasible for classical computers. While rigorously proving speedups over existing classical algorithms demonstrates the usefulness of quantum computers, analyzing the limits on efficient processes for computational tasks allows us to better …

    maryland Repository record for Applications and verification of quantum computers (opens in a new tab)

  13. Quantum algorithms for machine learning and optimization

    … in the context of classical computing, their quantum counterparts are far from well-understood. In this thesis, we explore algorithms that bridge the gap between the fields of quantum computing and machine learning. First, we consider general optimization problems with only function …

    maryland Repository record for Quantum algorithms for machine learning and optimization (opens in a new tab)

  14. Quantum Annealing for Solving Optimization Problems

    Quantum annealing (QA) uses the principles of quantum mechanics for solving unconstrained optimization problems. Since its initial proposal, there has been much interest in the search for practical problems for which QA has advantage over classical algorithms. Although it is believed that quantum …

    purdue-thes Repository record for Quantum Annealing for Solving Optimization Problems (opens in a new tab)

  15. Essays on Labor Economics

    Quantum annealing (QA) uses the principles of quantum mechanics for solving unconstrained optimization problems. Since its initial proposal, there has been much interest in the search for practical problems for which QA has advantage over classical algorithms. Although it is believed that quantum …

    purdue-thes Repository record for Essays on Labor Economics (opens in a new tab)

  16. Analog and digital adiabatic quantum annealing with oscillating transverse fields

    This thesis investigates both analog Quantum Annealing and digital Quantum Annealing with oscillating transverse field in solving hard optimization problems. In the first part, we consider a range of unconventional modifications to Quantum Annealing (QA), applied to an artificial trial problem with …

    colo-mines Repository record for Analog and digital adiabatic quantum annealing with oscillating transverse fields (opens in a new tab)

  17. Quantum Machine Learning Without Any Quantum

    Could quantum machine learning someday run faster than classical machine learning? Over the past decade, the field of QML has produced many proposals for attaining large quantum speedups for computationally intensive tasks in machine learning and data analysis. However, it was unclear whether these …

    washington Repository record for Quantum Machine Learning Without Any Quantum (opens in a new tab)