Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Tight reference frame-independent quantum teleportation

D Verdon, J Vicary

Published Jan 1, 2017• 0 citations
OpenAlex

Abstract

We give a tight scheme for teleporting a quantum state between two parties, whose reference frames are misaligned by some action of a finite symmetry group,satisfying a certain property. Unlike previously proposed schemes, ours requires no additional tokens or data to be passed between the participants; the same amount of classical information is transferred as for ordinary quantum teleportation, and the Hilbert space of the entangled resource is of the same size. Using the terminology of Peres and Scudo, the key idea is that the classical channel conveys unspeakable information.

Related papers

Tight Reference Frame–Independent Quantum Teleportation

Dominic Verdon, Jamie Vicary

We give a tight scheme for teleporting a quantum state between two parties whose reference frames are misaligned by an action of a finite symmetry group. Unlike previously proposed schemes, ours requires no additional tokens or data to be passed between the participants; the same amount of classical information is transferred as for ordinary quantum teleportation, and the Hilbert space of the entangled resource is of the same size. In the terminology of Peres and Scudo, our protocol relies on classical communication of unspeakable information.

arXiv:1603.08866•Electronic Proceedings in Theoretical Computer Science•Jan 1, 2017•4 citations

Tight quantum teleportation without a shared reference frame

Dominic Verdon, Jamie Vicary

We present a scheme for teleporting a quantum state between two parties whose local reference frames are misaligned by the action of a finite symmetry group. Unlike other proposals, our scheme requires the same amount of classical communication and entangled resources as conventional teleportation, does not reveal any reference frame information, and is robust against changes in reference frame alignment while the protocol is under way. The mathematical foundation of our scheme is a unitary error basis which is permuted up to a phase by the conjugation action of the group. We completely classify such unitary error bases for qubits, exhibit constructions in higher dimension, and provide a method for proving nonexistence in some cases.

arXiv:1710.01060•Physical Review A•Jul 9, 2018•5 citations

Quantum teleportation with infinite reference-frame uncertainty

Dominic Verdon, Jamie Vicary

We present two schemes for quantum teleportation between parties whose local reference frames are misaligned by the action of a compact Lie group $G$. These schemes require no prior alignment of reference frames and are unaffected by arbitrary changes in reference-frame alignment during execution, suiting them to situations of rapid reference-frame drift. Our tight scheme yields improved purity compared to standard teleportation, in some cases substantially---this includes the case of qubit teleportation under arbitrary $\mathrm{SU}(2)$ reference-frame uncertainty---while communicating no information about either party's reference-frame alignment at any time. Our perfect scheme performs perfect teleportation, but does communicate some reference-frame information. The mathematical foundation of these schemes is a unitary error basis permuted up to a phase by the conjugation action of a finite subgroup of $G$.

arXiv:1802.09040•Physical Review A•Dec 4, 2019•5 citations

Algebraic quantum structures for reference frame-independent quantum teleportation and pseudo-telepathy

Dominic Verdon

Part I: We present two new schemes for teleportation of a quantum state between parties whose local reference frames are misaligned by the action of a compact Lie group G. These schemes require no prior alignment of reference frames and are unaffected by arbitrary changes in reference frame alignment during execution, suiting them to situations of rapid reference frame drift. Our tight scheme yields improved purity compared to standard teleportation, in some cases substantially ---including the case of qubit teleportation under arbitrary SU(2) reference frame uncertainty--- while communicating no information about either party's reference frame alignment at any time. Our perfect scheme performs perfect teleportation, but does communicate some reference frame information. The mathematical foundation of these schemes is a unitary error basis permuted up to a phase by the conjugation action of a finite subgroup of G; we completely classify such unitary error bases for qubits, exhibit constructions in higher dimension, and provide a method for proving nonexistence in some cases. Part II: Quantum pseudo-telepathy is a phenomenon whereby two non-communicating parties can use the non-signalling correlations from shared quantum entanglement to perform a task that would ordinarily be impossible without communication. Here we consider the graph isomorphism game: an instance of the game is defined by a pair of graphs, and a perfect deterministic classical strategy precisely corresponds to an isomorphism of those graphs. We call a pair of graphs for which a perfect strategy using shared entanglement (a quantum strategy) exists pseudo-telepathic, and call a quantum strategy a quantum isomorphism between the graphs. Using a deep connection between noncommutative mathematics and nonlocal games, we classify all graphs quantum isomorphic to a given graph in terms of the quantum automorphism group of the graph. This implies a construction of quantum isomorphisms from central type subgroups of the ordinary automorphism group; we give an explicit description of the resulting quantum strategy and the new graph. We consider generation of new examples of quantum contextuality from central type groups. For abelian central type groups we show that this reduces to construction of quantum solutions of a binary linear constraint system from the abelianisation of its homogeneous solution group.

•Jan 1, 2019•0 citations

Perfect teleportation with a partially entangled quantum channel

Xiang Chen, Yao Shen, Fulin Zhang

Quantum teleportation provides a way to transfer unknown quantum states from one system to another via an entangled state as a quantum channel without physical transmission of the object itself. The entangled channel, measurement performed by the sender (Alice), and classical information sent to the receiver (Bob) are three key ingredients in the procedure, which need to cooperate with each other. To study the relationship among the three parts, we propose a scheme for perfect teleportation of a qubit through a high-dimensional quantum channel in a pure state with two equal largest Schmidt coefficients. The scheme requires less entanglement of Alice's measurement but more classical bits than the original scheme via a Bell state. The two quantities increase with the entanglement of the quantum channel when its dimension is fixed and thereby can be regard as Alice's necessary capabilities to use the quantum channel. And the two capabilities appear complementary to each other.

arXiv:2101.06693•Physical Review A•Sep 26, 2022•11 citations

Transfer of quantum states using finite resources

Dietmar G. Fischer, Holger Mack, Matthias Freyberger

We discuss the problem of transfering a qubit from Alice to Bob using a noisy quantum channel and only finite resources. As the basic protocol for the transfer we apply quantum teleportation. It turns out that, for a certain quality of the channel, direct teleportation combined with qubit purification is superior to entanglement purification of the channel. If, however, the quality of the channel is rather low, one should simply apply an estimation-preparation scheme.

arXiv:quant-ph/0008038•Physical Review A•Mar 16, 2001•14 citations
We give a tight scheme for teleporting a quantum state between two parties, whose reference frames are misaligned by some action of a finite symmetry group,satisfying a certain property. Unlike previously proposed schemes, ours requires no additional tokens or data to be passed between the participants; the same amount of classical information is transferred as for ordinary quantum teleportation, and the Hilbert space of the entangled resource is of the same size. Using the terminology of Peres and Scudo, the key idea is that the classical channel conveys unspeakable information.
We give a tight scheme for teleporting a quantum state between two parties whose reference frames are misaligned by an action of a finite symmetry group. Unlike previously proposed schemes, ours requires no additional tokens or data to be passed between the participants; the same amount of classical information is transferred as for ordinary quantum teleportation, and the Hilbert space of the entangled resource is of the same size. In the terminology of Peres and Scudo, our protocol relies on classical communication of unspeakable information.
We present a scheme for teleporting a quantum state between two parties whose local reference frames are misaligned by the action of a finite symmetry group. Unlike other proposals, our scheme requires the same amount of classical communication and entangled resources as conventional teleportation, does not reveal any reference frame information, and is robust against changes in reference frame alignment while the protocol is under way. The mathematical foundation of our scheme is a unitary error basis which is permuted up to a phase by the conjugation action of the group. We completely classify such unitary error bases for qubits, exhibit constructions in higher dimension, and provide a method for proving nonexistence in some cases.
We present two schemes for quantum teleportation between parties whose local reference frames are misaligned by the action of a compact Lie group GGG. These schemes require no prior alignment of reference frames and are unaffected by arbitrary changes in reference-frame alignment during execution, suiting them to situations of rapid reference-frame drift. Our tight scheme yields improved purity compared to standard teleportation, in some cases substantially---this includes the case of qubit teleportation under arbitrary SU(2)\mathrm{SU}(2)SU(2) reference-frame uncertainty---while communicating no information about either party's reference-frame alignment at any time. Our perfect scheme performs perfect teleportation, but does communicate some reference-frame information. The mathematical foundation of these schemes is a unitary error basis permuted up to a phase by the conjugation action of a finite subgroup of GGG.
Part I: We present two new schemes for teleportation of a quantum state between parties whose local reference frames are misaligned by the action of a compact Lie group G. These schemes require no prior alignment of reference frames and are unaffected by arbitrary changes in reference frame alignment during execution, suiting them to situations of rapid reference frame drift. Our tight scheme yields improved purity compared to standard teleportation, in some cases substantially ---including the case of qubit teleportation under arbitrary SU(2) reference frame uncertainty--- while communicating no information about either party's reference frame alignment at any time. Our perfect scheme performs perfect teleportation, but does communicate some reference frame information. The mathematical foundation of these schemes is a unitary error basis permuted up to a phase by the conjugation action of a finite subgroup of G; we completely classify such unitary error bases for qubits, exhibit constructions in higher dimension, and provide a method for proving nonexistence in some cases. Part II: Quantum pseudo-telepathy is a phenomenon whereby two non-communicating parties can use the non-signalling correlations from shared quantum entanglement to perform a task that would ordinarily be impossible without communication. Here we consider the graph isomorphism game: an instance of the game is defined by a pair of graphs, and a perfect deterministic classical strategy precisely corresponds to an isomorphism of those graphs. We call a pair of graphs for which a perfect strategy using shared entanglement (a quantum strategy) exists pseudo-telepathic, and call a quantum strategy a quantum isomorphism between the graphs. Using a deep connection between noncommutative mathematics and nonlocal games, we classify all graphs quantum isomorphic to a given graph in terms of the quantum automorphism group of the graph. This implies a construction of quantum isomorphisms from central type subgroups of the ordinary automorphism group; we give an explicit description of the resulting quantum strategy and the new graph. We consider generation of new examples of quantum contextuality from central type groups. For abelian central type groups we show that this reduces to construction of quantum solutions of a binary linear constraint system from the abelianisation of its homogeneous solution group.
Quantum teleportation provides a way to transfer unknown quantum states from one system to another via an entangled state as a quantum channel without physical transmission of the object itself. The entangled channel, measurement performed by the sender (Alice), and classical information sent to the receiver (Bob) are three key ingredients in the procedure, which need to cooperate with each other. To study the relationship among the three parts, we propose a scheme for perfect teleportation of a qubit through a high-dimensional quantum channel in a pure state with two equal largest Schmidt coefficients. The scheme requires less entanglement of Alice's measurement but more classical bits than the original scheme via a Bell state. The two quantities increase with the entanglement of the quantum channel when its dimension is fixed and thereby can be regard as Alice's necessary capabilities to use the quantum channel. And the two capabilities appear complementary to each other.