We present a theoretical scheme for perfect teleportation of an unknown multipartite two-level state by a single EPR （Einstein-Podolsky-Rosen） pair, and then generalize it to multilevel, i.e., an N-quNit state can b...We present a theoretical scheme for perfect teleportation of an unknown multipartite two-level state by a single EPR （Einstein-Podolsky-Rosen） pair, and then generalize it to multilevel, i.e., an N-quNit state can be teleported by a single quNit entangled pair, with additional local unitary operations. The feature of the scheme is that teleporting a multipartite state with a reduced amount of entanglement costs less classical bits.展开更多
Abstract A simple scheme for teleporting an unknown M-qubit cat-like state is proposed. The steps of this scheme can be summarized simply： disentangle-teleport-reconstruct entanglement. If proper unitary operations a...Abstract A simple scheme for teleporting an unknown M-qubit cat-like state is proposed. The steps of this scheme can be summarized simply： disentangle-teleport-reconstruct entanglement. If proper unitary operations and measurements from senders are given, the teleportation of an unknown M-qubit cat-like state can be converted into single qubit teleportation. In the meantime, the receiver should also carry out right unitary operations with the introduction of appropriate ancillary qubits to confirm the successful teleportation of the demanded entangled state. The present scheme can be generalized to teleport an unknown M-quNit state, i.e., an M-quNit state can be teleported by a single quNit entangled pair.展开更多
In quantum games based on 2-player-N-strategies classical games, each player has a quNit (a normalized vector in an N-dimensional Hilbert space HN) upon which he applies his strategy (a matrix U∈SU(N)). The players d...In quantum games based on 2-player-N-strategies classical games, each player has a quNit (a normalized vector in an N-dimensional Hilbert space HN) upon which he applies his strategy (a matrix U∈SU(N)). The players draw their payoffs from a state . Here ?and J (both determined by the game’s referee) are respectively an unentangled 2-quNit (pure) state and a unitary operator such that ?is partially entangled. The existence of pure strategy Nash equilibrium in the quantum game is intimately related to the degree of entanglement of . Hence, it is practical to design the entangler J= J(β) to be dependent on a single real parameter β that controls the degree of entanglement of , such that its von-Neumann entropy SN(β) is continuous and obtains any value in . Designing J(β) for N=2 is quite standard. Extension to N>2 is not obvious, and here we suggest an algorithm to achieve it. Such construction provides a special quantum gate that should be a useful tool not only in quantum games but, more generally, as a special gate in manipulating quantum information protocols.展开更多
基金The project supported by the Fund from Hunan University of Science and Engineering
文摘We present a theoretical scheme for perfect teleportation of an unknown multipartite two-level state by a single EPR （Einstein-Podolsky-Rosen） pair, and then generalize it to multilevel, i.e., an N-quNit state can be teleported by a single quNit entangled pair, with additional local unitary operations. The feature of the scheme is that teleporting a multipartite state with a reduced amount of entanglement costs less classical bits.
基金supported by National Natural Science Foundation of China under Grant No.10574060
文摘Abstract A simple scheme for teleporting an unknown M-qubit cat-like state is proposed. The steps of this scheme can be summarized simply： disentangle-teleport-reconstruct entanglement. If proper unitary operations and measurements from senders are given, the teleportation of an unknown M-qubit cat-like state can be converted into single qubit teleportation. In the meantime, the receiver should also carry out right unitary operations with the introduction of appropriate ancillary qubits to confirm the successful teleportation of the demanded entangled state. The present scheme can be generalized to teleport an unknown M-quNit state, i.e., an M-quNit state can be teleported by a single quNit entangled pair.
文摘In quantum games based on 2-player-N-strategies classical games, each player has a quNit (a normalized vector in an N-dimensional Hilbert space HN) upon which he applies his strategy (a matrix U∈SU(N)). The players draw their payoffs from a state . Here ?and J (both determined by the game’s referee) are respectively an unentangled 2-quNit (pure) state and a unitary operator such that ?is partially entangled. The existence of pure strategy Nash equilibrium in the quantum game is intimately related to the degree of entanglement of . Hence, it is practical to design the entangler J= J(β) to be dependent on a single real parameter β that controls the degree of entanglement of , such that its von-Neumann entropy SN(β) is continuous and obtains any value in . Designing J(β) for N=2 is quite standard. Extension to N>2 is not obvious, and here we suggest an algorithm to achieve it. Such construction provides a special quantum gate that should be a useful tool not only in quantum games but, more generally, as a special gate in manipulating quantum information protocols.
