|
|
|
Gray code based gradient-free optimization algorithm for parameterized quantum circuit |
| Anqi Zhang(张安琪)1, Chunhui Wu(武春辉)1, and Shengmei Zhao(赵生妹)1,2,† |
1 Institute of Signal Processing and Transmission, Nanjing University of Posts and Telecommunications, Nanjing 210003, China;
2 Key Laboratory of Broadband Wireless Communication and Sensor Network Technology(Ministry of Education), Nanjing University of Posts and Telecommunications, Nanjing 210003, China |
|
|
|
|
Abstract A Gray code based gradient-free optimization (GCO) algorithm is proposed to update the parameters of parameterized quantum circuits (PQCs) in this work. Each parameter of PQCs is encoded as a binary string, named as a gene, and a genetic-based method is adopted to select the offsprings. The individuals in the offspring are decoded in Gray code way to keep Hamming distance, and then are evaluated to obtain the best one with the lowest cost value in each iteration. The algorithm is performed iteratively for all parameters one by one until the cost value satisfies the stop condition or the number of iterations is reached. The GCO algorithm is demonstrated for classification tasks in Iris and MNIST datasets, and their performance are compared by those with the Bayesian optimization algorithm and binary code based optimization algorithm. The simulation results show that the GCO algorithm can reach high accuracies steadily for quantum classification tasks. Importantly, the GCO algorithm has a robust performance in the noise environment.
|
Received: 21 August 2023
Revised: 19 October 2023
Accepted manuscript online: 06 November 2023
|
|
PACS:
|
03.67.Ac
|
(Quantum algorithms, protocols, and simulations)
|
|
| Fund: This work was supported by the National Natural Science Foundation of China (Grant Nos. 61871234 and 62375140), and Postgraduate Research & Practice Innovation Program of Jiangsu Province (Grant No. KYCX19_0900). |
Corresponding Authors:
Shengmei Zhao
E-mail: zhaosm@njupt.edu.cn
|
Cite this article:
Anqi Zhang(张安琪), Chunhui Wu(武春辉), and Shengmei Zhao(赵生妹) Gray code based gradient-free optimization algorithm for parameterized quantum circuit 2024 Chin. Phys. B 33 020311
|
[1] Holmes Z, Sharma K, Cerezo M and Coles P J 2022 PRX Quantum 3 010313
[2] Bharti K, Cervera-Lierta A, Kyaw T H, Haug T, Alperin-Lea S, Anand A, Degroote M, Heimonen H, Kottmann J S, Menke T, Mok W K, Sim S, Kwek L C and Aspuru-Guzik A 2021 Rev. Mod. Phys. 94 015004
[3] Cerezo M, Poremba A, Cincio L and Coles P J 2020 Quantum 4 248
[4] Cirstoiu C, Holmes Z, Iosue J, Cincio L, Coles P J and Sornborger A 2020 npj Quantum Inf. 6 82
[5] Sharma K, Khatri S, Cerezo M and Coles P J 2020 New J. Phys. 22 043006
[6] Cerezo M, Sharma K, Arrasmith A and Coles P J 2022 npj Quantum Inf. 8 113
[7] Zhang D B, Chen B L, Yuan Z H and Yin T 2022 Chin. Phys. B 12 120301
[8] Zhang A Q, He X Y and Zhao S M 2022 Quantum Inf. Process. 21 358
[9] Zhang A Q and Zhao S M 2023 Quantum Inf. Process. 22 283
[10] Zhang A Q, Wang K L, Wu Y H and Zhao S M 2023 Chin. Phys. B 32 100308
[11] Benedetti M, Lloyd E, Sack S and Fiorentini M 2019 Quantum Sci. Technol. 4 043001
[12] Sim S, Johnson P D and Aspuru-Guzik A 2019 Adv. Quantum Technol. 2 1900070
[13] Zhu D, Linke N M, Benedetti M, Landsman K A, Nguyen N H, Alderete C H, Perdoho-Ortiz A, Korda N, Gatfoot A, Brecque C, Egan L, Predoho O and Monroe C 2019 Sci. Adv. 5 eaaw9918
[14] Sim S, Romero J, Gonthier J F and Kunitsa A A 2021 Quantum Sci. Technol. 6 025019
[15] Vidal J G, Theis D O 2018 arXiv:1812.06323 [quant-ph]
[16] Li W J, RenY H and Duan F B 2022 Chin. Phys. B 8 080503
[17] Skolik A, McClean J R, Mohseni M, Smagt P V D and Leib M 2021 Quantum Mach. Intell. 3 5
[18] Grant E, Wossnig L, Ostaszewski M and Benedetti M 2019 Quantum 3 214
[19] Zhang K N, Hsieh M H, Liu L and Tao D C 2010 arXiv:2011.06258 [quant-ph]
[20] Campos E, Nasrallah A and Biamonte J 2021 Phys. Rev. A 103 032607
[21] Iannelli G and Jansen K 2021 arXiv:2112.00426 [quant-ph]
[22] Ostaszewski M, Grant E and Benedetti M 2021 Quantum 5 391
[23] Abdul-Rahman O, Munetomo M and Akama K 2011 2011 Third World Congress on Nature and Biologically Inspired Computing, October 19-21, 2011, Salamanca, Spain, pp. 149-156
[24] Lipowski A and Lipowska D 2012 Physics A 391 2193
[25] Bergholm V, Izaac J, Schuld M et al. 2018 arXiv:1811.04968 [quant-ph]
[26] Nielsen M A and Chuang I L 2010 Quantum Computation and Quantum Information (Cambridge: Cambridge University Press)
[27] Adhikary S 2021 Quantum Inf. Process. 20 254 |
| 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
|
|
|
