Recognition: unknown
On measurement-based quantum computation with the toric code states
classification
🪐 quant-ph
keywords
codeplanarquantumcomputationlatticemeasurement-basedstatetoric
read the original abstract
We study measurement-based quantum computation (MQC) using as quantum resource the planar code state on a two-dimensional square lattice (planar analogue of the toric code). It is shown that MQC with the planar code state can be efficiently simulated on a classical computer if at each step of MQC the sets of measured and unmeasured qubits correspond to connected subsets of the lattice.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
The Structure of Circle Graph States
Circle graphs are closed under r-local complementation and bipartite circle graph states correspond one-to-one with planar code states whose MBQC is classically simulable.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.