Related papers: 1d-qt-ideal-solver: 1D Idealized Quantum Tunneling…
Earlier, in the CINT program at Los Alamos National Laboratory, we focused ultrafast mode-locked lasers on the tip-sample junction of a scanning tunneling microscope to generate currents at hundreds of harmonics of the laser pulse…
Digital quantum simulation (DQS) is one of the most promising paths for achieving first useful real-world applications for quantum processors. Yet even assuming rapid progress in device engineering and development of fault-tolerant quantum…
Fully tunable flux qubits offer in-situ and independent controls of their energy potential asymmetry and tunnel barrier, making them versatile tools for quantum computation and the study of decoherence sources. However, only short coherence…
Fault tolerance is a prerequisite for scalable quantum computing. Architectures based on 2D topological codes are effective for near-term implementations of fault tolerance. To obtain high performance with these architectures, we require a…
Usual scenarios of fault-tolerant computation are concerned with the fault-tolerant realization of quantum algorithms that compute classical functions, such as Shor's algorithm for factoring. In particular, this means that input and output…
Preserving the admissible set of the ideal magnetohydrodynamics (MHD) equations is important not only for producing physically meaningful numerical solutions, but more importantly for achieving robust computations. In this paper, we develop…
Instanton methods, in which imaginary-time evolution gives the tunneling rate, have been widely used for studying quantum tunneling in various contexts. Nevertheless, how accurate instanton methods are for the problems of macroscopic…
The surface code is one the most promising alternatives for implementing fault-tolerant, large-scale quantum information processing. Its high threshold for single-qubit errors under stochastic noise is one of its most attrative features. We…
Conventional approaches to fault-tolerant quantum computing realize logical circuits gate-by-gate, synthesizing each gate independently on one or more code blocks. This incurs excess overhead and doesn't leverage common structures in…
In recent years, the number of hybrid algorithms that combine quantum and classical computations has been continuously increasing. These two approaches to computing can mutually enhance each others' performances thus bringing the promise of…
A tridiagonal matrix algorithm (TDMA), Pipelined-TDMA, is developed for multi-GPU systems to resolve the scalability bottlenecks caused by the sequential structure of conventional divide-and-conquer TDMA. The proposed method pipelines…
As quantum processors grow in scale and reliability, the need for efficient quantum gate decomposition of circuits to a set of specific available gates, becomes ever more critical. The decomposition of a particular algorithm into a sequence…
We propose a novel methodology for drawing iid realizations from any target distribution on the Euclidean space with arbitrary dimension. No assumption of compact support is necessary for the validity of our theory and method. Our idea is…
A custom-built and precisely controlled quantum system may offer access to a fundamental understanding of another, less accessible system of interest. A universal quantum computer is currently out of reach, but an analog quantum simulator…
We present a parallel version of the well-known Split-Step Fourier method (SSF) for solving the Nonlinear Schr\"odinger equation, a mathematical model describing wave packet propagation in fiber optic lines. The algorithm is implemented…
Quantum computation with quantum gates induced by geometric phases is regarded as a promising strategy in fault tolerant quantum computation, due to its robustness against operational noises. However, because of the parametric restriction…
Hardware-efficient circuits employed in Quantum Machine Learning are typically composed of alternating layers of uniformly applied gates. High-speed numerical simulators for such circuits are crucial for advancing research in this field. In…
The 1D Schr\"odinger equation closed with the transparent boundary conditions(TBCs) is known as a successful model for describing quantum effects, and is usually considered with a self-consistent Poisson equation in simulating quantum…
We generalized the recently introduced new impurity solver based on the diagrammatic expansion around the atomic limit and Quantum Monte Carlo summation of the diagrams. We present generalization to the cluster of impurities, which is at…
We show that thresholds for fault-tolerant quantum computation are solely determined by the quality of single-system operations if one allows for d-dimensional systems with $8 \leq d \leq 32$. Each system serves to store one logical qubit…