Universal quantum computation with unlabelled qubits

Journal of Physics A: Mathematical and General

Volumn 39, Issue 26, 2006, Pages 8507-8513

  Severini, Simone ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33745310212     PISSN: 03054470     EISSN: 13616447     Source Type: Journal    
DOI: 10.1088/0305-4470/39/26/016     Document Type: Article

References (11)

1. Aharonov D 2003 Simple proof that Toffoli and Hadamard are quantum universal Preprint quant-ph/0301040
2. Ambainis A 2004 Quantum walks and their algorithmic applications Preprint quant-ph/0403120
3. Deutsch D 1989 Quantum computational networks Proc. R. Soc. A 425 73-90
4. Gudder S 1999 Quantum automata: an overview Int. J. Theor. Phys. 38 2261-82
5. Heydemann M-C 1997 Cayley graphs and interconnection networks Graph Symmetry (Montreal, PQ, 1996) (NATO Adv. Sci. Inst. Ser. C: Math. Phys. Sci. vol 497) (Dordrecht: Kluwer) pp 167-224
6. Koík J 2005 Scattering quantum random walk Opt. Spectrosc. 99 224-6
7. Moore C and Crutchfield J P 2000 Quantum automata and quantum grammars Theor. Comput. Sci. 237 275-306
8. Mukherjee B 1997 Optical Communication Networks (Series on Computer Communications) (New York: McGraw-Hill)
9. Shi Y 2002 Both Toffoli and controlled-Not need little help to do universal quantum computation Preprint quant-ph/0205115
10. Sloane N J A 2005 The on-line encyclopedia of integer sequences www.research.att.com/njas/sequences/
11. Tanner G 2000 Spectral statistics for unitary transfer matrices of binary graphs J. Phys. A: Math. Gen. 33 3567-85