Pith. sign in

REVIEW

Fast State Transfer and Entanglement Renormalization Using Long-Range Interactions

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1612.02442 v2 pith:EJ7XK7DH submitted 2016-12-07 quant-ph physics.atom-ph

Fast State Transfer and Entanglement Renormalization Using Long-Range Interactions

classification quant-ph physics.atom-ph
keywords alphastatetimeentanglementtransferlong-rangecapabledistance
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In short-range interacting systems, the speed at which entanglement can be established between two separated points is limited by a constant Lieb-Robinson velocity. Long-range interacting systems are capable of faster entanglement generation, but the degree of the speed-up possible is an open question. In this paper, we present a protocol capable of transferring a quantum state across a distance $L$ in $d$ dimensions using long-range interactions with strength bounded by $1/r^\alpha$. If $\alpha < d$, the state transfer time is asymptotically independent of $L$; if $\alpha = d$, the time is logarithmic in distance $L$; if $d < \alpha < d+1$, transfer occurs in time proportional to $L^{\alpha - d}$; and if $\alpha \geq d + 1$, it occurs in time proportional to $L$. We then use this protocol to upper bound the time required to create a state specified by a MERA (multiscale entanglement renormalization ansatz) tensor network, and show that, if the linear size of the MERA state is $L$, then it can be created in time that scales with $L$ identically to state transfer up to multiplicative logarithmic corrections.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.