Sep 7, 2020 · Our work improves known classical algorithms with cubic runtime. A key ingredient is a mapping which, given a tree decomposition of some graph G ...
Feb 12, 2024 · Our work improves known classical algorithms with cubic runtime. A key ingredient is a mapping which, given a tree decomposition of some graph G ...
At the core of this algorithm is a tree-decomposition-to-circuit mapping which takes a graph G along with a tree decomposition T and outputs a Clifford circuit ...
PDF | A general quantum circuit can be simulated classically in exponential time. If it has a planar layout, then a tensor-network contraction algorithm.
Planar Clifford circuits. Theorem. If CZ gates of a Clifford circuit act only on edges of a planar graph, we can sample from the output distribution in ...
This work improves known classical algorithms with cubic runtime and provides a classical algorithm with runtime scaling asymptotically as nω/2<n1 which ...
Our main result is a classical algorithm with runtime upper bounded as n^{1.19} which samples from the output distribution obtained by measuring each qubit of a ...
May 18, 2021 · Abstract Clifford circuits are a special family of quantum circuits that can be simulated on a classical computer in polynomial time using ...
``Simulation of low-depth quantum circuits as complex undirected graphical models'' (2017). Sergey Bravyi, Dan Browne, Padraic Calpin, Earl Campbell, ...
Sep 18, 2020 · Bibliographic details on Fast simulation of planar Clifford circuits.