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

arXiv:quant-ph/0610138

Asymmetric two-output quantum processor in any dimension

Iulia Ghiu, Gunnar G. Bjork

Published Oct 17, 2006• 0 citations
arXivHTMLPDF

Abstract

We propose two different implementations of an asymmetric two-output probabilistic quantum processor, which can implement a restricted set of one-qubit operations. One of them is constructed by combining asymmetric telecloning with a quantum gate array. We analyze the efficiency of this processor by evaluating the fidelities between the desired operation and the one generated by the processor and show that the two output states are the same as the ones produced by the optimal universal asymmetric Pauli cloning machine. The schemes require only local operations and classical communication, they have the advantage of transmitting the two output states directly to two spatially separated receivers but they have a success probability of 1/2. We show further that we can perform the same one-qubit operation with unity probability at the cost of using nonlocal operations. We finally generalize the two schemes for D-level systems and find that the local ones are successful with a probability of 1/D and the nonlocal generalized scheme is always successful.

DOI
10.48550/arxiv.quant-ph/0610138

Related papers

Asymmetric quantum telecloning ofd-level systems and broadcasting of entanglement to different locations using the “many-to-many” communication protocol

Iulia Ghiu

We propose a generalization of quantum teleportation: the so-called many-to-many quantum communication of the information of a d-level system from N spatially separated senders to $M>N$ receivers situated at different locations. We extend the concept of asymmetric telecloning from qubits to d-dimensional systems. We investigate the broadcasting of entanglement by using local $\stackrel{\ensuremath{\rightarrow}}{1}2$ optimal universal asymmetric Pauli machines and show that the maximal fidelities of the two final entangled states are obtained when symmetric machines are applied. Cloning of entanglement is studied using a nonlocal optimal universal asymmetric cloning machine and we show that the symmetric machine optimally copies the entanglement. The ``many-to-many'' teleportation scheme is applied in order to distribute entanglement shared between two observers to two pairs of spatially separated observers.

arXiv:quant-ph/0303060•Physical Review A•Jan 29, 2003•75 citations

Multi-output programmable quantum processor

Ya‐Fei Yu, Jian Feng, Mingsheng Zhan

By combining telecloning and the programmable quantum gate array presented by Nielsen and Chuang [Phys. Rev. Lett. 79, 321 (1997)], we propose a programmable quantum processor which can be programmed to implement a restricted set of operations with several identical data outputs. The outputs are approximately transformed versions of input data. The processor successes with certain probability.

arXiv:quant-ph/0209069•Physical Review A•Nov 19, 2002•21 citations

Experimental realization of 1→2 asymmetric phase-covariant quantum cloning

Hongwei Chen, Xianyi Zhou, Dieter Suter +1 more

While exact cloning of an unknown quantum state is prohibited by the linearity of quantum mechanics, approximate cloning is possible and has been used, e.g., to derive limits on the security of quantum communication protocols. In the case of asymmetric cloning, the information from the input state is distributed asymmetrically between the different output states. Here, we consider asymmetric phase-covariant cloning, where the goal is to optimally transfer the phase information from a single input qubit to different output qubits. We construct an optimal quantum cloning machine for two qubits that does not require ancilla qubits and implement it on an NMR quantum information processor.

arXiv:quant-ph/0612132•Physical Review A•Jan 17, 2007•69 citations

Probabilistic implementation of universal quantum processors

Mark S. Hillery, Vladimír Bužek, Mário Ziman

We present a probabilistic quantum processor for qudits on a single qudit of dimension N. The processor itself is represented by a fixed array of gates. The input of the processor consists of two registers. In the program register the set of instructions (program) is encoded. This program is applied to the data register. The processor can perform any operation on a single qudit of dimension N with a certain probability. For a general unitary operation, the probability is ${1/N}^{2},$ but for more restricted sets of operators the probability can be higher. In fact, this probability can be independent of the dimension of the qudit Hilbert space of the qudit under some conditions.

arXiv:quant-ph/0106088•Physical Review A•Jan 3, 2002•79 citations

Faithful Telecloning with Multiparticle Entanglement

Gu Yong-Jian, Yi-Zhuang Zheng, Libing Chen +1 more

We study the 1→ N faithful telecloning of two linear-independent states of a one-qubit system. Based on the analysis of the probabilistic cloning machine, we construct a multiparticle entangled state, and present a telecloning scheme under local operations and classical communication (LOCC). The success probability is greater than half of the optimal probability of the probabilistic cloning machine. Specifically, we show how to prepare the three-particle entangled state needed by 1→2 telecloning under LOCC using the Greenberger-Horne-Zeilinger state as a resource. All the operations in 1→2 telecloning are within the reach of current technology.

Chinese Physics Letters•May 28, 2002•7 citations

Faithful Telecloning with Multiparticle Entanglement

顾永建, 郑亦庄

We study the 1→N faithful telecloning of two linear-independent states of a one-qubit system.Based on the analysis of the probabilistic cloning machine,we construct a multiparticle entangled state,and present a telecloning scheme under local operations and classical communication (LOCC).The success probability is greater than half of the optimal probability of the probabilistic cloning machine.Specifically,we show how to prepare the three-particle entangled state meeded by 1→2 telecloning under LOCC using the Greenberger-Horne-Zeilinger state as a resource.All the operations in 1→2 telecloning are within the reach of current technology.

Chinese Physics Letters•Jan 1, 2002•0 citations
We propose two different implementations of an asymmetric two-output probabilistic quantum processor, which can implement a restricted set of one-qubit operations. One of them is constructed by combining asymmetric telecloning with a quantum gate array. We analyze the efficiency of this processor by evaluating the fidelities between the desired operation and the one generated by the processor and show that the two output states are the same as the ones produced by the optimal universal asymmetric Pauli cloning machine. The schemes require only local operations and classical communication, they have the advantage of transmitting the two output states directly to two spatially separated receivers but they have a success probability of 1/2. We show further that we can perform the same one-qubit operation with unity probability at the cost of using nonlocal operations. We finally generalize the two schemes for D-level systems and find that the local ones are successful with a probability of 1/D and the nonlocal generalized scheme is always successful.
We propose a generalization of quantum teleportation: the so-called many-to-many quantum communication of the information of a d-level system from N spatially separated senders to M>NM>NM>N receivers situated at different locations. We extend the concept of asymmetric telecloning from qubits to d-dimensional systems. We investigate the broadcasting of entanglement by using local $\stackrel{\ensuremath{\rightarrow}}{1}2$ optimal universal asymmetric Pauli machines and show that the maximal fidelities of the two final entangled states are obtained when symmetric machines are applied. Cloning of entanglement is studied using a nonlocal optimal universal asymmetric cloning machine and we show that the symmetric machine optimally copies the entanglement. The ``many-to-many'' teleportation scheme is applied in order to distribute entanglement shared between two observers to two pairs of spatially separated observers.
While exact cloning of an unknown quantum state is prohibited by the linearity of quantum mechanics, approximate cloning is possible and has been used, e.g., to derive limits on the security of quantum communication protocols. In the case of asymmetric cloning, the information from the input state is distributed asymmetrically between the different output states. Here, we consider asymmetric phase-covariant cloning, where the goal is to optimally transfer the phase information from a single input qubit to different output qubits. We construct an optimal quantum cloning machine for two qubits that does not require ancilla qubits and implement it on an NMR quantum information processor.
We present a probabilistic quantum processor for qudits on a single qudit of dimension N. The processor itself is represented by a fixed array of gates. The input of the processor consists of two registers. In the program register the set of instructions (program) is encoded. This program is applied to the data register. The processor can perform any operation on a single qudit of dimension N with a certain probability. For a general unitary operation, the probability is 1/N2,{1/N}^{2},1/N2, but for more restricted sets of operators the probability can be higher. In fact, this probability can be independent of the dimension of the qudit Hilbert space of the qudit under some conditions.
We study the 1→ N faithful telecloning of two linear-independent states of a one-qubit system. Based on the analysis of the probabilistic cloning machine, we construct a multiparticle entangled state, and present a telecloning scheme under local operations and classical communication (LOCC). The success probability is greater than half of the optimal probability of the probabilistic cloning machine. Specifically, we show how to prepare the three-particle entangled state needed by 1→2 telecloning under LOCC using the Greenberger-Horne-Zeilinger state as a resource. All the operations in 1→2 telecloning are within the reach of current technology.
We study the 1→N faithful telecloning of two linear-independent states of a one-qubit system.Based on the analysis of the probabilistic cloning machine,we construct a multiparticle entangled state,and present a telecloning scheme under local operations and classical communication (LOCC).The success probability is greater than half of the optimal probability of the probabilistic cloning machine.Specifically,we show how to prepare the three-particle entangled state meeded by 1→2 telecloning under LOCC using the Greenberger-Horne-Zeilinger state as a resource.All the operations in 1→2 telecloning are within the reach of current technology.