Related papers: Making Classical Ground State Spin Computing Fault…
This paper presents a systematic study of the application of convolutional neural networks (CNNs) as an efficient and versatile tool for the analysis of critical and low-temperature phase states in spin system models. The problem of…
The computational complexity of simulating quantum many-body systems generally scales exponentially with the number of particles. This enormous computational cost prohibits first principles simulations of many important problems throughout…
Simulating the Hubbard model is of great interest to a wide range of applications within condensed matter physics, however its solution on classical computers remains challenging in dimensions larger than one. The relative simplicity of…
Over the last decades, there have been many proposals for quantum computation. One of the promising candidates is adiabatic quantum computation (AQC). The central idea of AQC is about finding the ground state of a system with a problem…
Quantum cooling, a deterministic process that drives any state to the lowest eigenstate, has been widely used from studying ground state properties of chemistry and condensed matter quantum physics, to general optimization problems.…
Quantum computing improves substantially on known classical algorithms for various important problems, but the nature of the relationship between quantum and classical computing is not yet fully understood. This relationship can be…
Split-execution computing leverages the capabilities of multiple computational models to solve problems, but splitting program execution across different computational models incurs costs associated with the translation between domains. We…
The famous, yet unsolved, Fermi-Hubbard model for strongly-correlated electronic systems is a prominent target for quantum computers. However, accurately representing the Fermi-Hubbard ground state for large instances may be beyond the…
Quantum processors rely on classical electronic controllers to manipulate and read out the quantum state. As the performance of the quantum processor improves, non-idealities in the classical controller can become the performance bottleneck…
We present elementary mappings between classical lattice models and quantum circuits. These mappings provide a general framework to obtain efficiently simulable quantum gate sets from exactly solvable classical models. For example, we…
Advanced atomic magnetometers have made it possible to acquire nuclear magnetic resonance spectra in zero to ultralow magnetic fields. This regime carries the benefit of compact, low-cost instrumentation with reduced spin relaxation effects…
The advent of hybrid computing platforms consisting of quantum processing units integrated with conventional high-performance computing brings new opportunities for algorithm design. By strategically offloading select portions of the…
Hybrid quantum systems seek to combine the strength of its constituents to master the fundamental conflicting requirements of quantum technology: fast and accurate systems control together with perfect shielding from the environment,…
We extend the formalism of pure state thermodynamics to matrix product states. In pure state thermodynamics finite temperature properties of quantum systems are derived without the need of statistical mechanics ensembles, but instead using…
A recent description of an exact map for the equilibrium structure and thermodynamics of a quantum system onto a corresponding classical system is summarized. Approximate implementations are constructed by pinning exact limits (ideal gas,…
Classical simulations of high-temperature nuclear spin dynamics in solids are known to accurately predict relaxation for spin 1/2 lattices with a large number of interacting neighbors. Once the number of interacting neighbors becomes four…
A quantum system at equilibrium is represented by a corresponding classical system, chosen to reproduce the thermodynamic and structural properties. The objective is to develop a means for exploiting strong coupling classical methods (e.g.,…
Fault-tolerant quantum error correction provides a strategy to protect information processed by a quantum computer against noise which would otherwise corrupt the data. A fault-tolerant universal quantum computer must implement a universal…
Although quantum computers are predicted to have many commercial applications, less attention has been given to their potential for resolving foundational issues in quantum mechanics. Here we focus on quantum computers' utility for the…
In this thesis, we introduce a new quantum Turing machine (QTM) model that supports general quantum operators, together with its pushdown, counter, and finite automaton variants, and examine the computational power of classical and quantum…