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 66 for “"classical simulation"”.
-
The classical simulation of noisy quantum computers : a polyhedral approach
… non-quantum notions of entanglement in the classical simulation of noisy quantum computers where the available measurements are restricted. Such noise rates serve as upper bounds to fault tolerance thresholds. These measurement restrictions come about either through imperfection, and/or by …
-
Quantum/classical simulation of molecular excited state dynamics and spectroscopy
… electronic structure methods for quantum-classical dynamics is presented. The first chapter introduces theoretical methods for simulating photodynamical processes, focussing on the relaxation of molecules in explicit atomistic environments. These approaches include nuclear wavepacket …
-
Short-time Quantum Dynamics: Classical Simulation, Quantum Advantage, and Characterization
… 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 qubits. Another example is the …
-
Novel methods for classical simulation of quantum circuits via ZX-calculus
… of today's '<em>NISQ era'</em> quantum hardware, classical simulation of quantum computations is an essential tool for understanding the quantum advantage and optimising quantum algorithms and systems. However, without the features unique to quantum computers, simulating such computations with …
-
Studies in classical simulation vs quantum advantage for algorithms and communication
… the model solves problems that have no efficient classical algorithms by approximating its transition amplitudes to polynomial precision. Here we give a classical algorithm that disproves this conjecture and also prove that the computational complexity class PQP, defined to capture the …
-
Hidden variable models and classical simulation algorithms for quantum computation with magic states on qubits
… required for a computational speedup over classical computation. Veitch et al. showed that one necessary condition for a computational speedup in the model of quantum computation with magic states is that the discrete Wigner function representing the input state of the quantum circuit must …
-
Methyl Elimination Channel Of The Photodissociation Of Allyl Radical: Semi-Classical Simulation And Velocity-Map-Imaging
… product energy distribution was investigated by classical trajectory simulation on an ab-initio potential energy surface of the ground electronic state of allyl. This theoretical study revealed a new high energy transition state with vinylidene, H2 C=C, as the intermediate that accounts for the …
-
Classical descriptions of quantum computations : foundations of quantum computation via hidden variable models, quasiprobability representations, and classical simulation algorithms
… representations serve as a bridge between classical and quantum descriptions of physical systems. In these representations, nonnegativity allows for a probabilistic interpretation, aligning the description with classical physics. However, the capacity to model quantum systems hinges on the …
-
A framework for system level verification : the SystemC Case
… also need to change with this trend. Combining classical verification techniques, such as simulation, with several other formal techniques, into a single approach has been gaining attention in SoC verification. Classical simulation based verification techniques when used with SystemC face …
-
Methods for using large-scale first principles quantum mechanical calculations to compute free energies of binding
… improve free energies of binding computed with classical (MM) force fields. Initially a direct approach was taken, where snapshots were taken at equally spaced distances throughout the classical simulation and each structure underwent a quantum single point energy calculation. This direct …
-
An Automated Method for Extracting Adsorption Binding Sites in MOFs from GCMC Simulations with Direct Comparison to Experimentally Determined Binding Sites
… level. While grand canonical Monte Carlo (GCMC) simulations routinely generate three-dimensional adsorbate probability densities, these data are most often interpreted qualitatively. The absence of a standardized and automated framework for extracting binding sites from adsorption probability …
-
Manipulation of dynamical resources in quantum information theory
… the absence of coherence and efficient classical simulability (two different notions of classicality) as practical constraints towards achieving quantum advantage, I develop the resource theories of dynamical coherence and dynamical magic, respectively. In developing the resource theory …
-
The complexity of the one clean qubit model, the aBc problem, and quantum online optimization
… communication complexity setting. We show that classically simulating the one clean qubit model with polynomially small additive error is hard. In addition, we conjecture that, even with constant additive error, classical simulation of the one clean qubit model is hard as well. We also study a …
-
Benchmarking quantum hardware with conservation laws
… ever. Competition between hardware platforms and simulation protocols has accelerated, and each year comes with new claims of quantum supremacy over classical simulation. Although these claims may apply to niche, toy problems; there does not appear to be a fundamental barrier preventing quantum …
-
ASPECTS OF NEGATIVE PROBABILITY IN QUANTUM INFORMATION AND QUANTUM FOUNDATIONS
… its negativity serving as the indicator for nonclassicality. Furthermore, the flexibility of this description enables us to tune the negativity to regimes belonging to post-quantum theories, shedding insights on the nonclassical resource and how negativity can be supplied to observe emergent …
-
Quantum programming and synthesis: Internalizing Clifford operations and beyond
… used extensively in quantum error correction and classical simulation of quantum circuits. The first part of the thesis is motivated by the problem of programming with generalized Clifford operations, such as the quantum Fourier transform. We delve into the algebraic complications that arise for …
-
Practical applications of machine learning to quantum computing and quantum simulation
… society, including quantum computing and quantum simulation in particular. This thesis focuses on practical applications of machine learning to the simulation, control, and understanding of quantum manybody systems. First, variational learning using artificial neural networks is leveraged to …
-
Characterizing and Mitigating Errors in Quantum Computers
… performance is demonstrated through numerical simulations. Additionally, we explore the mitigation of coherent noise at the circuit level through the use of the hidden inverses protocol with results from experiments conducted at Duke University, Sandia National Laboratories, and IBM. Finally, …
-
CCZ magic
… one non-Clifford gate [1]. When it comes to classically simulating quantum computation, Clifford gates generate an important class of circuits known as stabilizer circuits, which are efficiently simulable [2]. Stabilizer simulators can be extended to support universal quantum computation by …
Page 1 of 4