The note conjectures a polynomial-time recursive method for computing arbitrary local projections on 2D square-lattice cluster states, but the core 2D recursion is not proved and the numerical evidence is too small to confirm polynomial scaling.
Especially, a matrix product state (MPS) in the tool box is defined by [32] |ψM P S⟩ = 1X j1,j2,...,jN Θj1,j2,...,jN |j1,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
One Polynomial Strategy for Computing Local Projections on Square-Lattice Cluster States
The note conjectures a polynomial-time recursive method for computing arbitrary local projections on 2D square-lattice cluster states, but the core 2D recursion is not proved and the numerical evidence is too small to confirm polynomial scaling.