3 papers
math.NA2026
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.…
quant-ph2025
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…
quant-ph2024
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…