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

International Journal of Quantum Information

CLASSICAL COMMUNICATION COSTS IN QUANTUM INFORMATION PROCESSING

MING-XING LUO, Xiu‐Bo Chen, Yixian Yang, Xinxin Niu

Published Jun 15, 2011• 4 citations
Publisher

Abstract

Classical communication plays an important role in quantum information processing such as remote state preparation and quantum teleportation. First, in this paper, we present some simple faithful remote state preparation of an arbitrary n-qubit state by constructing entanglement resources and special measurement basis for the sender. Then to weigh the classical resource required, we present an information-theoretical model to evaluate the classical communication cost. By optimizing the classical communication in quantum protocols, we obtain the optimal classical communication cost. This model can also be applied to the quantum teleportation. Moreover, based on the present computation model, we reinvestigate some remote state preparation and teleportation protocols in which the classical communication cost was imperfectly computed. Finally, some problems will be presented.

DOI
10.1142/s0219749911007952

Related papers

Remote Preparation of Quantum States

C.H. Bennett, Patrick M. Hayden, Debbie Leung +2 more

Remote state preparation is the variant of quantum state teleportation in which the sender knows the quantum state to be communicated. The original paper introducing teleportation established minimal requirements for classical communication and entanglement but the corresponding limits for remote state preparation have remained unknown until now: previous work has shown, however, that it not only requires less classical communication but also gives rise to a tradeoff between these two resources in the appropriate setting. We discuss this problem from first principles, including the various choices one may follow in the definitions of the actual resources. Our main result is a general method of remote state preparation for arbitrary states of many qubits, at a cost of 1 bit of classical communication and 1 bit of entanglement per qubit sent. In this "universal" formulation, these ebit and cbit requirements are shown to be simultaneously optimal by exhibiting a dichotomy. Our protocol then yields the exact tradeoff curve for memoryless sources of pure states (including the case of incomplete knowledge of the ensemble probabilities), based on the recently established quantum-classical tradeoff for visible quantum data compression. A variation of that method allows us to solve the even more general problem of preparing entangled states between sender and receiver (i.e., purifications of mixed state ensembles). The paper includes an extensive discussion of our results, including the impact of the choice of model on the resources, the topic of obliviousness, and an application to private quantum channels and quantum data hiding.

arXiv:quant-ph/0307100•IEEE Transactions on Information Theory•Jan 1, 2005•143 citations

Remote State Preparation

Charles H. Bennett, David Peter Divincenzo, Peter W. Shor +3 more

Quantum teleportation uses prior entanglement and forward classical communication to transmit one instance of an unknown quantum state. Remote state preparation (RSP) has the same goal, but the sender knows classically what state is to be transmitted. We show that the asymptotic classical communication cost of RSP is one bit per qubit--half that of teleportation--and even less when transmitting part of a known entangled state. We explore the tradeoff between entanglement and classical communication required for RSP, and discuss RSP capacities of general quantum channels.

arXiv:quant-ph/0006044•Physical Review Letters•Jul 26, 2001•848 citations

A.: Remote preparation of quantum states

Charles H. Bennett, Patrick M. Hayden, Debbie Leung +2 more

Abstract—Remote state preparation is the variant of quantum state teleportation in which the sender knows the quantum state to be communicated. The original paper introducing teleportation established minimal requirements for classical communication and entanglement but the corresponding limits for remote state preparation have remained unknown until now: previous work has shown, however, that it not only requires less classical communication but also gives rise to a tradeoff between these two resources in the appropriate setting. We discuss this problem from first principles, including the various choices one may follow in the definitions of the actual resources. Our main result is a general method of remote state preparation for arbitrary states of many qubits, at a cost of 1 bit of classical communication and 1 bit of entanglement per qubit sent. In this “universal ” formulation, these ebit and cbit requirements are shown to be simultaneously optimal by exhibiting a dichotomy. Our protocol then yields the exact tradeoff curve for memoryless sources of pure states (including the case of incomplete knowledge of the ensemble probabilities), based on the recently established quantum-classical tradeoff for visible quantum data compression. A variation of that method allows us to solve the even more general problem of preparing entangled states between sender and receiver (i.e., purifications of mixed state ensembles). The paper includes an extensive discussion of our results, including the impact of the choice of model on the resources, the topic of obliviousness, and an application to private quantum channels and quantum data hiding. Index Terms—Cryptography, entanglement, large deviations, teleportation, tradeoff. I.

•Jul 15, 2003•120 citations

The hidden cost of quantum teleportation and remote state preparation

R. Srikanth

The amount of information transferred during standard quantum teleportation or remote state preparation is equal to the preparation information of the transmitted state, rather than the classical communication required by respective protocol. This is shown by noting that the information required to specify the operation that verifies the transmitted state is identical to the preparation information, at the given level of precision m (in bits). Depending on the resolution of the projective Hilbert space, the preparation information can be made arbitrarily precise and hence indefinitely larger than the classical communication cost. Therefore, the classical communication is insufficient to account for the transfer of preparation information, which is then attributed to the Einstein-Podolsky-Rosen channel. Some fundamental repercussions for relativistic quantum information processing are briefly discussed.

arXiv:quant-ph/0104081•Apr 17, 2001•0 citations

Classical-communication cost in distributed quantum-information processing: A generalization of quantum-communication complexity

Hoi‐Kwong Lo

We study the amount of classical communication needed for distributed quantum-information processing. In particular, we introduce the concept of ``remote preparation'' of a quantum state. Given an ensemble of states, Alice's task is to help Bob in a distant laboratory to prepare a state of her choice. We find several examples of an ensemble with an entropy S where the remote preparation can be done with a communication cost lower than the amount $(2S)$ required by standard teleportation. We conjecture that, for an arbitrary N-dimensional pure state, its remote preparation requires $2{\mathrm{log}}_{2}N$ bits of classical communication, as in standard teleportation.

arXiv:quant-ph/9912009•Physical Review A•Jun 16, 2000•671 citations

Optimal teleportation fidelity and its deviation in noisy scenarios

Pratapaditya Bej, Saronath Halder, Ritabrata Sengupta

In this work, we study quantum teleportation, a fundamental protocol of quantum physics. In particular, we present a mathematical methodology to study the combined effects of noisy resource state and noisy classical communication on teleportation fidelity and its deviation. We describe a teleportation protocol where an arbitrary two-qubit state in canonical form is used as a resource. Thereafter, to teleport an unknown qubit, Alice measures her qubits in Bell basis and conveys the measurement outcome to Bob via noisy classical channel(s). We derive the exact formulae of optimal teleportation fidelity and corresponding fidelity deviation where the resource state and the classical communication, both can be noisy. To provide the proof of optimality, we provide a systematic method. We further find conditions for non-classical fidelity and dispersion-free teleportation for our teleportation protocol. In this way, we identify noisy environments where it is possible to achieve dispersion-free teleportation without compromising non-classical fidelity. We also demonstrate scenarios where the increase of entanglement in the resource state, may degrade the quality of teleportation — a counter-intuitive instance. Finally, we discuss about the minimum classical communication cost required to achieve non-classical fidelity for our protocol. Here we mainly focus on a possible way to optimize the classical communication cost.

arXiv:2102.01022•Modern Physics Letters A•Dec 14, 2023•2 citations
Classical communication plays an important role in quantum information processing such as remote state preparation and quantum teleportation. First, in this paper, we present some simple faithful remote state preparation of an arbitrary n-qubit state by constructing entanglement resources and special measurement basis for the sender. Then to weigh the classical resource required, we present an information-theoretical model to evaluate the classical communication cost. By optimizing the classical communication in quantum protocols, we obtain the optimal classical communication cost. This model can also be applied to the quantum teleportation. Moreover, based on the present computation model, we reinvestigate some remote state preparation and teleportation protocols in which the classical communication cost was imperfectly computed. Finally, some problems will be presented.
Remote state preparation is the variant of quantum state teleportation in which the sender knows the quantum state to be communicated. The original paper introducing teleportation established minimal requirements for classical communication and entanglement but the corresponding limits for remote state preparation have remained unknown until now: previous work has shown, however, that it not only requires less classical communication but also gives rise to a tradeoff between these two resources in the appropriate setting. We discuss this problem from first principles, including the various choices one may follow in the definitions of the actual resources. Our main result is a general method of remote state preparation for arbitrary states of many qubits, at a cost of 1 bit of classical communication and 1 bit of entanglement per qubit sent. In this "universal" formulation, these ebit and cbit requirements are shown to be simultaneously optimal by exhibiting a dichotomy. Our protocol then yields the exact tradeoff curve for memoryless sources of pure states (including the case of incomplete knowledge of the ensemble probabilities), based on the recently established quantum-classical tradeoff for visible quantum data compression. A variation of that method allows us to solve the even more general problem of preparing entangled states between sender and receiver (i.e., purifications of mixed state ensembles). The paper includes an extensive discussion of our results, including the impact of the choice of model on the resources, the topic of obliviousness, and an application to private quantum channels and quantum data hiding.
Quantum teleportation uses prior entanglement and forward classical communication to transmit one instance of an unknown quantum state. Remote state preparation (RSP) has the same goal, but the sender knows classically what state is to be transmitted. We show that the asymptotic classical communication cost of RSP is one bit per qubit--half that of teleportation--and even less when transmitting part of a known entangled state. We explore the tradeoff between entanglement and classical communication required for RSP, and discuss RSP capacities of general quantum channels.
Abstract—Remote state preparation is the variant of quantum state teleportation in which the sender knows the quantum state to be communicated. The original paper introducing teleportation established minimal requirements for classical communication and entanglement but the corresponding limits for remote state preparation have remained unknown until now: previous work has shown, however, that it not only requires less classical communication but also gives rise to a tradeoff between these two resources in the appropriate setting. We discuss this problem from first principles, including the various choices one may follow in the definitions of the actual resources. Our main result is a general method of remote state preparation for arbitrary states of many qubits, at a cost of 1 bit of classical communication and 1 bit of entanglement per qubit sent. In this “universal ” formulation, these ebit and cbit requirements are shown to be simultaneously optimal by exhibiting a dichotomy. Our protocol then yields the exact tradeoff curve for memoryless sources of pure states (including the case of incomplete knowledge of the ensemble probabilities), based on the recently established quantum-classical tradeoff for visible quantum data compression. A variation of that method allows us to solve the even more general problem of preparing entangled states between sender and receiver (i.e., purifications of mixed state ensembles). The paper includes an extensive discussion of our results, including the impact of the choice of model on the resources, the topic of obliviousness, and an application to private quantum channels and quantum data hiding. Index Terms—Cryptography, entanglement, large deviations, teleportation, tradeoff. I.
The amount of information transferred during standard quantum teleportation or remote state preparation is equal to the preparation information of the transmitted state, rather than the classical communication required by respective protocol. This is shown by noting that the information required to specify the operation that verifies the transmitted state is identical to the preparation information, at the given level of precision m (in bits). Depending on the resolution of the projective Hilbert space, the preparation information can be made arbitrarily precise and hence indefinitely larger than the classical communication cost. Therefore, the classical communication is insufficient to account for the transfer of preparation information, which is then attributed to the Einstein-Podolsky-Rosen channel. Some fundamental repercussions for relativistic quantum information processing are briefly discussed.
We study the amount of classical communication needed for distributed quantum-information processing. In particular, we introduce the concept of ``remote preparation'' of a quantum state. Given an ensemble of states, Alice's task is to help Bob in a distant laboratory to prepare a state of her choice. We find several examples of an ensemble with an entropy S where the remote preparation can be done with a communication cost lower than the amount (2S)(2S)(2S) required by standard teleportation. We conjecture that, for an arbitrary N-dimensional pure state, its remote preparation requires 2log2N2{\mathrm{log}}_{2}N2log2​N bits of classical communication, as in standard teleportation.
In this work, we study quantum teleportation, a fundamental protocol of quantum physics. In particular, we present a mathematical methodology to study the combined effects of noisy resource state and noisy classical communication on teleportation fidelity and its deviation. We describe a teleportation protocol where an arbitrary two-qubit state in canonical form is used as a resource. Thereafter, to teleport an unknown qubit, Alice measures her qubits in Bell basis and conveys the measurement outcome to Bob via noisy classical channel(s). We derive the exact formulae of optimal teleportation fidelity and corresponding fidelity deviation where the resource state and the classical communication, both can be noisy. To provide the proof of optimality, we provide a systematic method. We further find conditions for non-classical fidelity and dispersion-free teleportation for our teleportation protocol. In this way, we identify noisy environments where it is possible to achieve dispersion-free teleportation without compromising non-classical fidelity. We also demonstrate scenarios where the increase of entanglement in the resource state, may degrade the quality of teleportation — a counter-intuitive instance. Finally, we discuss about the minimum classical communication cost required to achieve non-classical fidelity for our protocol. Here we mainly focus on a possible way to optimize the classical communication cost.