34 citations · 138 across the 34 of their papers we have counts for
4 papers · 1 filter
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…
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…
Tensor Rank and Other Multipartite Entanglement Measures of Graph States
Louis Schatzki, Linjian Ma, Edgar Solomonik +1
Graph states play an important role in quantum information theory through their connection to measurement-based computing and error correction. Prior work has revealed elegant conn…
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…