2000
DOI: 10.1103/physreva.61.022301
|View full text |Cite
|
Sign up to set email alerts
|

Problem of equilibration and the computation of correlation functions on a quantum computer

Abstract: We address the question of how a quantum computer can be used to simulate experiments on quantum systems in thermal equilibrium. We present two approaches for the preparation of the equilibrium state on a quantum computer. For both approaches, we show that the output state of the algorithm, after long enough time, is the desired equilibrium. We present a numerical analysis of one of these approaches for small systems. We show how equilibrium (time)-correlation functions can be efficiently estimated on a quantu… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

3
187
0

Year Published

2008
2008
2022
2022

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 171 publications
(192 citation statements)
references
References 38 publications
3
187
0
Order By: Relevance
“…Since 1 is a simple eigenvalue, Φ has an unique fixed point which is (by Lemma 3.1) a density matrix ρ ∞ ∈ M 1,+ d (C). Using the Jordan form of Φ, one can show the following result ( [25]). Proposition 4.1.…”
Section: Non-random Repeated Interactions and A New Model Of Random Dmentioning
confidence: 99%
“…Since 1 is a simple eigenvalue, Φ has an unique fixed point which is (by Lemma 3.1) a density matrix ρ ∞ ∈ M 1,+ d (C). Using the Jordan form of Φ, one can show the following result ( [25]). Proposition 4.1.…”
Section: Non-random Repeated Interactions and A New Model Of Random Dmentioning
confidence: 99%
“…By general results on quantum channels the vast majority of CPT maps are known to be mixing (or relaxing) [16,17,18,19]. This means that for a generic choice of Φ, in the limit m → ∞ the transformation (3) will send all input states into a unique fix point identified as the unique eigen-operator of Φ associated with its largest eigenvalue.…”
mentioning
confidence: 99%
“…The speed of convergence, evaluated through the trace distance, is exponentially fast [18,19] inm and, a part from some constant prefactor, can be upper-bounded by the quantitym d 3 κm with κ < 1 being the modulus of the largest eigenvalue of Φ whose associated eigenvector contribute in the expansion of Eq. (6).…”
mentioning
confidence: 99%
See 2 more Smart Citations