For graph states made of identical controlled-phase gates on |+> qubits, the Entanglement Distance per qubit equals 1 minus the average of cos(θ) to the power twice the vertex degree.
Cluster-state quantum computation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
This article is a short introduction to and review of the cluster-state model of quantum computation, in which coherent quantum information processing is accomplished via a sequence of single-qubit measurements applied to a fixed quantum state known as a cluster state. We also discuss a few novel properties of the model, including a proof that the cluster state cannot occur as the exact ground state of any naturally occurring physical system, and a proof that measurements on any quantum state which is linearly prepared in one dimension can be efficiently simulated on a classical computer, and thus are not candidates for use as a substrate for quantum computation.
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Entanglement in Directed Graph States
For graph states made of identical controlled-phase gates on |+> qubits, the Entanglement Distance per qubit equals 1 minus the average of cos(θ) to the power twice the vertex degree.