A polynomial-time approximate simulation of Clifford circuits with small sparse Markovian errors, including coherent errors, demonstrated on circuits with up to 241 qubits.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Efficient simulation of Clifford circuits with small Markovian errors
A polynomial-time approximate simulation of Clifford circuits with small sparse Markovian errors, including coherent errors, demonstrated on circuits with up to 241 qubits.