Quantum tensor networks algorithms for evaluation of spectral functions on quantum computers

• URL: http://arxiv.org/abs/2309.15165v2
• Date: Wed, 11 Oct 2023 16:59:41 GMT
• Title: Quantum tensor networks algorithms for evaluation of spectral functions on quantum computers
• Authors: Michael L. Wall, Aidan Reilly, John S. Van Dyke, Collin Broholm, Paraj Titum
• Abstract summary: We investigate quantum algorithms derived from tensor networks to simulate the static and dynamic properties of quantum many-body systems. We demonstrate algorithms to prepare ground and excited states on a quantum computer and apply them to molecular nanomagnets (MNMs) as a paradigmatic example.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We investigate quantum algorithms derived from tensor networks to simulate the static and dynamic properties of quantum many-body systems. Using a sequentially prepared quantum circuit representation of a matrix product state (MPS) that we call a quantum tensor network (QTN), we demonstrate algorithms to prepare ground and excited states on a quantum computer and apply them to molecular nanomagnets (MNMs) as a paradigmatic example. In this setting, we develop two approaches for extracting the spectral correlation functions measured in neutron scattering experiments: (a) a generalization of the SWAP test for computing wavefunction overlaps and, (b) a generalization of the notion of matrix product operators (MPOs) to the QTN setting which generates a linear combination of unitaries. The latter method is discussed in detail for translationally invariant spin-half systems, where it is shown to reduce the qubit resource requirements compared with the SWAP method, and may be generalized to other systems. We demonstrate the versatility of our approaches by simulating spin-1/2 and spin-3/2 MNMs, with the latter being an experimentally relevant model of a Cr$^{3+}_8$ ring. Our approach has qubit requirements that are independent of the number of constituents of the many-body system and scale only logarithmically with the bond dimension of the MPS representation, making them appealing for implementation on near-term quantum hardware with mid-circuit measurement and reset.

Related papers

• Simulating NMR Spectra with a Quantum Computer [49.1574468325115]
  This paper provides a formalization of the complete procedure of the simulation of a spin system's NMR spectrum. We also explain how to diagonalize the Hamiltonian matrix with a quantum computer, thus enhancing the overall process's performance.
  arXiv  Detail & Related papers  (2024-10-28T08:43:40Z)
• Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
  We use FNOs to model the evolution of random quantum spin systems. We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
  arXiv  Detail & Related papers  (2024-09-05T07:18:09Z)
• Quantum Algorithms for Inverse Participation Ratio Estimation in multi-qubit and multi-qudit systems [0.24466725954625895]
  Inverse Participation Ratios quantify the spread of a quantum state over a selected basis of the Hilbert space. We propose three quantum algorithms to estimate IPRs on multi-qubit and multi-qudit quantum devices.
  arXiv  Detail & Related papers  (2024-05-06T10:39:03Z)
• Simulation of Entanglement Generation between Absorptive Quantum Memories [56.24769206561207]
  We use the open-source Simulator of QUantum Network Communication (SeQUeNCe), developed by our team, to simulate entanglement generation between two atomic frequency comb (AFC) absorptive quantum memories. We realize the representation of photonic quantum states within truncated Fock spaces in SeQUeNCe. We observe varying fidelity with SPDC source mean photon number, and varying entanglement generation rate with both mean photon number and memory mode number.
  arXiv  Detail & Related papers  (2022-12-17T05:51:17Z)
• Finite-size criticality in fully connected spin models on superconducting quantum hardware [0.0]
  We exploit the new resources offered by quantum algorithms to detect the quantum critical behaviour of fully connected spin$-1/2$ models. We propose a method based on variational algorithms run on superconducting transmon qubits.
  arXiv  Detail & Related papers  (2022-08-04T16:00:34Z)
• Qubit-efficient simulation of thermal states with quantum tensor networks [13.128146097939263]
  We present a holographic quantum simulation algorithm to variationally prepare thermal states of interacting quantum manybody systems. We demonstrate a small-scale proof of principle demonstration of this technique on Quantinuum's trapped-ion quantum processor.
  arXiv  Detail & Related papers  (2022-05-12T18:26:49Z)
• Quantum circuits for the preparation of spin eigenfunctions on quantum computers [63.52264764099532]
  Hamiltonian symmetries are an important instrument to classify relevant many-particle wavefunctions. This work presents quantum circuits for the exact and approximate preparation of total spin eigenfunctions on quantum computers.
  arXiv  Detail & Related papers  (2022-02-19T00:21:46Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Autoregressive Transformer Neural Network for Simulating Open Quantum Systems via a Probabilistic Formulation [5.668795025564699]
  We present an approach for tackling open quantum system dynamics. We compactly represent quantum states with autoregressive transformer neural networks. Efficient algorithms have been developed to simulate the dynamics of the Liouvillian superoperator.
  arXiv  Detail & Related papers  (2020-09-11T18:00:00Z)
• Solving Quantum Master Equations with Deep Quantum Neural Networks [0.0]
  We use deep quantum feedforward neural networks capable of universal quantum computation to represent the mixed states for open quantum many-body systems. Owning to the special structure of the quantum networks, this approach enjoys a number of notable features, including the absence of barren plateaus.
  arXiv  Detail & Related papers  (2020-08-12T18:00:08Z)
• State preparation and measurement in a quantum simulation of the O(3) sigma model [65.01359242860215]
  We show that fixed points of the non-linear O(3) sigma model can be reproduced near a quantum phase transition of a spin model with just two qubits per lattice site. We apply Trotter methods to obtain results for the complexity of adiabatic ground state preparation in both the weak-coupling and quantum-critical regimes. We present and analyze a quantum algorithm based on non-unitary randomized simulation methods.
  arXiv  Detail & Related papers  (2020-06-28T23:44:12Z)

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.