1 citations · 2 across the 13 of their papers we have counts for
Showing quant-phShow all
2 papers · 1 filter
quant-ph2026
Unifying Graph Measures and Stabilizer Decompositions for the Classical Simulation of Quantum Circuits
Julien Codsi, Tuomas Laakkonen
Various algorithms have been developed to simulate quantum circuits on classical hardware. Among the most prominent are approaches based on \emph{stabilizer decompositions} and \em…
quant-ph2023★ 1 cited
Classically Simulating Quantum Supremacy IQP Circuits through a Random Graph Approach
Julien Codsi, John van de Wetering
Quantum Supremacy is a demonstration of a computation by a quantum computer that can not be performed by the best classical computer in a reasonable time. A well-studied approach t…