Integrating discretized von Neumann measurement Protocols with pre-trained matrix product states

• URL: http://arxiv.org/abs/2407.19348v1
• Date: Sat, 27 Jul 2024 22:39:47 GMT
• Title: Integrating discretized von Neumann measurement Protocols with pre-trained matrix product states
• Authors: Younes Javanmard,
• Abstract summary: We present a quantum algorithm for simulating complex many-body systems and finding their ground states. The algorithm is based on von Neumann's measurement prescription, which serves as a conceptual building block for quantum phase estimation. We highlight the potential applications of the algorithm in simulating quantum spin systems and electronic structure problems.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a quantum algorithm for simulating complex many-body systems and finding their ground states, combining the use of tensor networks and density matrix renormalization group (DMRG) techniques. The algorithm is based on von Neumann's measurement prescription, which serves as a conceptual building block for quantum phase estimation. We describe the implementation and simulation of the algorithm, including the estimation of resources required and the use of matrix product operators (MPOs) to represent the Hamiltonian. We highlight the potential applications of the algorithm in simulating quantum spin systems and electronic structure problems.

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)
• Quantum tensor networks algorithms for evaluation of spectral functions on quantum computers [0.0]
  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.
  arXiv  Detail & Related papers  (2023-09-26T18:01:42Z)
• A hybrid quantum-classical algorithm for multichannel quantum scattering of atoms and molecules [62.997667081978825]
  We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions. The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix. We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
  arXiv  Detail & Related papers  (2023-04-12T18:10:47Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Randomizing multi-product formulas for Hamiltonian simulation [2.2049183478692584]
  We introduce a scheme for quantum simulation that unites the advantages of randomized compiling on the one hand and higher-order multi-product formulas on the other. Our framework reduces the circuit depth by circumventing the need for oblivious amplitude amplification. Our algorithms achieve a simulation error that shrinks exponentially with the circuit depth.
  arXiv  Detail & Related papers  (2021-01-19T19:00:23Z)
• Algorithmic Primitives for Quantum-Assisted Quantum Control [1.52292571922932]
  We discuss two primitive algorithms to evaluate overlaps and transition matrix time series. They are used to construct a variety of quantum-assisted quantum control algorithms implementable on NISQ devices.
  arXiv  Detail & Related papers  (2020-11-27T15:20:29Z)
• 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)
• 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)
• Quantum Algorithms for Estimating Physical Quantities using Block-Encodings [0.30458514384586405]
  We present quantum algorithms for the estimation of n-time correlation functions, the local and non-local density of states, and dynamical linear response functions. All algorithms are based on block-encodings - a technique for the manipulation of arbitrary non-unitary combinations on a quantum computer.
  arXiv  Detail & Related papers  (2020-04-14T23:15:39Z)

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.