中文

Journal of Shanghai University >

2022 , Vol. 28 >Issue 5: 883 - 895

DOI: https://doi.org/10.12066/j.issn.1007-2861.2436

Digital counter-diabatic driving quantum algorithm

Expand
  • College of Sciences, Shanghai University, Shanghai 200444, China

Received date: 2022-06-18

  Online published: 2022-11-12

Fold

Abstract

Quantum computing differs significantly from traditional computers, and is far superior in terms of computing speed and energy consumption. Quantum computing is therefore considered to be one of the new methods with disruptive effects in the future. Currently, quantum adiabatic algorithms, variational quantum eigensolvers (VQEs), and quantum approximate optimization algorithms (QAOAs) are important algorithms that are expected to achieve quantum advantages in the current noisy medium-scale quantum era. In this paper, the calculation of the ground state energy of hydrogen gas is considered as an example to demonstrate the application of the quantum adiabatic algorithm and variational quantum eigensolver in quantum chemistry. The quantum adiabatic algorithm is accelerated using the digital counter-diabatic driving algorithm, and the optimal solution is realized using the variational quantum eigensolver. This helps to reduce the depth of the quantum circuit and improve the accuracy of energy calculation. With this development, the digital counter-diabatic driving quantum algorithm will be extended to the applications in data search, material design, biopharmaceuticals, and so on, demonstrating the advantages in quantum applicability.

Key words： quantum adiabatic algorithm; variational quantum eigensolver (VQE); counter- diabatic driving; quantum chemistry

Cite this article

WANG Jianan, DING Yongcheng, HAO Minjia, CHEN Xi . Digital counter-diabatic driving quantum algorithm[J]. Journal of Shanghai University, 2022 , 28(5) : 883 -895 . DOI: 10.12066/j.issn.1007-2861.2436

References

[1] 郭国平, 陈昭昀, 郭光灿. 量子计算与编程入门[M]. 北京: 科学出版社, 2020.
[2] Arute F, Arya K, Babbush R, et al. Quantum supremacy using a programmable superconducting processor[J]. Nature, 2019, 574(7779): 505-510.
[3] Zhong H S, Wang H, Deng Y H, et al. Quantum computational advantage using photons[J]. Science, 2020, 370(6523): 1460-1463.
[4] Feynman R P. Simulating physics with computers[J]. Int J Theor Phys, 1982, 21: 467-488.
[5] Shor P W. Algorithms for quantum computation: discrete logarithms and factoring[C]// Proceedings 35th Annual Symposium on Foundations of Computer Science. 1994: 124-134.
[6] Shor P W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer[J]. SIAM Rev, 1999, 41(2): 303-332.
[7] Grover L K. A fast quantum mechanical algorithm for database search[C]// Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing. 1996: 212-219.
[8] Das A, Chakrabarti B K. Colloquium: quantum annealing and analog quantum comput- ation[J]. Rev Mod Phys, 2008, 80(3): 1061.
[9] Johnson M W, Amin M H, Gildert S, et al. Quantum annealing with manufactured spins[J]. Nature, 2011, 473(7346): 194-198.
[10] Preskill J. Quantum computing in the NISQ era and beyond[J]. Quantum, 2018, 2: 79.
[11] Cerezo M, Arrasmith A, Babbush R, et al. Variational quantum algorithms[J]. Nat Rev Phys, 2021, 3(9): 625-644.
[12] Kumar S, Singh R P, Behera B K, et al. Quantum simulation of negative hydrogen ion using variational quantum eigensolver on IBM quantum computer[DB/OL]. arXiv [2022-06-29]. https://xueshu.baidu.com/usercenter/paper/show?paperid=100v0vb04u4x0p601h6h0rq04j090307&site=xueshu_se.
[13] Peruzzo A, Mcclean J, Shadbolt P, et al. A variational eigenvalue solver on a photonic quantum processor[J]. Nat Commun, 2014, 5(1): 1-7.
[14] Cao C, Hu J, Zhang W, et al. Towards a larger molecular simulation on the quantum computer: up to 28 qubits systems accelerated by point group symmetry[DB/OL]. arXiv [2022-05-19]. https://xueshu.baidu.com/usercenter/paper/show?paperid=1q0b0ac0k72f0mc0t06702w0pr278803&site=xueshu_se.
[15] Kandala A, Mezzacapo A, Temme K, et al. Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets[J]. Nature, 2017, 549(7671): 242-246.
[16] Arute F, Arya K, Babbush R, et al. Hartree-fock on a superconducting qubit quantum computer[J]. Science, 2020, 369(6507): 1084-1089.
[17] Farhi E, Goldstone J, Gutmann S. A quantum approximate optimization algorithm[DB/OL]. arXiv [2022-07-20]. https://xueshu.baidu.com/usercenter/paper/show?paperid=6f7745656a4bed49da43610e3f04fb0e.
[18] Chai Y, Han Y J, Wu Y C, et al. Shortcuts to the quantum approximate optimization algorithm[J]. Phys Rev A, 2022, 105(4): 042415.
[19] Hegade N N, Paul K, Albarran-Arriagada F, et al. Digitized adiabatic quantum factorization[J]. Phys Rev A, 2021, 104(5): 050403.
[20] Hegade N N, Chandarana P, Paul K, et al. Portfolio optimization with digitized- counterdiabatic quantum algorithms[DB/OL]. arXiv [2022-06-22]. https://xueshu.baidu.com/usercenter/paper/show?paperid=1s4u0v90vx6m0tj06w0m08500y783751&site=xueshu_se.
[21] Chandarana P, Hegade N N, Paul K, et al. Digitized-counterdiabatic quantum approximate optimization algorithm[J]. Phys Rev Research, 2022, 4(1): 013141.
[22] Resch S. Introductory tutorial for SPSA and the quantum approximation optimization algorithm[DB/OL]. arXiv [2022-05-28]. https://xueshu.baidu.com/usercenter/paper/show?paperid=1j5m0050wt230x40xw4702f04h659767&site=xueshu_se.
[23] Guerreschi G G, Matsuura A Y. Qaoa for max-cut requires hundreds of qubits for quantum speed-up[J]. Sci Rep, 2019, 9(1): 1-7.
[24] Arrasmith A, Cerezo M, Czarnik P, et al. Effect of barren plateaus on gradient-free optimization[J]. Quantum, 2021, 5: 558.
[25] Chen X, Ruschhaupt A, Schmidt S, et al. Fast optimal frictionless atom cooling in harmonic traps: shortcut to adiabaticity[J]. Phys Rev Lett, 2010, 104(6): 063002.
[26] Torrontegui E, Ibanez S, MartíNez-Garaot S, et al. Shortcuts to adiabaticity[J]. Adv At Mol Opt Phys, 2013, 62: 117-169.
[27] Guery-Odelin D, Ruschhaupt A, Kiely A, et al. Shortcuts to adiabaticity: concepts, methods, and applications[J]. Rev Mod Phys, 2019, 91(4): 045001.
[28] Li J, Sun K, Chen X. Shortcut to adiabatic control of soliton matter waves by tunable interaction[J]. Sci Rep, 2016, 6(1): 1-7.
[29] Claeys P W, Pandey M, Sels D, et al. Floquet-engineering counterdiabatic protocols in quantum many-body systems[J]. Phys Rev Lett, 2019, 123(9): 090602.
[30] Sels D, Polkovnikov A. Minimizing irreversible losses in quantum systems by local counterdiabatic driving[J]. Proc Natl Acad Sci, 2017, 114(20): E3909-E3916.
[31] Berry M V. Transitionless quantum driving[J]. J Phys A: Math Theor, 2009, 42(36): 365303.
[32] Chen X, Lizuain I, Ruschhaupt A, et al. Shortcut to adiabatic passage in two-and three-level atoms[J]. Phys Rev Lett, 2010, 105(12): 123003.
[33] Novicenko V, Anisimovas E, Juzeli-Unas G. Floquet analysis of a quantum system with modulated periodic driving[J]. Phys Rev A, 2017, 95(2): 023615.
[34] Boyers E, Pandey M, Campbell D K, et al. Floquet-engineered quantum state manipulation in a noisy qubit[J]. Phys Rev A, 2019, 100(1): 012341.
[35] Takahashi K. Shortcuts to adiabaticity for quantum annealing[J]. Phys Rev A, 2017, 95(1): 012309.
[36] Takahashi K. Hamiltonian engineering for adiabatic quantum computation: lessons from shortcuts to adiabaticity[J]. J Phys Soc Japan, 2019, 88(6): 061002.
[37] Hatomura T, Mori T. Shortcuts to adiabatic classical spin dynamics mimicking quantum annealing[J]. Phys Rev E, 2018, 98(3): 032136.
[38] Hatomura T. Shortcuts to adiabaticity in the infinite-range Ising model by mean-field counterdiabatic driving[J]. J Phys Soc Japan, 2017, 86(9): 094002.
[39] Barends R, Shabani A, Lamata L, et al. Digitized adiabatic quantum computing with a superconducting circuit[J]. Nature, 2016, 534(7606): 222-226.
[40] Hegade N N, Paul K, Ding Y, et al. Shortcuts to adiabaticity in digitized adiabatic quantum computing[J]. Phys Rev Applied, 2021, 15(2): 024038.
[41] Hegade N N, Chen X, Solano E. Digitized-counterdiabatic quantum optimization[DB/OL]. [2022-07-09]. https://xueshu.baidu.com/usercenter/paper/show?paperid=1t0m08h0637q0e60ct2v0a2025327591.
[42] Zhan Z, Run C, Zong Z, et al. Experimental determination of electronic states via digitized shortcut to adiabaticity and sequential digitized adiabaticity[J]. Phys Rev Applied, 2021, 16(3): 034050.
[43] Yao J, Lin L, Bukov M. Reinforcement learning for many-body ground-state preparation inspired by counterdiabatic driving[J]. Phys Rev X, 2021, 11(3): 031070.
[44] Wurtz J, Love P J. Counterdiabaticity and the quantum approximate optimization algorithm[J]. Quantum, 2022, 6: 635.
[45] Szabo A, Ostlund N S. Modern quantum chemistry: introduction to advanced electronic structure theory[M]. Chelmsford, Massachusetts: Courier Corporation, 2012.
[46] Bravyi S B, Kitaev A Y. Fermionic quantum computation[J]. Ann Phys, 2002, 298(1): 210-226.
[47] Derby C, Klassen J, Bausch J, et al. Compact fermion to qubit mappings[J]. Phys Rev B, 2021, 104(3): 035118.
[48] Batista C, Ortiz G. Generalized jordan-wigner transformations[J]. Phys Rev Lett, 2001, 86(6): 1082.
[49] Setia K, Whitfield J D. Bravyi-Kitaev superfast simulation of electronic structure on a quantum computer[J]. Chem Phys, 2018, 148(16): 164104.
[50] Tranter A, Love P J, Mintert F, et al. A comparison of the Bravyi-Kitaev and Jordan-Wigner transformations for the quantum simulation of quantum chemistry[J]. J Chem Theory Comput, 2018 13/14(11): 5617-5630.
[51] Kalman R E. Contributions to the theory of optimal control[J]. Bol Soc Mat Mexicana, 1960, 5(2): 102-119.
[52] Suzuki M. Generalized Trotter's formula and systematic approximants of exponential operators and inner derivations with applications to many-body problems[J]. Commun Math Phys, 1976, 51(2): 183-190.
[53] Cao Y, Romero J, Olson J P, et al. Quantum chemistry in the age of quantum computing[J]. Chemical Reviews, 2019, 119(19): 10856-10915.
[54] Clinton L, Cubitt T, Flynn B, et al. Towards near-term quantum simulation of materials[DB/OL]. arXiv [2022-07-15]. https://inspirehep.net/literature/2089332.
Options
Outlines

/

〈 〉