Decomposition of matrix product states into shallow quantum circuits [PDF]
Tensor networks (TNs) are a family of computational methods built on graph-structured factorizations of large tensors, which have long represented state-of-the-art methods for the approximate simulation of complex quantum systems on classical computers ...
Manuel S. Rudolph +4 more
semanticscholar +1 more source
Generalized quantum measurements with matrix product states: Entanglement phase transition and clusterization [PDF]
We propose a method, based on matrix product states, for studying the time evolution of many-body quantum lattice systems under continuous and site-resolved measurement. Both the frequency and the strength of generalized measurements can be varied within
Elmer V. H. Doggen +4 more
semanticscholar +1 more source
Magic of random matrix product states [PDF]
Magic, or nonstabilizerness, characterizes how far away a state is from the stabilizer states, making it an important resource in quantum computing, under the formalism of the Gotteman-Knill theorem.
Liyuan Chen +3 more
semanticscholar +1 more source
Explicitly Correlated Electronic Structure Calculations with Transcorrelated Matrix Product Operators. [PDF]
In this work, we present the first implementation of the transcorrelated electronic Hamiltonian in an optimization procedure for matrix product states by the density matrix renormalization group (DMRG) algorithm.
Alberto Baiardi, M. Lesiuk, M. Reiher
semanticscholar +1 more source
Emergent Statistical Mechanics from Properties of Disordered Random Matrix Product States [PDF]
The study of generic properties of quantum states has led to an abundance of insightful results. A meaningful set of states that can be efficiently prepared in experiments are ground states of gapped local Hamiltonians, which are well approximated by ...
J. Haferkamp +3 more
semanticscholar +1 more source
Efficiently Correcting Matrix Products [PDF]
We study the problem of efficiently correcting an erroneous product of two $n\times n$ matrices over a ring. Among other things, we provide a randomized algorithm for correcting a matrix product with at most $k$ erroneous entries running in $\tilde{O}(n^2+kn)$ time and a deterministic $\tilde{O}(kn^2)$-time algorithm for this problem (where the ...
Gąsieniec, Leszek +4 more
openaire +8 more sources
Structured matrix recovery from matrix‐vector products
AbstractCan one recover a matrix efficiently from only matrix‐vector products? If so, how many are needed? This article describes algorithms to recover matrices with known structures, such as tridiagonal, Toeplitz, Toeplitz‐like, and hierarchical low‐rank, from matrix‐vector products.
Diana Halikias, Alex Townsend
openaire +3 more sources
A unique and novel graph matrix for efficient extraction of structural information of networks
In this article, we propose a new type of square matrix associated with an undirected graph by trading off the natural embedded symmetry in them. The proposed matrix is defined using the neighbourhood sets of the vertices, called as neighbourhood matrix
Sivakumar Karunakaran +1 more
doaj +1 more source
Non-Markovian stochastic Schrödinger equation: Matrix-product-state approach to the hierarchy of pure states [PDF]
We derive a stochastic hierarchy of matrix product states (HOMPS) for non-Markovian dynamics in open quantum system at finite temperature, which is numerically exact and efficient.
Xing Gao +3 more
semanticscholar +1 more source
The high mutation rate in retroviruses is one of the leading causes of drug resistance. In human immunodeficiency virus type-1 (HIV-1), synergistic mutations in its protease and the protease substrate – the Group-specific antigen (Gag) polyprotein – work
Firdaus Samsudin +2 more
doaj +1 more source

