REVIEW 3 cited by
Measurement-based quantum computation with cluster states
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
read the original abstract
We give a detailed account of the one-way quantum computer, a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states. We prove its universality, describe why its underlying computational model is different from the network model of quantum computation and relate quantum algorithms to mathematical graphs. Further we investigate the scaling of required resources and give a number of examples for circuits of practical interest such as the circuit for quantum Fourier transformation and for the quantum adder. Finally, we describe computation with clusters of finite size.
Forward citations
Cited by 3 Pith papers
-
Local Equivalences of Graph States
Graph states are LU-equivalent if and only if they are linked by r-local complementations for some integer r; LU-equivalence is decidable in quasi-polynomial time, and LU=LC holds on at most 19 qubits.
-
Genuine Global Kochen-Specker Contextuality as Classical Coordination Cost
Genuine global KS contextuality is framed as the classical coordination cost needed to maintain a global noncontextual explanation from locally available information in multipartite systems.
-
Fun with Graph States: Nonlocal Bell Pairs and the Arf Invariant
Graph-state inner products are governed by the F2-rank of the adjacency matrix and the Arf invariant, yielding a nonlocal Bell-pair factorization of the Hilbert space.
Discussion (0). Sign in to comment.