Quick search Find article
Quick search
Find article

Cartoon computation: quantum-like computing without quantum mechanics

FREE ARTICLE

Diederik Aerts1 and Marek Czachor2

Show affiliations


FAST TRACK COMMUNICATION

We 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.


PACS

03.67.Lx Quantum computation architectures and implementations

02.70.Wz Symbolic computation (computer algebra)

02.40.Gh Noncommutative geometry

MSC

81P68 Quantum computation and quantum cryptography (See also 68Q05, 94A60)

81R60 Noncommutative geometry

Subjects

Mathematical physics

Computational physics

Quantum information and quantum mechanics

Dates

Issue 13 (30 March 2007)

Received 9 February 2007

Published 14 March 2007



View by subject




Export








Please login to access our web services, or create an account if you don't yet have one.

You must have cookies enabled in your web browser to be able to login.

Username
Password

Forgotten your password? Get a new one here.