Universal quantum computation can be realized entirely
via one-qubit measurements [1] on an entangled resource state, the cluster state [2]. A quantum algorithm thereby corresponds to a sequence of transformations of (multi-partite) quantum correlations. The computational model [3] has similarities to a Turing-type machine in which the read/write head is classical and corresponds to the measurement apparatus, while the tape is quantum mechanical and corresponds to the cluster state. [1] PRL 86, 5188 (2001); [2] PRL 86, 910 (2001); [3] quant-ph/0108067.
This is joint work with Robert Raussendorf.
Copyright. All Rights Reserved.