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 19 of 19 for “"Classical Simulation"”.

  1. Efficient classical simulation of spin networks

    … to be exponentially hard to simulate using classical computers. It is in these hard cases where we hope to find quantum algorithms that provide speed up over classical algorithms. In the paradigm of quantum adiabatic computation, instances of spin networks with 2-local interactions could …

    mit Repository record for Efficient classical simulation of spin networks (opens in a new tab)

  2. Classical simulation complexity of restricted models of quantum computation

    … of these models appear to be able to outperform classical computers at certain computational tasks, such as sampling from certain probability distributions. Understanding which of these models are capable of performing such tasks and characterizing the classical simulation complexity of these …

    mit Repository record for Classical simulation complexity of restricted models of quantum computation (opens in a new tab)

  3. Lower bounds on the classical simulation of quantum circuits for quantum supremacy

    … not also have been performed quickly on today's classical computers. One proposed path toward achieving this milestone, which is often referred to as quantum supremacy, is to perform specific types of quantum circuits for which it is guaranteed, under plausible complexity theoretic conjectures, …

    mit Repository record for Lower bounds on the classical simulation of quantum circuits for quantum supremacy (opens in a new tab)

  4. Collision induced decay of metastable baby skyrmions

    … could decay by quantum mechanical tunneling. Classically, they are metastable: only a finite excitation energy is required to induce their decay. We attempt to induce soliton decay in a classical simulation by colliding pairs of solitons. We analyze the collision of solitons with varying …

    mit Repository record for Collision induced decay of metastable baby skyrmions (opens in a new tab)

  5. Simulation algorithms, Floquet phenomena and superconducting qubits

    … properties of algorithms for quantum simulation. In the introduction, we begin by reviewing the circuit model of quantum computing. We then introduce circuit quantum electrodynamics (QED), the framework by which superconducting electrical circuits are theoretically modeled, as well as …

    uiuc Repository record for Simulation algorithms, Floquet phenomena and superconducting qubits (opens in a new tab)

  6. Performance Analysis of Double Gate MOSFET Using Monte Carlo Simulation

    … Comparison is made between quantum-corrected and classical simulation results. Change in potential and concentration pro les in the quantum-corrected simulation is the result of coupling between the Schr odinger and the Poisson equations. The drain current increase compared to a conventional …

    uiuc Repository record for Performance Analysis of Double Gate MOSFET Using Monte Carlo Simulation (opens in a new tab)

  7. The power of restricted quantum computational models

    … do not use magic states can be simulated by a classical computer. We extended this result to show that all circuits in this form can be partially simulated; the same computation can be implemented using a smaller quantum computer with the assistance of some polynomial time classical

    cambridge Repository record for The power of restricted quantum computational models (opens in a new tab)

  8. Variational Algorithms and Resources for Near-Term Quantum Simulation

    … the quantum resources needed for some quantum simulation tasks. We estimate the gate complexity of the site-by-site algorithm for fault-tolerant ground state preparation, which we extend to the case of degenerate Hamiltonians. Using matrix product states we evaluate the non-stabilizer quantum …

    maryland Repository record for Variational Algorithms and Resources for Near-Term Quantum Simulation (opens in a new tab)

  9. Phase space and path integral approaches to quantum dynamics

    "Exact quantum dynamical simulation of processes in highly coupled condensed phase reactions is extremely challenging. The work reported in this dissertation builds on top of two different approaches. First, we present methods for calculating the multidimensional Wigner function. We start with a …

    uiuc Repository record for Phase space and path integral approaches to quantum dynamics (opens in a new tab)

  10. Coherent control of polarized neutron interferometry

    … generates no entanglement, yet no efficient classical simulation is known or thought to exist. We present calculations showing a nonzero quantum discord in this implementation, as a means of quantifying other nonclassical correlations in addition to entanglement. All experiments were …

    mit Repository record for Coherent control of polarized neutron interferometry (opens in a new tab)

  11. Quantum computation with identical bosons

    … of outcomes cannot be reproduced by any classical device in a reasonable time span. This gives hands-on evidence of quantum advantage, that there are quantum phenomena are prohibitive to simulate in the classical world. Moreover, this quantum advantage is already present in limited …

    mit Repository record for Quantum computation with identical bosons (opens in a new tab)

  12. On Near-Term Quantum Computation: Theoretical Aspects of Variational Quantum Algorithms and Quantum Computational Supremacy

    … which put them outside the regime of simulation on modern supercomputers. However, since their computational power is not well understood, it’s not obvious what to do with them! Of course, there are several ideas, and this thesis contributes to the theory underpinning some of these …

    mit Repository record for On Near-Term Quantum Computation: Theoretical Aspects of Variational Quantum Algorithms and Quantum Computational Supremacy (opens in a new tab)

  13. A Hybrid Simulation Methodology To Evaluate Network Centricdecision Making Under Extreme Events

    … events. This dissertation provides a hybrid simulation methodology based on classical simulation paradigms combined with social network analysis for evaluating and improving the organizational structures and procedures, mainly the incident command systems and plans for facing those extreme …

    ucf

  14. Molecular dynamics studies of the protein bacteriorhodopsin

    Molecular dynamics (MD) simulations are employed to study the structure and function of the protein bacteriorhodopsin (bR), a 26 kD protein which residues in the purple membrane of the bacterium Halobacterium halobium. Bacteriorhodopsin undergoes a light-driven cyclic process, which pumps protons …

    uiuc Repository record for Molecular dynamics studies of the protein bacteriorhodopsin (opens in a new tab)

  15. Dynamical aspects of quantum information and classical simulability

    … giving rise to collective phenomena with no classical counterpart. Understanding these dynamical phases of matter is believed to be typically hard. To simulate such dynamics, we need to either emulate it on a quantum device—acting as a quantum simulator—or, by exploiting its underlying …

    cambridge Repository record for Dynamical aspects of quantum information and classical simulability (opens in a new tab)

  16. Optimizing Quantum Annealing for Trapped Ions: Performance, Resources, and Noise Mitigation

    … ground state. Analytical arguments and numerical simulations on industrially motivated benchmarks demonstrate that modest pulse rates achievable on current hardware suffice to recover noise-free fidelity, and reveal a universal scaling of the final fidelity in terms of a generalized parameter …

    trento Repository record for Optimizing Quantum Annealing for Trapped Ions: Performance, Resources, and Noise Mitigation (opens in a new tab)

  17. Topics in Computing with Quantum Oracles and Higher-Dimensional Many-Body Systems

    … which circumstances they outperform classical computers, how large a speed-up can be gained, and what draws the distinction between quantum and classical computing. In this Ph.D. thesis, I investigate a few intriguing properties of quantum computers involving quantum oracles and …

    cambridge Repository record for Topics in Computing with Quantum Oracles and Higher-Dimensional Many-Body Systems (opens in a new tab)

  18. The cold atom toolbox in momentum space

    … behavior from interacting quantum systems via classical simulation requires an infeasible level of computing power. Instead, we can use an easily tunable, clean quantum system as a quantum simulation of a more unwieldy system, building the same model to study the same physics, but in a more …

    uiuc Repository record for The cold atom toolbox in momentum space (opens in a new tab)

  19. Learning in Quantum Mechanics

    … of this thesis focus on approximate learning of classical data embedded in quantum systems. The quantum mechanical nature of the physical systems leads to inherent randomness, even if the classical data is embedded in a deterministic way. In the final chapter we turn to exact learning of quantum …

    cambridge Repository record for Learning in Quantum Mechanics (opens in a new tab)