Related papers: The QISG suite: high-performance codes for studyin…
We present sample CUDA programs for the GPU computing of the Swendsen-Wang multi-cluster spin flip algorithm. We deal with the classical spin models; the Ising model, the $q$-state Potts model, and the classical XY model. As for the…
Non-equilibrium electronic quantum transport is crucial for the operation of existing and envisioned electronic, optoelectronic, and spintronic devices. The ultimate goal of encompassing atomistic to mesoscopic length scales in the same…
Simple Quantum Integro-Differential Solver (SQuIDS) is a C++ code designed to solve semi-analytically the evolution of a set of density matrices and scalar functions. This is done efficiently by expressing all operators in an SU(N) basis.…
Quantum compute is scaling fast, from cloud QPUs to high throughput GPU simulators, making it timely to prototype quantum NLP beyond toy tasks. However, devices remain qubit limited and depth limited, training can be unstable, and classical…
The Trotter-Suzuki approximation leads to an efficient algorithm for solving the time-dependent Schr\"odinger equation. Using existing highly optimized CPU and GPU kernels, we developed a distributed version of the algorithm that runs…
We propose gauge-covariant neural networks along with a specialized training algorithm for lattice QCD, designed to handle realistic quarks and gluons in four-dimensional space-time. We show that the smearing procedure can be interpreted as…
We show how to apply the absorbing Markov chain Monte Carlo algorithm of Novotny to simulate kinetically constrained models of glasses. We consider in detail one-spin facilitated models, such as the East model and its generalizations to…
This study systematically benchmarks several non-fault-tolerant quantum computing algorithms across four distinct optimization problems: max-cut, number partitioning, knapsack, and quantum spin glass. Our benchmark includes noisy…
We characterize the phase diagram of anisotropic Heisenberg spin glasses, finding both the spin and the chiral glass transition. We remark the presence of strong finite-size effects on the chiral sector. We find a unique phase transition…
A C++ library ZKCM and its extension library ZKCM_QC have been developed since 2011 for multiple-precision matrix computation and accurate matrix-product-state (MPS) quantum circuit simulation, respectively. In this report, a recent…
We introduce a novel Simulated Quantum Annealing (SQA) algorithm which employs a multispin quantum fluctuation operator. At variance with the usual transverse field, short-range two-spin flip interactions are included in the driver…
We study the the non-equilibrium ageing behaviour of the +/-J Edwards-Anderson model in three dimensions for samples of size up to N=128^3 and for up to 10^8 Monte Carlo sweeps. In particular we are interested in the change of the ageing…
Finding the ground state of spin glasses is a challenging problem with broad implications. Many hard optimization problems, including NP-complete problems, can be mapped, for instance, to the Ising spin glass model. We present a graph-based…
Semiconductor spin qubits are a promising platform for large-scale quantum computing, but have yet to take full advantage of the broad class of quantum low-density parity check (QLDPC) codes, which promise high encoding rates and efficient…
We implement an embedding quantum simulator (EQS) in nuclear spin systems. The experiment consists of a simulator of up to three qubits, plus a single ancillary qubit, where we are able to efficiently measure the concurrence and the…
The strongest evidence for superiority of quantum annealing on spin glass problems has come from comparing simulated quantum annealing using quantum Monte Carlo (QMC) methods to simulated classical annealing [G. Santoro et al., Science 295,…
We discuss an Ising spin glass where each $S=1/2$ spin is coupled antiferromagnetically to three other spins (3-regular graphs). Inducing quantum fluctuations by a time-dependent transverse field, we use out-of-equilibrium quantum Monte…
This dissertation presents the design, implementation and evaluation of GPU-accelerated simulation frameworks for Evolutionary Spatial Cyclic Games (ESCGs), a class of agent-based models used to study ecological and evolutionary dynamics.…
A PC-based parallel computer for medium/large scale lattice QCD simulations is suggested. The Eotvos Univ., Inst. Theor. Phys. cluster consists of 137 Intel P4-1.7GHz nodes. Gigabit Ethernet cards are used for nearest neighbor communication…
Quantum computing enables parallelism through superposition and entanglement and offers advantages over classical computing architectures. However, due to the limitations of current quantum hardware in the noisy intermediate-scale quantum…