2008
DOI: 10.1088/1367-2630/10/3/033032
|View full text |Cite
|
Sign up to set email alerts
|

On entropy growth and the hardness of simulating time evolution

Abstract: The simulation of quantum systems is a task for which quantum computers are believed to give an exponential speedup as compared to classical ones. While ground states of one-dimensional systems can be efficiently approximated using Matrix Product States (MPS), their time evolution can encode quantum computations, so that simulating the latter should be hard classically. However, one might believe that for systems with high enough symmetry, and thus insufficient parameters to encode a quantum computation, effic… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

4
107
0

Year Published

2008
2008
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 107 publications
(111 citation statements)
references
References 36 publications
4
107
0
Order By: Relevance
“…Indeed, t-DMRG simulates time evolution for short times to essentially machine precision. For long times, the entropy will in general grow too much, as then sites are in the space time cone of too many sites of the lattice, and an efficient simulation in terms of matrix-product states is hence [60] no longer possible [12,61]. That is, the power of the t-DMRG approach can be rigorously grasped in terms of Lieb-Robinson bounds.…”
Section: Time-dependent Density-matrix Renormalization Group Methodsmentioning
confidence: 99%
“…Indeed, t-DMRG simulates time evolution for short times to essentially machine precision. For long times, the entropy will in general grow too much, as then sites are in the space time cone of too many sites of the lattice, and an efficient simulation in terms of matrix-product states is hence [60] no longer possible [12,61]. That is, the power of the t-DMRG approach can be rigorously grasped in terms of Lieb-Robinson bounds.…”
Section: Time-dependent Density-matrix Renormalization Group Methodsmentioning
confidence: 99%
“…The global Gaussian state of the chain is described by a CM Γ = N i=1 γ [i] . As the interest in GVBS lies mainly in their connections with ground states of Hamiltonians invariant under translation [3], we can focus on pure (Det…”
Section: Gaussian Valence Bond Statesmentioning
confidence: 99%
“…The projection corresponds mathematically to taking a Schur complement (see Refs. [4,3,22] for details), yielding an output pure GVBS of N modes on a ring with a CM…”
Section: Gaussian Valence Bond Statesmentioning
confidence: 99%
See 2 more Smart Citations