34 citations · 138 across the 34 of their papers we have counts for
3 papers · 1 filter
Communication-avoiding Cholesky-QR2 for rectangular matrices
Edward Hutter, Edgar Solomonik
Scalable QR factorization algorithms for solving least squares and eigenvalue problems are critical given the increasing parallelism within modern machines. We introduce a more gen…
Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral
Edwin Pednault, John A. Gunnels, Giacomo Nannicini +6
With the current rate of progress in quantum computing technologies, systems with more than 50 qubits will soon become reality. Computing ideal quantum state amplitudes for circuit…
Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions
Edgar Solomonik, James Demmel, Torsten Hoefler
We introduce a new theoretical framework for deriving lower bounds on data movement in bilinear algorithms. Bilinear algorithms are a general representation of fast algorithms for…