| Athens/Institutional login |
Previous article |
| 
| 
|
|
|
|
|||
| Journals Home | Journals List | EJs Extra | This Journal | Search | Authors | Referees | Librarians | User Options | Help | | ||||
|
||||
|
Previous article |
| | |
|
||||
FAST TRACK COMMUNICATION
2007 J. Phys. A: Math. Theor. 40 F259-F266 doi: 10.1088/1751-8113/40/13/F01
 |
 |
 |
||
|
||||
 |
|
 |
Abstract. 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 numbers: 03.67.−a, 89.70.+c, 11.30.Pb
Print publication: Issue 13 (30 March 2007) |
Post to CiteUlike | | Post to Connotea | | Post to Bibsonomy |
|
|
|
Previous article |
| | |
|
|
|
|
|
|
Journals Home | Journals List | EJs Extra | This Journal | Search | Authors | Referees | Librarians | User Options | Help | Recommend this journal EndNote, ProCite ® and Reference Manager ® are registered trademarks of ISI Researchsoft. Copyright © Institute of Physics and IOP Publishing Limited 2009. Use of this service is subject to compliance with the terms and conditions of use. In particular, reselling and systematic downloading of files is prohibited. Help: Cookies | Data Protection. |
|
| |
