Depth-d local encoding circuits for the rotated surface code, built from depth-2 growth steps, with a proof that any inductive construction needs depth d+O(1).
Quantum circuits for toric code and X-cube fracton model
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We propose a systematic and efficient quantum circuit composed solely of Clifford gates for simulating the ground state of the surface code model. This approach yields the ground state of the toric code in $\lceil 2L+2+log_{2}(d)+\frac{L}{2d} \rceil$ time steps, where $L$ refers to the system size and $d$ represents the maximum distance to constrain the application of the CNOT gates. Our algorithm reformulates the problem into a purely geometric one, facilitating its extension to attain the ground state of certain 3D topological phases, such as the 3D toric model in $3L+8$ steps and the X-cube fracton model in $12L+11$ steps. Furthermore, we introduce a gluing method involving measurements, enabling our technique to attain the ground state of the 2D toric code on an arbitrary planar lattice and paving the way to more intricate 3D topological phases.
citation-role summary
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Lower-depth local encoding circuits for the surface code
Depth-d local encoding circuits for the rotated surface code, built from depth-2 growth steps, with a proof that any inductive construction needs depth d+O(1).