Vectorization of the density matrix and quantum simulation of the von Neumann equation of time-dependent Hamiltonians

• URL: http://arxiv.org/abs/2306.08775v4
• Date: Tue, 6 Feb 2024 23:18:49 GMT
• Title: Vectorization of the density matrix and quantum simulation of the von Neumann equation of time-dependent Hamiltonians
• Authors: Alejandro Kunold
• Abstract summary: We develop a general framework to linearize the von-Neumann equation rendering it in a suitable form for quantum simulations. We show that one of these linearizations of the von-Neumann equation corresponds to the standard case in which the state vector becomes the column stacked elements of the density matrix. A quantum algorithm to simulate the dynamics of the density matrix is proposed.
• Score: 65.268245109828
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Based oh the properties of Lie algebras, in this work we develop a general framework to linearize the von-Neumann equation rendering it in a suitable form for quantum simulations. We show that one of these linearizations of the von-Neumann equation corresponds to the standard case in which the state vector becomes the column stacked elements of the density matrix and the Hamiltonian superoperator takes the form $I\otimes H-H^\top \otimes I$ where $I$ is the identity matrix and $H$ is the standard Hamiltonian. It is proven that this particular form belongs to a wider class of ways of linearizing the von Neumann equation that can be categorized by the algebra from which they originated. Particular attention is payed to Hermitian algebras that yield real density matrix coefficients substantially simplifying the quantum tomography of the state vector. Based on this ideas, a quantum algorithm to simulate the dynamics of the density matrix is proposed. It is shown that this method, along with the unique properties of the algebra formed by Pauli strings allows to avoid the use of Trotterization hence considerably reducing the circuit depth. Even though we have used the special case of the algebra formed by the Pauli strings, the algorithm can be readily adapted to other algebras. The algorithm is demonstrated for two toy Hamiltonians using the IBM noisy quantum circuit simulator.

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)
• Gate Efficient Composition of Hamiltonian Simulation and Block-Encoding with its Application on HUBO, Fermion Second-Quantization Operators and Finite Difference Method [0.0]
  This article proposes a simple formalism which unifies Hamiltonian simulation techniques from different fields. It leads to a gate decomposition and a scaling different from the usual strategy. It can significantly reduce the quantum circuit number of rotational gates, multi-qubit gates, and the circuit depth.
  arXiv  Detail & Related papers  (2024-10-24T12:26:50Z)
• Gelfand-Tsetlin basis for partially transposed permutations, with applications to quantum information [0.9208007322096533]
  We study representation theory of the partially transposed permutation matrix algebra. We show how to simplify semidefinite optimization problems over unitary-equivariant quantum channels. We derive an efficient quantum circuit for implementing the optimal port-based quantum teleportation protocol.
  arXiv  Detail & Related papers  (2023-10-03T17:55:10Z)
• 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)
• Expanding the reach of quantum optimization with fermionic embeddings [2.378735224874938]
  In this work, we establish a natural embedding for this class of LNCG problems onto a fermionic Hamiltonian. We show that our quantum representation requires only a linear number of qubits. We provide evidence that this rounded quantum relaxation can produce high-quality approximations.
  arXiv  Detail & Related papers  (2023-01-04T19:00:01Z)
• Quantum algorithms for matrix operations and linear systems of equations [65.62256987706128]
  We propose quantum algorithms for matrix operations using the "Sender-Receiver" model. These quantum protocols can be used as subroutines in other quantum schemes.
  arXiv  Detail & Related papers  (2022-02-10T08:12:20Z)
• A Quantum Computer Amenable Sparse Matrix Equation Solver [0.0]
  We study problems involving the solution of matrix equations, for which there currently exists no efficient, general quantum procedure. We develop a generalization of the Harrow/Hassidim/Lloyd algorithm by providing an alternative unitary for eigenphase estimation. This unitary has the advantage of being well defined for any arbitrary matrix equation, thereby allowing the solution procedure to be directly implemented on quantum hardware.
  arXiv  Detail & Related papers  (2021-12-05T15:42:32Z)
• 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)
• Quantum algorithms for spectral sums [50.045011844765185]
  We propose new quantum algorithms for estimating spectral sums of positive semi-definite (PSD) matrices. We show how the algorithms and techniques used in this work can be applied to three problems in spectral graph theory.
  arXiv  Detail & Related papers  (2020-11-12T16:29:45Z)
• Koopman-von Neumann Approach to Quantum Simulation of Nonlinear Classical Dynamics [0.0]
  Quantum computers can be used to simulate nonlinear non-Hamiltonian classical dynamics on phase space. Koopman-von Neumann formulation implies that the conservation of the probability distribution function on phase space can be recast as an equivalent Schr"odinger equation on Hilbert space. Quantum simulation of classical dynamics is exponentially more efficient than a deterministic Eulerian discretization of the Liouville equation.
  arXiv  Detail & Related papers  (2020-03-22T19:47:19Z)

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.