34 citations · 138 across the 34 of their papers we have counts for
39 papers
Simulating Clifford Circuits with Gaussian Elimination
Yuchen Pang, Edgar Solomonik
Quantum circuits are considered more powerful than classical circuits and require exponential resources to simulate classically. Clifford circuits are a special class of quantum ci…
Efficient Tensor Completion Algorithms for Highly Oscillatory Operators
Navjot Singh, Edgar Solomonik, Xiaoye Sherry Li +1
This paper presents low-complexity tensor completion algorithms and their efficient implementation to reconstruct highly oscillatory operators discretized as matrices.…
Approximate Contraction of Arbitrary Tensor Networks with a Flexible and Efficient Density Matrix Algorithm
Linjian Ma, Matthew Fishman, Miles Stoudenmire +1
Tensor network contractions are widely used in statistical physics, quantum computing, and computer science. We introduce a method to efficiently approximate tensor network contrac…
Optimizing Distributed Tensor Contractions using Node-Aware Processor Grids
Andreas Irmler, Raghavendra Kanakagiri, Sebastian T. Ohlmann +2
We propose an algorithm that aims at minimizing the inter-node communication volume for distributed and memory-efficient tensor contraction schemes on modern multi-core compute nod…
Minimum Cost Loop Nests for Contraction of a Sparse Tensor with a Tensor Network
Raghavendra Kanakagiri, Edgar Solomonik
Sparse tensor decomposition and completion are common in numerous applications, ranging from machine learning to computational quantum chemistry. Typically, the main bottleneck in…
Efficient parallel implementation of the multiplicative weight update method for graph-based linear programs
Caleb Ju, Serif Yesil, Mengyuan Sun +2
Positive linear programs (LPs) model many graph and operations research problems. One can solve for a -approximation for positive LPs, for any selected , in polylogarithm…