A Practical OpenMP Implementation of Bit-Reversal for Fast Fourier Transform

Weng, Tien‐Hsiung; Huang, Sheng Wen; Perng, Ruey-Kuen; Hsu, Ching‐Hsien; Li, Kuan‐Ching

doi:10.1007/978-3-642-10485-5_15

Cited by 2 publications

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Cache-efficient index permutations The permutation of the indexes necessary as a preparatory step for efficient matrix multiplications can be very costly for large tensors, since it involves the reordering of virtually all entries of the tensors in memory; similar issues have been an area of study in other contexts [45][46][47]. In this section we describe our novel cache-efficient implementation of the permutation of tensor indexes.…”

Section: Implementation Of the Simulatormentioning

confidence: 99%

A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware

et al. 2019

View full text Add to dashboard Cite

Here we present qFlex, a flexible tensor network based quantum circuit simulator. qFlex can compute both exact amplitudes, essential for the verification of the quantum hardware, as well as low fidelity amplitudes, in order to mimic sampling from Noisy Intermediate-Scale Quantum (NISQ) devices. In this work, we focus on random quantum circuits (RQCs) in the range of sizes expected for supremacy experiments. Fidelity f simulations are performed at a cost that is 1/f lower than perfect fidelity ones. We also present a technique to eliminate the overhead introduced by rejection sampling in most tensor network approaches. We benchmark the simulation of square lattices and Google's Bristlecone QPU. Our analysis is supported by extensive simulations on NASA HPC clusters Pleiades and Electra. For our most computationally demanding simulation, the two clusters combined reached a peak of 20 PFLOPS (single precision), i.e., 64% of their maximum achievable performance, which represents the largest numerical computation in terms of sustained FLOPs and number of nodes utilized ever run on NASA HPC clusters. Finally, we introduce a novel multithreaded, cache-efficient tensor index permutation algorithm of general application.

show abstract

Section: Implementation Of the Simulatormentioning

confidence: 99%