Michael Kastoryano: Finite correlation length implies efficient preparation quantum thermal states

Subscribers:
344,000
Published on ● Video Link: https://www.youtube.com/watch?v=qwa5gHo8rsI



Duration: 31:14
384 views
4


Preparing quantum thermal states on a quantum computer is in general a difficult task. We provide a procedure to prepare a thermal state on a quantum computer with a logarithmic depth circuit of local quantum channels assuming that the thermal state correlations satisfy the following two properties: (i) the correlations between two regions are exponentially decaying in the distance between the regions, and (ii) the thermal state is an approximate Markov state for shielded regions. We require both properties to hold for the thermal state of the Hamiltonian on any induced subgraph of the original lattice. Assumption (ii) is satisfied for all commuting Gibbs states, while assumption (i) is satisfied for every model above a critical temperature. Both assumptions are satisfied in one spatial dimension. Moreover, both assumptions are expected to hold above the thermal phase transition for models without any topological order at finite temperature. As a building block, we show that exponential decay of correlation (for thermal states of Hamiltonians on all induced subgraph) is sufficient to efficiently estimate the expectation value of a local observable. Our proof uses quantum belief propagation, a recent strengthening of strong sub-additivity, and naturally breaks down for states with topological order.




Other Videos By Microsoft Research


2017-02-03Dave Touchette: Information-theoretic tools for interactive quantum protocols, and applications
2017-02-03Kohtaro Kato: The thermality of quantum approximate Markov chains
2017-02-03Speaker: Peter Høyer
2017-02-03Speakers: Riccardo Laurenza, Mark Wilde
2017-02-03Speakers Rui Chao, Andrea W. Coladangelo, Matthew Coudron
2017-02-03Jordi Tura Brugués: Energy as a detector of nonlocality of many-body spin systems
2017-02-01Quantum thermodynamics (II)
2017-01-31Dave Touchette:Exponential separation quantum communication & classical information complexity
2017-01-31Sam Roberts: Symmetry protected topological order at nonzero temperature
2017-01-31Anthony Leverrier: SU(p,q) coherent states and Gaussian de Finetti theorems
2017-01-31Michael Kastoryano: Finite correlation length implies efficient preparation quantum thermal states
2017-01-31Xin Wang: Semidefinite programming strong converse bounds for quantum channel capacities
2017-01-31Li Gao: Capacity estimates for TRO channels
2017-01-31Anna Vershynina: Geometric inequalities and contractivity of bosonic semigroups
2017-01-31Rotem Arnon-Friedman: Entropy accumulation in device-independent protocols
2017-01-31Giacomo De Palma: Gaussian optimizers in quantum information
2017-01-31Sergey Bravyi: Improved classical simulation of quantum circuits dominated by Clifford gates
2017-01-31William Slofstra:Tsirelson’s problem & an embedding theorem for groups arising from non-local games
2017-01-31Keisuke Fujii: Threshold theorem for quantum supremacy
2017-01-31Kai-Min Chung: General randomness amplification with non-signaling security
2017-01-31Anand Natarajan: Robust self-testing of many qubit states



Tags:
microsoft research