Fast simulation of planar Clifford circuits
A general quantum circuit can be simulated classically in exponential time. If it has a planar layout, then a tensor-network contraction algorithm due to Markov and Shi has a runtime exponential in the square root of its size, or more generally exponential in the treewidth of the underlying graph. S...
Main Authors: | David Gosset, Daniel Grier, Alex Kerzner, Luke Schaeffer |
---|---|
Format: | Article |
Language: | English |
Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2024-02-01
|
Series: | Quantum |
Online Access: | https://quantum-journal.org/papers/q-2024-02-12-1251/pdf/ |
Similar Items
-
The Classification of Clifford Gates over Qubits
by: Daniel Grier, et al.
Published: (2022-06-01) -
Clifford recompilation for faster classical simulation of quantum circuits
by: Hammam Qassim, et al.
Published: (2019-08-01) -
Optimising Clifford Circuits with Quantomatic
by: Andrew Fagan, et al.
Published: (2019-01-01) -
Tunable Geometries in Sparse Clifford Circuits
by: Tomohiro Hashizume, et al.
Published: (2022-03-01) -
6-qubit optimal Clifford circuits
by: Sergey Bravyi, et al.
Published: (2022-07-01)