Presents a poly-complexity quantum circuit implementing the random dilation superchannel for parallel channel queries, with approximate sequential extension, a no-go theorem for exact sequential dilation, and an application to exponentially improved channel storage-retrieval.
Asymptotic teleportation scheme as a universal programmable quantum processor
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
abstract
We consider a scheme of quantum teleportation where a receiver has multiple (N) output ports and obtains the teleported state by merely selecting one of the N ports according to the outcome of the sender's measurement. We demonstrate that such teleportation is possible by showing an explicit protocol where N pairs of maximally entangled qubits are employed. The optimal measurement performed by a sender is the square-root measurement, and a perfect teleportation fidelity is asymptotically achieved for a large N limit. Such asymptotic teleportation can be utilized as a universal programmable processor.
fields
quant-ph 4verdicts
UNVERDICTED 4representative citing papers
Quantum strategy stores isometry channels with n = Θ(1/√ε) queries for error ε, quadratic improvement over classical n = Θ(ε^{-1}).
Introduces resource theories for asynchronous port-based teleportation with free classical and quantum pre-processing, computes tight fidelity bounds for isotropic, graph, and symmetrized EPR states, and proves the strongest model equals any one-way protocol in surpassing the classical teleportation
Maximal success probability for multicopy teleportation without receiver correction is p(d,k)=k/[d(k-1+d)], attained by explicit protocol using group representation theory, with application to enhanced quantum program storage/retrieval.
citing papers explorer
-
Random dilation superchannel
Presents a poly-complexity quantum circuit implementing the random dilation superchannel for parallel channel queries, with approximate sequential extension, a no-go theorem for exact sequential dilation, and an application to exponentially improved channel storage-retrieval.
-
Quantum Advantage in Storage and Retrieval of Isometry Channels
Quantum strategy stores isometry channels with n = Θ(1/√ε) queries for error ε, quadratic improvement over classical n = Θ(ε^{-1}).
-
A resource theory of asynchronous quantum information processing
Introduces resource theories for asynchronous port-based teleportation with free classical and quantum pre-processing, computes tight fidelity bounds for isotropic, graph, and symmetrized EPR states, and proves the strongest model equals any one-way protocol in surpassing the classical teleportation
-
Multicopy quantum state teleportation with application to storage and retrieval of quantum programs
Maximal success probability for multicopy teleportation without receiver correction is p(d,k)=k/[d(k-1+d)], attained by explicit protocol using group representation theory, with application to enhanced quantum program storage/retrieval.