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
V S Manko and E Ruiz 2004 Class. Quantum Grav. 21 5849
H S Domingos 2004 J. Phys.: Condens. Matter 16 9083
T Stauber and A Mielke 2003 J. Phys. A: Math. Gen. 36 2707
M Vos et al 1999 J. Phys.: Condens. Matter 11 3645
E A Carlen et al 2009 Nonlinearity 22 2919
Stefan Schumann et al 2009 Physiol. Meas. 30 1341
Jon Links et al 2003 J. Phys. A: Math. Gen. 36 R63
A N F Aleixo and A B Balantekin 2007 J. Phys. A: Math. Theor. 40 6433
A J Macfarlane 1989 J. Phys. A: Math. Gen. 22 4581