REVIEW 2 cited by
Cluster-state quantum computation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original 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.
Forward citations
Cited by 2 Pith papers
-
Quantum ($t$,$n$) Threshold Multi-Secret Sharing based on Cluster States
The authors present a (t,n) threshold quantum multi-secret sharing protocol based on cluster states and Lagrange interpolation, but the security proof for dishonest reconstructors relies on an incorrect identity.
-
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.
Discussion (0). Continue with ORCID to comment.