Lorentz Quantum Computer
Wenhao He, Zhenduo Wang, Biao Wu
TL;DR
This paper introduces a Lorentz quantum computer model incorporating hyperbolic bits, constructs universal gates, and demonstrates an exponentially faster search algorithm compared to Grover's algorithm.
Contribution
It proposes a novel quantum computation model based on Lorentz mechanics with hyperbolic bits and develops a faster search algorithm.
Findings
Universal logical gates for the model are constructed.
The search algorithm outperforms Grover's algorithm exponentially.
The model extends quantum computation with new physical principles.
Abstract
A theoretical model of computation is proposed based on Lorentz quantum mechanics. Besides the standard qubits, this model has an additional bit, which we call hyperbolic bit (or hybit in short). A set of basic logical gates are constructed and their universality is proved. As an application, a search algorithm is designed for this computer model and is found to be exponentially faster than the Grover's search algorithm.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Mechanics and Applications · Computability, Logic, AI Algorithms