Cartoon computation: quantum-like computing without quantum mechanics
From MaRDI portal
Publication:3431673
DOI10.1088/1751-8113/40/13/F01zbMath1114.81019arXivquant-ph/0611279WikidataQ58147427 ScholiaQ58147427MaRDI QIDQ3431673
Publication date: 12 April 2007
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0611279
Related Items (7)
A loophole of all `loophole-free' Bell-type theorems ⋮ An improved formalism for quantum computation based on geometric algebra -- case study: Grover's search algorithm ⋮ A geometric algebra perspective on quantum computational gates and universality in quantum computing ⋮ Solovay-Kitaev approximations of special orthogonal matrices ⋮ Kravchuk matrices and induced operators on Clifford algebras ⋮ Geometric analogue of holographic reduced representation ⋮ OPERATOR CALCULUS AND INVERTIBLE CLIFFORD APPELL SYSTEMS: THEORY AND APPLICATION TO THE n-PARTICLE FERMION ALGEBRA
This page was built for publication: Cartoon computation: quantum-like computing without quantum mechanics
