|
|
|
Preparation of digital-encoded and analog-encoded quantum states corresponding to matrix operations |
| Kaitian Gao(高凯天), Youlong Yang(杨有龙)†, and Zhenye Du(杜振叶) |
| School of Mathematics and Statistics, Xidian University, Xi'an 710126, China |
|
|
|
|
Abstract Efficient implementation of fundamental matrix operations on quantum computers, such as matrix products and Hadamard operations, holds significant potential for accelerating machine learning algorithms. A critical prerequisite for quantum implementations is the effective encoding of classical data into quantum states. We propose two quantum computing frameworks for preparing the distinct encoded states corresponding to matrix operations, including the matrix product, matrix sum, matrix Hadamard product and division. Quantum algorithms based on the digital encoding computing framework are capable of implementing the matrix Hadamard operation with a time complexity of $O({\rm poly} \log(mn/\epsilon))$ and the matrix product with a time complexity of $O({\rm poly} \log (mnl/ \epsilon))$, achieving an exponential speedup in contrast to the classical methods of $O(mn)$ and $O(mnl)$. Quantum algorithms based on the analog-encoding framework are capable of implementing the matrix Hadamard operation with a time complexity of $O(k_{1} \sqrt{mn} \cdot {\rm poly} \log(mn/\epsilon))$ and the matrix product with a time complexity of $O(k_{2} \sqrt{l} \cdot {\rm poly} \log (mnl/ \epsilon))$, where $k_{1}$ and $k_{2}$ are coefficients correlated with the elements of the matrix, achieving a square speedup in contrast to the classical counterparts. As applications, we construct an oracle that can access the trace of a matrix within logarithmic time, and propose several algorithms to respectively estimate the trace of a matrix, the trace of the product of two matrices, and the trace inner product of two matrices within logarithmic time.
|
Received: 21 April 2025
Revised: 10 June 2025
Accepted manuscript online: 12 June 2025
|
|
PACS:
|
02.70.-c
|
(Computational techniques; simulations)
|
| |
03.67.-a
|
(Quantum information)
|
| |
03.67.Ac
|
(Quantum algorithms, protocols, and simulations)
|
|
| Fund: Authors are grateful to Professor You-Long Yang for the encouragement to study quantum algorithms. Project supported by the National Natural Science Foundation of China (Grant No. 61573266), the Natural Science Basic Research Program of Shaanxi (Grant No. 2021JM-133), and the Fundamental Research Funds for the Central Universities and the Innovation Fund of Xidian University (Grant No. YJSJ25009). |
Corresponding Authors:
Youlong Yang
E-mail: ylyang@mail.xidian.edu.cn
|
Cite this article:
Kaitian Gao(高凯天), Youlong Yang(杨有龙), and Zhenye Du(杜振叶) Preparation of digital-encoded and analog-encoded quantum states corresponding to matrix operations 2026 Chin. Phys. B 35 010202
|
[1] Shor P W 1994 Proceedings 35th annual symposium on foundations of computer science (IEEE) pp. 124-134
[2] Grover L K 1996 In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing pp. 212-219
[3] Harrow A W, Hassidim A and Lloyd S 2009 Phys. Rev. Lett. 103 150502
[4] Childs A M, Kothari R and Somma R D 2017 SIAM Journal on Computing 46 1920
[5] Wossnig L, Zhao Z and Prakash A 2018 Phys. Rev. Lett. 120 050502
[6] Kerenidis I and Prakash A 2016 arXiv:1603.08675
[7] Nghiem N A and Wei T 2023 Phys. Lett. A. 488 129138
[8] Vedral V, Barenco A and Ekert A 1996 Phys. Rev. A 54 147
[9] Kotiyal S, Thapliyal H, and Ranganathan N 2014 In 2014 27th international conference on VLSI design and 2014 13rd international conference on embedded systems (IEEE) pp. 545-550
[10] Montaser R, Younes A and Abdel-Aty M 2019 Int. J. Theor. Phys. 58 167
[11] Lu X, Jiang N and Hu H 2018 Int. J. Theor. Phys 57 2575
[12] Nghiem N A, Sukeno H, Zhang S and Wei T 2025 Phys. Rev. A 111 012434
[13] Wang Q and Zhang Z 2024 Phys. Rev. A 110 012422
[14] Guo N, Mitarai K and Fujii K 2024 Phys. Rev. Res. 6 043227
[15] Nghiem N A 2024 Phys. Lett. A 514-515 129610
[16] Vittorio G, Seth L and Lotenzo M 2008 Phys. Rev. Lett. 100 160501
[17] Vittorio G, Seth L and Lotenzo M 2008 Phys. Rev. A 78 052310
[18] Koustubh P, Avimita C and Swaroop G 2023 Sensors 23 7462
[19] Mitarai K, Kitagawa M and Fujii K 2019 Phys. Rev. A 99 012301
[20] Bernasconi A, Berti A, Corso G M and Poggiali A 2024 IEEE Access 12 116274
[21] Li H, Jiang N, Wang Z, Wang J and Zhou R 2021 Int. J. Theor. Phys. 60 2037
[22] Shao C P 2018 arXiv:1803.01601v2
[23] Nghiem N A and Wei T 2023 Quantum Inf. Process 22 299
[24] Qi W, Zenchuk A I, Kumar A and Wu J 2024 Commun. Theor. Phys. 76 035103
[25] Brassard G, Hoyer P, Mosca M and Tapp A 2000 arXiv:quantph/ 0005055v1
[26] Ruiz-Perez L and Garcia-Escartin J C 2017 Sensors 16 152
[27] Wang D, Liu Z, Zhu W and Li Z 2012 Comput. Sci. 39 302
[28] Prakash A 2014 Quantum Algorithms for Linear Algebra and Machine Learning
[29] Zenchuk A I, QiW, Kumar A andWu J 2024 Quantum Inf. Comput. 24 1099
[30] Gilyen A, Su Y, Low G H and Wiebe N 2019 arXiv:1806.01838 |
| 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
|
|
|
