Simulating excited states of the Lipkin model on a quantum computer

• URL: http://arxiv.org/abs/2203.01478v3
• Date: Wed, 27 Jul 2022 22:45:13 GMT
• Title: Simulating excited states of the Lipkin model on a quantum computer
• Authors: Manqoba Q. Hlatshwayo, Yinu Zhang, Herlik Wibowo, Ryan LaRose, Denis Lacroix, Elena Litvinova
• Abstract summary: We show that the accuracy strongly depends on the fermion to qubit encoding. We use IBM quantum machines to compute the energy spectrum for a system of $N=2, 3$ and $4$ particles.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We simulate the excited states of the Lipkin model using the recently proposed Quantum Equation of Motion (qEOM) method. The qEOM generalizes the EOM on classical computers and gives access to collective excitations based on quasi-boson operators $\hat{O}^\dagger_n(\alpha)$ of increasing configuration complexity $\alpha$. We show, in particular, that the accuracy strongly depends on the fermion to qubit encoding. Standard encoding leads to large errors, but the use of symmetries and the Gray code reduces the quantum resources and improves significantly the results on current noisy quantum devices. With this encoding scheme, we use IBM quantum machines to compute the energy spectrum for a system of $N=2, 3$ and $4$ particles and compare the accuracy against the exact solution. We found that the results of the approach with $\alpha = 2$, an analog of the second random phase approximation (SRPA), are, in principle, more accurate than with $\alpha = 1$, which corresponds to the random phase approximation (RPA), but the SRPA is more amenable to noise for large coupling strengths. Thus, the proposed scheme shows potential for achieving higher spectroscopic accuracy by implementations with higher configuration complexity, if a proper error mitigation method is applied.

Related papers

• Hybrid Oscillator-Qubit Quantum Processors: Simulating Fermions, Bosons, and Gauge Fields [31.51988323782987]
  We develop a hybrid oscillator-qubit processor framework for quantum simulation of strongly correlated fermions and bosons. This framework gives exact decompositions of particle interactions as well as approximate methods based on the Baker-Campbell Hausdorff formulas. While our work focusses on an implementation in superconducting hardware, our framework can also be used in trapped ion, and neutral atom hardware.
  arXiv  Detail & Related papers  (2024-09-05T17:58:20Z)
• Spin coupling is all you need: Encoding strong electron correlation on quantum computers [0.0]
  We show that quantum computers can efficiently simulate strongly correlated molecular systems by directly encoding the dominant entanglement structure in the form of spin-coupled initial states. Our work paves the way towards scalable quantum simulation of electronic structure for classically challenging systems.
  arXiv  Detail & Related papers  (2024-04-29T17:14:21Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Efficient Quantum Simulation of Electron-Phonon Systems by Variational Basis State Encoder [12.497706003633391]
  Digital quantum simulation of electron-phonon systems requires truncating infinite phonon levels into $N$ basis states. We propose a variational basis state encoding algorithm that reduces the scaling of the number of qubits and quantum gates.
  arXiv  Detail & Related papers  (2023-01-04T04:23:53Z)
• A single $T$-gate makes distribution learning hard [56.045224655472865]
  This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits. We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
  arXiv  Detail & Related papers  (2022-07-07T08:04:15Z)
• Calibrating the Classical Hardness of the Quantum Approximate Optimization Algorithm [0.0]
  Trading fidelity for scale enables approximate classical simulators to run quantum circuits beyond exact methods. We characterize the fidelity for the quantum approximate optimization algorithm by the expectation value of the cost function it seeks to minimize. We benchmark the performance of quantum hardware in a realistic setup.
  arXiv  Detail & Related papers  (2022-06-13T17:45:59Z)
• Phenomenological Theory of Variational Quantum Ground-State Preparation [0.0]
  The variational quantum eigensolver (VQE) algorithm aims to prepare the ground state of a Hamiltonian exploiting parametrized quantum circuits. We show that the algorithm's success crucially depends on other parameters such as the learning rate. We propose a symmetry-enhanced simulation protocol that should be used if the gap closes.
  arXiv  Detail & Related papers  (2022-05-12T18:00:04Z)
• Average-case Speedup for Product Formulas [69.68937033275746]
  Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states. Our results open doors to the study of quantum algorithms in the average case.
  arXiv  Detail & Related papers  (2021-11-09T18:49:48Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Quantum Approximate Optimization Algorithm Based Maximum Likelihood Detection [80.28858481461418]
  Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices. Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices.
  arXiv  Detail & Related papers  (2021-07-11T10:56:24Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.