|
|
Lorentz quantum computer |
Wenhao He(何文昊)1, Zhenduo Wang(王朕铎)1, and Biao Wu(吴飙)1,2,3,† |
1 International Center for Quantum Materials, School of Physics, Peking University, Beijing 100871, China; 2 Wilczek Quantum Center, School of Physics and Astronomy, Shanghai Jiao Tong University, Shanghai 200240, China; 3 Collaborative Innovation Center of Quantum Matter, Beijing 100871, China |
|
|
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 Grover's search algorithm.
|
Received: 15 August 2022
Revised: 28 November 2022
Accepted manuscript online: 21 December 2022
|
PACS:
|
03.67.Ac
|
(Quantum algorithms, protocols, and simulations)
|
|
03.67.Lx
|
(Quantum computation architectures and implementations)
|
|
89.70.Eg
|
(Computational complexity)
|
|
Fund: We thank Qi Zhang for helpful discussion. We are supported by the National Key R&D Program of China (Grant Nos. 2017YFA0303302 and 2018YFA0305602), the National Natural Science Foundation of China (Grant No. 11921005), and Shanghai Municipal Science and Technology Major Project (Grant No. 2019SHZDZX01). |
Corresponding Authors:
Biao Wu
E-mail: wubiao@pku.edu.cn
|
Cite this article:
Wenhao He(何文昊), Zhenduo Wang(王朕铎), and Biao Wu(吴飙) Lorentz quantum computer 2023 Chin. Phys. B 32 040304
|
[1] Deutsch D 1997 Fabric Of Reality (New York: Penguin Books) [2] Wu B 2022 Frank Wilczek - 50 Years of Theoretical Physics Ed. Niemi A, Kphua K K and Shapere A (World Scientific) pp. 281-290 [3] Zhang Q and Wu B 2018 New J. Phys. 20 013024 [4] Pauli W 1943 Rev. Mod. Phys. 15 175 [5] Grover L K 1997 Phys. Rev. Lett. 79 325 [6] Li Q, Zhang C J, Cheng Z D, Liu W Z, Wang J F, Yan F F, Lin Z H, Xiao Y, Sun K, Wang Y T, Tang J S, Xu J S, Li C F and Guo G C 2019 Optica 6 67 [7] Wu B and Niu Q 2003 New J. Phys. 5 104 [8] Zhang C, Dudarev A M and Niu Q 2006 Phys. Rev. Lett. 97 040401 [9] Bognar J 1974 Indefinite inner product space (New York: Springer-Verlag) [10] Mostafazadeh A 2002 Journal of Mathematical Physics 43 205 [11] Mostafazadeh A 2002 Journal of Mathematical Physics 43 2814 [12] Mostafazadeh A 2002 Journal of Mathematical Physics 43 3944 [13] Pethick C J and Smith H 2002 Bose-Einstein condensation in dilute gases (Cambridge: Cambridge University Press) [14] DiVincenzo D P 2000 Fortschritte der Physik Progress of Physics 48 771 [15] Nielson M A and Chuang I L 2000 Quantum computing and quantum information (Cambridge: Cambridge University Press) [16] Farhi E and Gutmann S 1998 Phys. Rev. A 57 2403 [17] van Dam W, Mosca M and Vazirani U 2001 Proceedings 42nd IEEE Symposium on Foundations of Computer Science, Newport Beach, CA, USA, pp. 279–287 [18] Roland J and Cerf N J 2002 Phys. Rev. A 65 042308) [19] Wilczek F, Hu H Y and Wu B 2020 Chin. Phys. Lett. 37 050304 [20] Karp R M 1972 Reducibility among Combinatorial Problems (Boston, MA: Springer US) pp. 85-103 [21] Xiao M and Nagamochi H 2017 Information and Computation 255 126 [22] Yu H, Wilczek F and Wu B 2021 Chin. Phys. Lett. 38 030304 [23] Aaronson S 2005 Proceedings of the Royal Society A 461 3473 [24] Traversa F L and Di Ventra M 2017 Chaos 27 023107 [25] Zhang Y H and Ventra M D 2021 Chaos 31 063127 [26] Bacon D 2004 Phys. Rev. A 70 032309 [27] Abrams D S and Lloyd S 1998 Phys. Rev. Lett. 81 3992 [28] Bennett C H, Leung D, Smith G and Smolin J A 2009 Phys. Rev. Lett. 103 170502 [29] Boykin P O, Mor T, Pulver M, Roychowdhury V and Vatan F 1999 40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039) (IEEE) pp. 486-494 [30] Dummit D S and Foote R M 2004 Abstract Algebra vol. 3 (Wiley Hoboken) |
No Suggested Reading articles found! |
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
Altmetric
|
blogs
Facebook pages
Wikipedia page
Google+ users
|
Online attention
Altmetric calculates a score based on the online attention an article receives. Each coloured thread in the circle represents a different type of online attention. The number in the centre is the Altmetric score. Social media and mainstream news media are the main sources that calculate the score. Reference managers such as Mendeley are also tracked but do not contribute to the score. Older articles often score higher because they have had more time to get noticed. To account for this, Altmetric has included the context data for other articles of a similar age.
View more on Altmetrics
|
|
|