Efficient conversion from fermionic Gaussian states to matrix product states
- URL: http://arxiv.org/abs/2408.01155v1
- Date: Fri, 2 Aug 2024 10:15:26 GMT
- Title: Efficient conversion from fermionic Gaussian states to matrix product states
- Authors: Tong Liu, Ying-Hai Wu, Hong-Hao Tu, Tao Xiang,
- Abstract summary: 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.
- Score: 48.225436651971805
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Fermionic Gaussian states are eigenstates of quadratic Hamiltonians and widely used in quantum many-body problems. 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 with translation invariance. If the ground states of a topologically ordered system on infinite cylinders are expressed as matrix product states, then the fixed points of the transfer matrix can be harnessed to filter out the anyon eigenbasis, also known as minimally entangled states. This allows for efficient computation of universal properties such as entanglement spectrum and modular matrices. The potential of our method is demonstrated by numerical calculations in two chiral spin liquids that have the same topological orders as the bosonic Laughlin and Moore-Read states, respectively. The anyon eigenbasis for the first one has been worked out before and serves as a useful benchmark. The anyon eigenbasis of the second one is, however, not transparent and its successful construction provides a nontrivial corroboration of our method.
Related papers
- Using Variational Eigensolvers on Low-End Hardware to Find the Ground
State Energy of Simple Molecules [0.0]
Key properties of physical systems can be described by the eigenvalues of matrices that represent the system.
Computational algorithms that determine the eigenvalues of these matrices exist, but they generally suffer from a loss of performance as the matrix grows in size.
This process can be expanded to quantum computation to find the eigenvalues with better performance than the classical algorithms.
arXiv Detail & Related papers (2023-10-29T18:36:18Z) - Approximate orthogonality of permutation operators, with application to
quantum information [0.9790236766474201]
Consider the $n!$ different unitary matrices that permute $n$ $d$-dimensional quantum systems.
If $dgeq n$ then they are linearly independent.
This simple point has several applications in quantum information and random matrix theory.
arXiv Detail & Related papers (2023-09-01T19:45:30Z) - 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) - A quantum algorithm for solving eigenproblem of the Laplacian matrix of
a fully connected weighted graph [4.045204834863644]
We propose an efficient quantum algorithm to solve the eigenproblem of the Laplacian matrix of a fully connected weighted graph.
Specifically, we adopt the optimal Hamiltonian simulation technique based on the block-encoding framework.
We also show that our algorithm can be extended to solve the eigenproblem of symmetric (non-symmetric) normalized Laplacian matrix.
arXiv Detail & Related papers (2022-03-28T02:24:08Z) - 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) - Non-Markovian Stochastic Schr\"odinger Equation: Matrix Product State
Approach to the Hierarchy of Pure States [65.25197248984445]
We derive a hierarchy of matrix product states (HOMPS) for non-Markovian dynamics in open finite temperature.
The validity and efficiency of HOMPS is demonstrated for the spin-boson model and long chains where each site is coupled to a structured, strongly non-Markovian environment.
arXiv Detail & Related papers (2021-09-14T01:47:30Z) - General expressions for the quantum Fisher information matrix with
applications to discrete quantum imaging [0.28675177318965034]
We derive general expressions for the quantum Fisher information matrix which bypass matrix diagonalization and do not require the expansion of operators on an orthonormal set of states.
We demonstrate the power of our approach by deriving novel results in the timely field of discrete quantum imaging.
arXiv Detail & Related papers (2020-12-02T22:18:22Z) - Local optimization on pure Gaussian state manifolds [63.76263875368856]
We exploit insights into the geometry of bosonic and fermionic Gaussian states to develop an efficient local optimization algorithm.
The method is based on notions of descent gradient attuned to the local geometry.
We use the presented methods to collect numerical and analytical evidence for the conjecture that Gaussian purifications are sufficient to compute the entanglement of purification of arbitrary mixed Gaussian states.
arXiv Detail & Related papers (2020-09-24T18:00:36Z) - Multi-Objective Matrix Normalization for Fine-grained Visual Recognition [153.49014114484424]
Bilinear pooling achieves great success in fine-grained visual recognition (FGVC)
Recent methods have shown that the matrix power normalization can stabilize the second-order information in bilinear features.
We propose an efficient Multi-Objective Matrix Normalization (MOMN) method that can simultaneously normalize a bilinear representation.
arXiv Detail & Related papers (2020-03-30T08:40:35Z)
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.