Solving the Lipkin model using quantum computers with two qubits only with a hybrid quantum-classical technique based on the generator coordinate method

被引:4
作者
Beaujeault-Taudiere, Yann [1 ,2 ]
Lacroix, Denis [1 ]
机构
[1] Univ Paris Saclay, CNRS, IJCLab, IN2P3, F-91405 91405, France
[2] Ecole Polytech, Lab Leprince Ringuet LLR, CNRS, IN2P3, F-91128 Palaiseau, France
关键词
BODY APPROXIMATION METHODS; SOLVABLE MODEL; VALIDITY; ALGORITHM;
D O I
10.1103/PhysRevC.109.024327
中图分类号
O57 [原子核物理学、高能物理学];
学科分类号
070202 ;
摘要
The possibility of using the generator coordinate method (GCM) using hybrid quantum-classical algorithms with reduced quantum resources is discussed. The task of preparing the basis states and calculating the various kernels involved in the GCM is assigned to the quantum computer, while the remaining tasks, such as finding the eigenvalues of a many-body problem, are delegated to classical computers for post-processing the generated kernels. This strategy reduces the quantum resources required to treat a quantum many-body problem. We apply the method to the Lipkin model. Using the permutation symmetry of the Hamiltonian, we show that, ultimately, only two qubits is enough to solve the problem regardless of the particle number. The classical computing postprocessing leading to the full energy spectrum can be made using standard generalized eigenvalues techniques by diagonalizing the so-called Hill-Wheeler equation. As an alternative to this technique, we also explored how the quantum state deflation method can be adapted to the GCM problem. In this method, variational principles are iteratively designed to access the different excited states with increasing energies. The methodology proposed here is successfully applied to the Lipkin model with a minimal size of two qubits for the quantum register. The performances of the two classical post-processing approaches with respect to the statistical noise induced by the finite number of measurements and quantum devices noise are analyzed. Very satisfactory results for the full energy spectra are obtained once noise corrections techniques are employed.
引用
收藏
页数:11
相关论文
共 62 条
[1]   Quantum computing with and for many-body physics [J].
Ayral, Thomas ;
Besserve, Pauline ;
Lacroix, Denis ;
Guzman, Edgar Andres Ruiz .
EUROPEAN PHYSICAL JOURNAL A, 2023, 59 (10)
[2]   NONUNITARY BOGOLIUBOV TRANSFORMATIONS AND EXTENSION OF WICKS THEOREM [J].
BALIAN, R ;
BREZIN, E .
NUOVO CIMENTO DELLA SOCIETA ITALIANA DI FISICA B-BASIC TOPICS IN PHYSICS, 1969, 64 (01) :37-+
[3]   Quantum Algorithms for Quantum Chemistry and Quantum Materials Science [J].
Bauer, Bela ;
Bravyi, Sergey ;
Motta, Mario ;
Chan, Garnet Kin-Lic .
CHEMICAL REVIEWS, 2020, 120 (22) :12685-12717
[4]   Self-consistent mean-field models for nuclear structure [J].
Bender, M ;
Heenen, PH ;
Reinhard, PG .
REVIEWS OF MODERN PHYSICS, 2003, 75 (01) :121-180
[5]   Noisy intermediate-scale quantum algorithms [J].
Bharti, Kishor ;
Cervera-Lierta, Alba ;
Kyaw, Thi Ha ;
Haug, Tobias ;
Alperin-Lea, Sumner ;
Anand, Abhinav ;
Degroote, Matthias ;
Heimonen, Hermanni ;
Kottmann, Jakob S. ;
Menke, Tim ;
Mok, Wai-Keong ;
Sim, Sukin ;
Kwek, Leong-Chuan ;
Aspuru-Guzik, Alan .
REVIEWS OF MODERN PHYSICS, 2022, 94 (01)
[6]   Iterative quantum-assisted eigensolver [J].
Bharti, Kishor ;
Haug, Tobias .
PHYSICAL REVIEW A, 2021, 104 (05)
[7]   Quantum-assisted simulator [J].
Bharti, Kishor ;
Haug, Tobias .
PHYSICAL REVIEW A, 2021, 104 (04)
[8]  
Blaizot J.-P., 1986, Quantum Theory of Finite Systems, V3
[9]   A LIMITED MEMORY ALGORITHM FOR BOUND CONSTRAINED OPTIMIZATION [J].
BYRD, RH ;
LU, PH ;
NOCEDAL, J ;
ZHU, CY .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1995, 16 (05) :1190-1208
[10]   Quantum Chemistry in the Age of Quantum Computing [J].
Cao, Yudong ;
Romero, Jonathan ;
Olson, Jonathan P. ;
Degroote, Matthias ;
Johnson, Peter D. ;
Kieferova, Maria ;
Kivlichan, Ian D. ;
Menke, Tim ;
Peropadre, Borja ;
Sawaya, Nicolas P. D. ;
Sim, Sukin ;
Veis, Libor ;
Aspuru-Guzik, Alan .
CHEMICAL REVIEWS, 2019, 119 (19) :10856-10915