Related papers: 1d-qt-ideal-solver: 1D Idealized Quantum Tunneling…
In this paper we develop a class of Implicit-Explicit Runge-Kutta schemes for solving the multi-scale semiconductor Boltzmann equation. The relevant scale which characterizes this kind of problems is the diffusive scaling. This means that,…
Real-time dynamics of the Schwinger model provide an effective description of quark confinement out of equilibrium, routinely employed to model hadronization processes in particle-physics event generators. Ab-initio simulations of such…
We report on the experimental realization of a photonic system that simulates the one-dimensional two-particle Hubbard model. This analogy is realized by means of two-dimensional arrays of coupled optical waveguides, fabricated using…
Knill demonstrated a fault-tolerant quantum computation scheme based on concatenated error-detecting codes and postselection with a simulated error threshold of 3% over the depolarizing channel. %We design a two-dimensional architecture for…
Quantum annealing has emerged as a promising approach for solving NP-hard optimization problems, leveraging quantum phenomena such as quantum tunneling to navigate complex energy landscapes. However, the extent to which quantum tunneling…
Transformer-based language models have become the standard approach to solving natural language processing tasks. However, industry adoption usually requires the maximum throughput to comply with certain latency constraints that prevents…
An existing hybrid MPI-OpenMP scheme is augmented with a CUDA-based fine grain parallelization approach for multidimensional distributed Fourier transforms, in a well-characterized pseudospectral fluid turbulence code. Basics of the hybrid…
This work presents a quantum mechanical framework for analyzing quantization-based optimization algorithms. The sampling process of the quantization-based search is modeled as a gradient-flow dissipative system, leading to a…
We present a solver of 3D two-fluid plasma model for the simulation of short-pulse laser interactions with plasma. This solver resolves the equations of the two-fluid plasma model with ideal gas closure. We also include the…
The union-find decoder is a leading algorithmic approach to the correction of quantum errors on the surface code, achieving code thresholds comparable to minimum-weight perfect matching (MWPM) with amortised computational time scaling…
We present quantum algorithms for the simulation of quantum systems in one spatial dimension, which result in quantum speedups that range from superpolynomial to polynomial. We first describe a method to simulate the evolution of the…
Hamiltonian simulation on quantum computers is strongly constrained by gate counts, motivating techniques to reduce circuit depths. While tensor networks are natural competitors to quantum computers, we instead leverage them to support…
Quantum tunneling is a valuable resource exploited by quantum annealers to solve complex optimization problems. Tunneling events also occur during projective quantum Monte Carlo (PQMC) simulations, and in a class of problems characterized…
We present a new continuous time solver for quantum impurity models such as those relevant to dynamical mean field theory. It is based on a stochastic sampling of a perturbation expansion in the impurity-bath hybridization parameter.…
We present a variational quantum algorithm that solves the one-dimensional diffusion problem with a space-dependent diffusion constant $D(x)$. This problem is relevant for the exchange of hydroxide ions across a multi-layer membrane in an…
We develop a method to synthesize a class of entangling multi-qubit gates for a quantum computing platform with fixed Ising-type interaction with all-to-all connectivity. The only requirement on the flexibility of the interaction is that it…
Sampling Boltzmann probability distributions plays a key role in machine learning and optimization, motivating the design of hardware accelerators such as Ising machines. While the Ising model can in principle encode arbitrary optimization…
We propose a scalable trapped-ion quantum-computing architecture that efficiently incorporates quantum error correction. The chip design exploits orthogonal qubit connectivity by assigning horizontal trap regions to transversal logical…
A hybrid sharp-interface immersed-boundary/front-tracking (IB/FT) method is developed for interface-resolved simulation of evaporating droplets in incompressible multiphase flows. A one-field formulation is used to solve the flow, species…
Modular architectures offer a scalable path toward fault-tolerant quantum computing by interconnecting smaller quantum processing units (QPUs) provided that high-rate, fault-tolerant interfaces can be realized across modules. We present a…