Zobrazeno 1 - 10
of 277
pro vyhledávání: '"Baker, Thomas E."'
Autor:
Baker, Thomas E., Seif, Negar
We consider a set of density matrices. All of which are written in the same orbital basis, but the orbital basis size is less than the total Hilbert space size. We ask how each density matrix is related to each of the others by establishing a norm be
Externí odkaz:
http://arxiv.org/abs/2409.02362
Autor:
Baker, Thomas E., Thompson, Martin P.
Detailed notes on the functions included in the DMRjulia library are included here. This discussion of how to program functions for a tensor network library are intended to be a supplement to the other documentation dedicated to explaining the high l
Externí odkaz:
http://arxiv.org/abs/2111.14530
Autor:
Baker, Thomas E.
The method of quantum Lanczos recursion is extended to solve for multiple excitations on the quantum computer. While quantum Lanczos recursion is in principle capable of obtaining excitations, the extension to a block Lanczos routine can resolve dege
Externí odkaz:
http://arxiv.org/abs/2109.14114
Matrix product state methods are known to be efficient for computing ground states of local, gapped Hamiltonians, particularly in one dimension. We introduce the multi-targeted density matrix renormalization group method that acts on a bundled matrix
Externí odkaz:
http://arxiv.org/abs/2109.08181
Autor:
Baker, Thomas E., Thompson, Martin P.
An introduction to the density matrix renormalization group is contained here, including coding examples. The focus of this code is on basic operations involved in tensor network computations, and this forms the foundation of the DMRjulia library. Al
Externí odkaz:
http://arxiv.org/abs/2109.03120
Autor:
Baker, Thomas E., Poulin, David
Publikováno v:
Phys. Rev. Research 2, 043238 (2020)
One of the potential applications of a quantum computer is solving quantum chemical systems. It is known that one of the fastest ways to obtain somewhat accurate solutions classically is to use approximations of density functional theory. We demonstr
Externí odkaz:
http://arxiv.org/abs/2008.05592
Autor:
Baker, Thomas E.
Publikováno v:
Phys. Rev. A 103, 032404 (2021)
A state-preserving quantum counting algorithm is used to obtain coefficients of a Lanczos recursion from a single ground state wavefunction on the quantum computer. This is used to compute the continued fraction representation of an interacting Green
Externí odkaz:
http://arxiv.org/abs/2008.05593