Exact diagonalization of the Hubbard model on graphics processing units

We solve the Hubbard model with the exact diagonalization method on a graphics processing unit (GPU). We benchmark our GPU program against a sequential CPU code by using the Lanczos algorithm to solve the ground state energy in two cases: a one-dimensional ring and a two-dimensional square lattice. In the one-dimensional case, we obtain speedups of over 100 and 60 in single and double precision arithmetic, respectively. In the two-dimensional case, the corresponding speedups are over 110 and 70

Massively parallel split-step Fourier techniques for simulating quantum systems on graphics processing units

The split-step Fourier method is a powerful technique for solving partial differential equations and simulating ultracold atomic systems of various forms. In this body of work, we focus on several variations of this method to allow for simulations of one, two, and three-dimensional quantum systems, along with several notable methods for controlling these systems. In particular, we use quantum optimal control and shortcuts to adiabaticity to study the non-adiabatic generation of superposition states in strongly correlated one-dimensional systems, analyze chaotic vortex trajectories in two dimensions by using rotation and phase imprinting methods, and create stable, threedimensional vortex structures in Bose–Einstein condensates through artificial magnetic fields generated by the evanescent field of an optical nanofiber. We also discuss algorithmic optimizations for implementing the split-step Fourier method on graphics processing units. All computational methods present in this work are demonstrated on physical systems and have been incorporated into a state-of-the-art and open-source software suite known as GPUE, which is currently the fastest quantum simulator of its kind.Okinawa Institute of Science and Technology Graduate Universit

HyperCP: A high-rate spectrometer for the study of charged hyperon and kaon decays

The HyperCP experiment (Fermilab E871) was designed to search for rare phenomena in the decays of charged strange particles, in particular CP violation in $\Xi$ and $\Lambda$ hyperon decays with a sensitivity of $10^{-4}$. Intense charged secondary beams were produced by 800 GeV/c protons and momentum-selected by a magnetic channel. Decay products were detected in a large-acceptance, high-rate magnetic spectrometer using multiwire proportional chambers, trigger hodoscopes, a hadronic calorimeter, and a muon-detection system. Nearly identical acceptances and efficiencies for hyperons and antihyperons decaying within an evacuated volume were achieved by reversing the polarities of the channel and spectrometer magnets. A high-rate data-acquisition system enabled 231 billion events to be recorded in twelve months of data-taking.Comment: 107 pages, 45 Postscript figures, 14 tables, Elsevier LaTeX, submitted to Nucl. Instrum. Meth.

Accelerating lattice reduction with FPGAs

International audienceWe describe an FPGA accelerator for the Kannan­–Fincke­–Pohst enumeration algorithm (KFP) solving the Shortest Lattice Vector Problem (SVP). This is the first FPGA implementation of KFP specifically targeting cryptographically relevant dimensions. In order to optimize this implementation, we theoretically and experimentally study several facets of KFP, including its efficient parallelization and its underlying arithmetic. Our FPGA accelerator can be used for both solving stand-alone instances of SVP (within a hybrid CPU­–FPGA compound) or myriads of smaller dimensional SVP instances arising in a BKZ-type algorithm. For devices of comparable costs, our FPGA implementation is faster than a multi-core CPU implementation by a factor around 2.12