The computational power of the W and GHZ states

Quantum Information and Computation

Volumn 6, Issue 2, 2006, Pages 173-183

  D'Hondt, Ellie ^a   Panangaden, Prakash ^b  

^a VRIJE UNIVERSITEIT BRUSSEL   (Belgium)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

Computation; Distributed algorithms; Entangled states; GHZ state; Leader election; Quantum; W state

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; PROBLEM SOLVING;

BELL STATE; COMPUTATIONAL POWER; ENTANGLED STATE; GENERALISATION; GHZ-STATE; LEADER ELECTION; PURE STATE; QUANTUM; QUANTUM NETWORK; W STATE;

QUANTUM ENTANGLEMENT;

EID: 33645769052     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: 10.26421/qic6.2-3     Document Type: Article

References (14)

1. M.A. Nielsen and I. Chuang (2000), Quantum computation and quantum information, Cambridge University Press.
2. N.A. Lynch (1996), Distributed algorithms, Morgan Kaufman Publishers.
3. G. Tel (1994), Introduction to Distributed Algorithms, Cambridge University Press.
4. G. LeLann (1977), Distributed systems, towards a formal approach, Inf. Proc. Lett., 77, pp.155-160.
5. D. Angluin (1980), Local and global properties in networks of processors, Proc. of the 12th annual ACM Symposium on Theory of Computing, pp 82-93, ACM Press.
6. A. Itai and M. Rodeh (1990), Symmetry breaking in distributed networks, Inf. Comput., 88(1), pp 60-87.
7. S. Tani, H. Kobayashi, and K. Matsumoto (2005), Exact quantum algorithms for the leader election problem, Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS05), LNCS Vol. 3404.
8. S.P. Pal, S.K. Singh, and S. Kumar (2003), Multi-partite quantum entanglement versus randomization: fair and unbiased leader election in networks, quant-ph/0306195.
9. M.J. Fischer, N.A. Lynch, and M.S. Paterson (1985), Impossibility of distributed consensus with one faulty process, J. ACM, 32(2), pp 374-382.
10. C.H. Bennett, S. Popescu, D. Rohrlich, J.A. Smolin, and A.V. Thapliyal (2001), Exact and asymptotic measures of multipartite pure-state entanglement, Phys. Rev. A, 63:012307.
11. W. Dür, G. Vidai, and I. Cirac (2000), Three qubits can be entangled in two inequivalent ways, Phys. Rev. A, 62(6).
12. H.J. Briegel and R. Raussendorf (2001), Persistent entanglement in arrays of interacting particles, Phys. Rev. Lett., 86(5):910-13.
13. C. Palamidessi (2003), Comparing the expressive power of the synchronous and the asynchronous pi-calculus. Math. Struct. Comp. Sc., 13(5), pp 685-719.
14. R. Raussendorf and H.J. Briegel (2001), A one-way quantum computer, Phys. Rev. Lett., 86(22):5188-5191.