Multicopy quantum state teleportation with application to storage and retrieval of quantum programs
Abstract
This work considers a teleportation task for Alice and Bob in a scenario where Bob cannot perform corrections. In particular, we analyse the task of multicopy state teleportation, where Alice has k identical copies of an arbitrary unknown d-dimensional qudit state to teleport a single copy of to Bob using a maximally entangled two-qudit state shared between Alice and Bob without Bob's correction. Alice may perform a joint measurement on her half of the entangled state and the k copies of . We prove that the maximal probability of success for teleporting the exact state to Bob is p(d,k)=kd(k-1+d) and present an explicit protocol to attain this performance. Then, by utilising k copies of an arbitrary target state , we show how the multicopy state teleportation protocol can be employed to enhance the success probability of storage and retrieval of quantum programs, which aims to universally retrieve the action of an arbitrary quantum channel that is stored in a state. Our proofs make use of group representation theory methods, which may find applications beyond the problems addressed in this work.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.