Lorentz Quantum Computer
arXiv:2103.10315 · doi:10.1088/1674-1056/acad6a
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.
References in corpus (16)
- Quantum Mechanics helps in searching for a needle in a haystack
- Pseudo-Hermiticity versus PT Symmetry: The necessary condition for the reality of the spectrum of a non-Hermitian Hamiltonian
- Pseudo-Hermiticity versus PT-Symmetry II: A complete characterizatio n of non-Hermitian Hamiltonians with a real spectrum
- Pseudo-Hermiticity versus PT-Symmetry III: Equivalence of pseudo-Her miticity and the presence of antilinear symmetries
- Quantum Search by Local Adiabatic Evolution
- Superfluidity of Bose-Einstein Condensate in An Optical Lattice: Landau-Zener Tunneling and Dynamical Instability
- Nonlinear quantum mechanics implies polynomial-time solution for NP-complete and #P problems
- How Powerful is Adiabatic Quantum Computation?
- Exact Algorithms for Maximum Independent Set
- Can closed timelike curves or nonlinear quantum mechanics improve quantum state discrimination or help solve hard problems?
- Polynomial-time solution of prime factorization and NP-hard problems with digital memcomputing machines
- Quantum Computational Complexity in the Presence of Closed Timelike Curves
- Berry Phase Effects on Dynamics of Quasiparticles in a Superfluid with a Vortex
- Directed percolation and numerical stability of simulations of digital memcomputing machines
- Quantum Algorithm for Approximating Maximum Independent Sets
- Resonant Quantum Search with Monitor Qubits