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 20 of 124 for “"Quantum advantage"”.

  1. Quantum Advantage on Blockchain Technologies

    … the coming decades, blockchain technologies and quantum computation. Blockchain technologies have exploded in popularity since their inception in the early 2010s. There are thousands of different projects and millions of users globally. Cryptocurrencies as a product of blockchains are owned and …

    kent Download PDF for Quantum Advantage on Blockchain Technologies (opens in a new tab)

  2. Quantum Advantage in Sensing and Simulation

    … interest in finding more such examples of quantum advantage, that is, tasks where a quantum device can outperform its classical counterpart. While the universal, programmable quantum computers that can run Shor's algorithm represent one direction in which to search for quantum advantage, …

    maryland Repository record for Quantum Advantage in Sensing and Simulation (opens in a new tab)

  3. Towards Quantum Advantage with Trapped Ions

    <p>Physical systems that use the quantum laws of Nature may potentially achieve quantum advantage—the ability to solve problems intractable for conventional computers. Although quantum information is fragile, quantum error correction may enable the construction of fault-tolerant quantum computers …

    duke Repository record for Towards Quantum Advantage with Trapped Ions (opens in a new tab)

  4. ANALOG QUANTUM SIMULATORS FOR QUANTUM ADVANTAGE AND QUANTUM MACHINE LEARNING

    In this thesis, we show signatures of quantum primacy in driven analog quantum many-body systems. Namely, we provide theoretical evidence that periodic unitary evolution with a random unitary drawn from the Circular Orthogonal Ensemble (COE) leads to a sampling task that cannot be efficiently …

    nus Repository record for ANALOG QUANTUM SIMULATORS FOR QUANTUM ADVANTAGE AND QUANTUM MACHINE LEARNING (opens in a new tab) Download file for ANALOG QUANTUM SIMULATORS FOR QUANTUM ADVANTAGE AND QUANTUM MACHINE LEARNING (opens in a new tab)

  5. Short-time Quantum Dynamics: Classical Simulation, Quantum Advantage, and Characterization

    … thesis presents several results on short-time quantum dynamics, with themes spanning classical simulation, quantum advantage, and characterization. A prime example of short-time quantum dynamics is that of a shallow quantum circuit, whose circuit depth is a constant independent of the number of …

    waterloo Repository record for Short-time Quantum Dynamics: Classical Simulation, Quantum Advantage, and Characterization (opens in a new tab)

  6. TOWARDS QUANTUM ADVANTAGE AND CERTIFICATION WITH NOISY INTERMEDIATE-SCALE QUANTUM DEVICES

    The second quantum revolution’s success critically depends on the practical applications of the noisy intermediate-scale quantum devices. Despite the hope rendered by the experimental demonstration of “quantum supremacy”, the essential question regarding how to translate such breakthroughs into …

    nus Repository record for TOWARDS QUANTUM ADVANTAGE AND CERTIFICATION WITH NOISY INTERMEDIATE-SCALE QUANTUM DEVICES (opens in a new tab) Download file for TOWARDS QUANTUM ADVANTAGE AND CERTIFICATION WITH NOISY INTERMEDIATE-SCALE QUANTUM DEVICES (opens in a new tab)

  7. Studies in classical simulation vs quantum advantage for algorithms and communication

    <p>This thesis studies computational advantages that could be achieved by using quantum resources in two different contexts.</p> <p>The first part studies Permutational Quantum Computing, a quantum computational model developed to study computation by spin recoupling. It was a conjecture, stated by …

    oxford Repository record for Studies in classical simulation vs quantum advantage for algorithms and communication (opens in a new tab)

  8. Quantum Advantage via Physics-Inspired Methods in Optimization: Empirical and Theoretical Analysis

    … for classical computation.Physics-inspired quantum algorithms, such as Quantum Adiabatic Algorithm (QAA) and Quantum Hamiltonian Descent (QHD), offer a promising paradigm for solving these problems by utilizing quantum dynamics to accelerate navigating complex landscapes of objective …

    maryland Repository record for Quantum Advantage via Physics-Inspired Methods in Optimization: Empirical and Theoretical Analysis (opens in a new tab)

  9. Forecasting the timeline for quantum advantage and economic viability using option pricing

    The potential for quantum computing to significantly reduce the time necessary to process and analyze data has attracted the attention of major financial institutions. These companies are continually researching ways to accelerate data processing and analysis to react faster to market changes and …

    colo-mines Repository record for Forecasting the timeline for quantum advantage and economic viability using option pricing (opens in a new tab)

  10. Investigating the Quantum Advantage of Two-Mode Bright Squeezed State in Quantum Sensors

    Research on quantum states of light for real-world quantum sensing has accelerated over the past decade, driven by advances in both theory and experimental techniques. Nevertheless, fully realizing the quantum advantage and translating it into practical applications remains a significant challenge. …

    tamu Repository record for Investigating the Quantum Advantage of Two-Mode Bright Squeezed State in Quantum Sensors (opens in a new tab) Embargoed until 2028-05-01

  11. Investigating the Quantum Advantage of Two-Mode Bright Squeezed State in Quantum Sensors

    Research on quantum states of light for real-world quantum sensing has accelerated over the past decade, driven by advances in both theory and experimental techniques. Nevertheless, fully realizing the quantum advantage and translating it into practical applications remains a significant challenge. …

    tamu Repository record for Investigating the Quantum Advantage of Two-Mode Bright Squeezed State in Quantum Sensors (opens in a new tab) Embargoed until 2028-05-01

  12. Comparing two cohomological obstructions for contextuality, and a generalised construction of quantum advantage with shallow circuits

    We present two results on the subject of quantum contextuality and cohomology, and non-locality and quantum advantage with shallow circuits. Abramsky et al. showed that a range of examples of quantum contextuality is detected by a cohomological invariant based on Čech cohomology. However, the …

    oxford Repository record for Comparing two cohomological obstructions for contextuality, and a generalised construction of quantum advantage with shallow circuits (opens in a new tab)

  13. An investigation of the potential quantum advantage in next-generation timing and positioning techniques for satellite networks

    … in space. In particular, the potential of quantum properties such as squeezing and entanglement to overcome the standard quantum limit in precision is explored. Additionally, measurement strategies such as the temporal and spatial mode demultiplexing are also investigated. Despite their …

    unsw Repository record for An investigation of the potential quantum advantage in next-generation timing and positioning techniques for satellite networks (opens in a new tab)

  14. Quantum target detection

    Quantum target detection forms a particular subset of quantum sensing protocols whereby one's task is to determine whether or not a target is present within some region of interest. The goal is to outperform the corresponding optimal classical protocol, establishing a quantum advantage. Such an …

    whiterose Download PDF for Quantum target detection (opens in a new tab)

  15. Locality in distributed quantum and online graph algorithms

    In this thesis, I study how quantum computation and quantum communication can help large networks of computers to solve computational problems faster. I also connect the notion of locality between various models, including distributed quantum algorithms and online graph algorithms, and show that …

    aalto Repository record for Locality in distributed quantum and online graph algorithms (opens in a new tab)

  16. Atomic Boson Sampling in a Bose-Einstein Condensed Gas

    … (BEC) trap as a platform for studies of quantum statistical phenomena in many-body interacting systems. In particular, it could facilitate testing atomic boson sampling of the excited-state occupations and its quantum advantage over classical computing in a full, controllable and clear …

    tamu Repository record for Atomic Boson Sampling in a Bose-Einstein Condensed Gas (opens in a new tab)

  17. Applications of Gaussian boson sampling in graph theory

    Quantum optics, which encodes information in the states of light, is privileged to have<br/>complexity-theoretic evidence supporting a scheme for quantum advantage that is native to<br/>the platform – boson sampling, and its variant Gaussian boson sampling – providing a natu-<br/>ral choice for …

    bristol Repository record for Applications of Gaussian boson sampling in graph theory (opens in a new tab) Download PDF for Applications of Gaussian boson sampling in graph theory (opens in a new tab)

  18. Classical simulations of Gaussian boson sampling

    … currently being poured into the development of quantum technologies in the hope that they will speed up certain tasks significantly. Boson sampling is a task that can be run on a near-term device and so was proposed as a promising candidate for a demonstration of quantum advantage. As …

    bristol Repository record for Classical simulations of Gaussian boson sampling (opens in a new tab) Download PDF for Classical simulations of Gaussian boson sampling (opens in a new tab)

  19. THE BOUNDARIES OF COMPUTATIONAL HARDNESS IN NOISY QUANTUM CIRCUITS

    Many families of quantum circuits, when run on an ideal (or fault-tolerant) quantum computer, produce outputs that cannot be efficiently reproduced using classical computers, assuming standard complexity-theoretic or cryptographic conjectures. Examples include Shor's algorithm for factoring …

    maryland Repository record for THE BOUNDARIES OF COMPUTATIONAL HARDNESS IN NOISY QUANTUM CIRCUITS (opens in a new tab)

  20. Composing classical and quantum relaxations of CSP and structure isomorphism

    … in universal algebra, finite model theory, and quantum information can all be captured abstractly using (co)monads. In particular, we will show that distribution minion monads capture many important minion tests from universal algebra, and that the quantum monad can be used to capture quantum …

    oxford Repository record for Composing classical and quantum relaxations of CSP and structure isomorphism (opens in a new tab)

Page 1 of 7