Diederik Aerts and Marek Czachor 2007 J. Phys. A: Math. Theor. 40 F259 doi:10.1088/1751-8113/40/13/F01
Diederik Aerts1 and Marek Czachor2
Show affiliationsWe present a computational framework based on geometric structures. No quantum mechanics is involved, and yet the algorithms perform tasks analogous to quantum computation. Tensor products and entangled states are not needed—they are replaced by sets of basic shapes. To test the formalism we solve in geometric terms the Deutsch–Jozsa problem, historically the first example that demonstrated the potential power of quantum computation. Each step of the algorithm has a clear geometric interpretation and allows for a cartoon representation.
03.67.Lx Quantum computation architectures and implementations
81P68 Quantum computation and quantum cryptography (See also 68Q05, 94A60)
Issue 13 (30 March 2007)
Received 9 February 2007
Published 14 March 2007
Diederik Aerts and Marek Czachor 2007 J. Phys. A: Math. Theor. 40 F259
Victor Tapia 2007 J. Phys. A: Math. Theor. 40 5525
I M Benn and Jonathan Kress 1996 J. Phys. A: Math. Gen. 29 6295
Aneta Siemiginowska et al. 1998 ApJ 503 118
Noam Soker 2002 ApJ 568 726
Shlomo Dado et al. 2008 ApJ 680 517
E K Loginov 2004 J. Phys. A: Math. Gen. 37 6599
I S Tereshina et al 2001 J. Phys.: Condens. Matter 13 8161
P Bolognesi et al 2003 J. Phys. B: At. Mol. Opt. Phys. 36 L241
Jinwu Ye 2004 J. Phys.: Condens. Matter 16 4465