Density Matrix Renormalization Group Algorithm For Mixed Quantum States

• URL: http://arxiv.org/abs/2203.16350v2
• Date: Tue, 31 May 2022 15:02:37 GMT
• Title: Density Matrix Renormalization Group Algorithm For Mixed Quantum States
• Authors: Chu Guo
• Abstract summary: We propose a positive matrix product ansatz for mixed quantum states which preserves positivity by construction. This algorithm is applied for computing both the equilibrium states and the non-equilibrium steady states.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Density Matrix Renormalization Group (DMRG) algorithm has been extremely successful for computing the ground states of one-dimensional quantum many-body systems. For problems concerned with mixed quantum states, however, it is less successful in that either such an algorithm does not exist yet or that it may return unphysical solutions. Here we propose a positive matrix product ansatz for mixed quantum states which preserves positivity by construction. More importantly, it allows to build a DMRG algorithm which, the same as the standard DMRG for ground states, iteratively reduces the global optimization problem to local ones of the same type, with the energy converging monotonically in principle. This algorithm is applied for computing both the equilibrium states and the non-equilibrium steady states, and its advantages are numerically demonstrated.

Related papers

• A Fresh Look at Generalized Category Discovery through Non-negative Matrix Factorization [83.12938977698988]
  Generalized Category Discovery (GCD) aims to classify both base and novel images using labeled base data. Current approaches inadequately address the intrinsic optimization of the co-occurrence matrix $barA$ based on cosine similarity. We propose a Non-Negative Generalized Category Discovery (NN-GCD) framework to address these deficiencies.
  arXiv  Detail & Related papers  (2024-10-29T07:24:11Z)
• Efficient conversion from fermionic Gaussian states to matrix product states [48.225436651971805]
  We propose a highly efficient algorithm that converts fermionic Gaussian states to matrix product states. It can be formulated for finite-size systems without translation invariance, but becomes particularly appealing when applied to infinite systems. The potential of our method is demonstrated by numerical calculations in two chiral spin liquids.
  arXiv  Detail & Related papers  (2024-08-02T10:15:26Z)
• Stabilizer ground states for simulating quantum many-body physics: theory, algorithms, and applications [0.5735035463793009]
  We apply stabilizer states to tackle quantum many-body ground state problems. We develop an exact and linear-scaled algorithm to obtain stabilizer ground states of 1D local Hamiltonians.
  arXiv  Detail & Related papers  (2024-03-13T11:54:25Z)
• Neutron-nucleus dynamics simulations for quantum computers [49.369935809497214]
  We develop a novel quantum algorithm for neutron-nucleus simulations with general potentials. It provides acceptable bound-state energies even in the presence of noise, through the noise-resilient training method. We introduce a new commutativity scheme called distance-grouped commutativity (DGC) and compare its performance with the well-known qubit-commutativity scheme.
  arXiv  Detail & Related papers  (2024-02-22T16:33:48Z)
• A Quadratic Speedup in Finding Nash Equilibria of Quantum Zero-Sum Games [102.46640028830441]
  We introduce the Optimistic Matrix Multiplicative Weights Update (OMMWU) algorithm and establish its average-iterate convergence complexity as $mathcalO(d/epsilon)$ to $epsilon$-Nash equilibria. This quadratic speed-up sets a new benchmark for computing $epsilon$-Nash equilibria in quantum zero-sum games.
  arXiv  Detail & Related papers  (2023-11-17T20:38:38Z)
• Vectorization of the density matrix and quantum simulation of the von Neumann equation of time-dependent Hamiltonians [65.268245109828]
  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.
  arXiv  Detail & Related papers  (2023-06-14T23:08:51Z)
• Matrix Product Renormalization Group: Potential Universal Quantum Many-Body Solver [0.0]
  We propose an improved formulation of continuous tensor network algorithms, which we name a matrix product renormalization group (MPRG) MPRG is a universal quantum many-body solver, which potentially works at both zero and finite temperatures, in two and higher dimensions, and is even applicable to open quantum systems.
  arXiv  Detail & Related papers  (2022-12-26T19:00:01Z)
• Preentangling Quantum Algorithms -- the Density Matrix Renormalization Group-assisted Quantum Canonical Transformation [0.0]
  We propose the use of parameter-free preentanglers as initial states for quantum algorithms. We find this strategy to require significantly less parameters than corresponding generalized unitary coupled cluster circuits.
  arXiv  Detail & Related papers  (2022-09-15T07:35:21Z)
• A density-matrix renormalization group algorithm for simulating quantum circuits with a finite fidelity [3.965473736150699]
  We develop a density-matrix renormalization group (DMRG) algorithm for the simulation of quantum circuits. For small circuit depths, the technique is exact and equivalent to other matrix product state (MPS) based techniques.
  arXiv  Detail & Related papers  (2022-07-12T15:28:55Z)
• Parallel Quantum Chemistry on Noisy Intermediate-Scale Quantum Computers [0.0]
  A novel hybrid quantum-classical algorithm is presented for the solution of the quantum-chemical ground-state energy problem. The new approach is demonstrated for Hubbard-like systems on IBM quantum computers based on superconducting transmon qubits.
  arXiv  Detail & Related papers  (2022-02-04T22:28:17Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.