An improved formalism for quantum computation based on geometric algebra -- case study: Grover's search algorithm
From MaRDI portal
Publication:352989
DOI10.1007/S11128-012-0483-7zbMATH Open1267.81112OpenAlexW2152390582WikidataQ62044577 ScholiaQ62044577MaRDI QIDQ352989FDOQ352989
M. A. Lohe, James M. Chappell, Derek Abbott, Azhar Iqbal, Lorenz von Smekal
Publication date: 5 July 2013
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-012-0483-7
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algebraic analysis of quantum search with pure and mixed states
- Clifford algebra to geometric calculus. A unified language for mathematics and physics
- Expressing the operations of quantum computing in multiparticle geometric algebra.
- Phase matching in quantum searching.
- Quantum gates and quantum algorithms with Clifford algebra technique
- An SO(3) picture for quantum searching.
- Cartoon computation: quantum-like computing without quantum mechanics
- Teleportation of geometric structures in 3D
- Fixed-Point Quantum Search
- Group Theoretical Formulation of a Quantum Partial Search Algorithm
- Clifford algebra applied to Grover's algorithm
Cited In (4)
This page was built for publication: An improved formalism for quantum computation based on geometric algebra -- case study: Grover's search algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q352989)
