Quantum cost of dense coding and teleportation
- URL: http://arxiv.org/abs/2202.12544v1
- Date: Fri, 25 Feb 2022 08:15:55 GMT
- Title: Quantum cost of dense coding and teleportation
- Authors: Xinyu Qiu and Lin Chen
- Abstract summary: We show that the quantum cost of d-dimensional dense coding protocol is equal to d+3 when transmitting the classical message.
In contrast, the quantum cost of high-dimensional teleportation protocols is equal to 13, which is the maximum value of the cost for the two-dimensional case.
- Score: 7.238541917115604
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The quantum cost is a key ingredient to evaluate the quality of quantum
protocols from a practical viewpoint. We show that the quantum cost of
d-dimensional dense coding protocol is equal to d+3 when transmitting the
classical message (0,0), and that is equal to d+4 when transmitting other
classical message. It appears linear growth with the dimension and thus makes
sense for implementation. In contrast, the quantum cost of high-dimensional
teleportation protocols is equal to 13, which is the maximum value of the cost
for the two-dimensional case. As an application, we establish the relation
between the quantum cost and fidelity of dense coding protocols in terms of
four typical noise scenario.
Related papers
- Bounding the classical cost of simulating quantum behaviors in the prepare-and-measure scenario [0.0]
We study the prepare-and-measure scenario in which Alice transmits a quantum system to Bob, who then performs a quantum measurement.<n>We show that the communication cost can be reduced to an average of $1.89$ bits.
arXiv Detail & Related papers (2026-03-01T20:18:43Z) - Quantum-Processing-Assisted Classical Communications [0.6849746341453253]
We describe a general quantum receiver protocol that maps laser-light-modulated classical communications signals into quantum processors.<n>We show that a small quantum receiver of 4 qubits with loss rates of $sim 2%$ and quantum gate errors of $sim 0.02%$ can provide a $10$ percent gain in the communications rate in the weak signal limit.
arXiv Detail & Related papers (2025-06-19T16:57:11Z) - Simultaneous Multiparty Quantum Teleportation Supervised by a Controller [0.2302001830524133]
Quantum network harbours a technology of multiparty transmission and computation of quantum information.
We design a quantum circuit comprising of Hadamard and controlled-Not gates for preparation of a cluster state of symmetric and antisymmetric Bell pairs.
This seventeen qubits quantum channel is employed to strategize a simultaneous multiparty (quattro directional) quantum teleportation protocol.
arXiv Detail & Related papers (2024-09-27T12:20:25Z) - Optimal unilocal virtual quantum broadcasting [5.80377843790023]
We introduce protocols that can be approximated using physical operations with minimal cost.
We formalize the simulation cost of a virtual quantum broadcasting protocol into a semidefinite programming problem.
arXiv Detail & Related papers (2023-10-23T17:56:02Z) - Low-Dissipation Data Bus via Coherent Quantum Dynamics [2.0299248281970956]
In quantum computing the transfer of information must be coherent to preserve quantum states and hence the quantum information.
We establish a simple protocol for transferring one- and two-electron encoded logical qubits in quantum dot arrays.
This protocol could reduce the cooling requirements and constraints on scalable architectures for quantum dot quantum computers.
arXiv Detail & Related papers (2023-04-05T12:07:02Z) - Experimental realization of a three-photon asymmetric maximally
entangled state and its application to quantum teleportation [0.0]
We have experimentally prepared a special high-dimensional entangled state, the so-called three-photon asymmetric maximally entangled state.
We have also implemented a proof-of-principle quantum teleportation experiment, realizing the transfer of quantum information from two qubits to a single ququart.
arXiv Detail & Related papers (2022-12-01T14:52:16Z) - Quantum Semantic Communications for Resource-Efficient Quantum Networking [52.3355619190963]
This letter proposes a novel quantum semantic communications (QSC) framework exploiting advancements in quantum machine learning and quantum semantic representations.
The proposed framework achieves approximately 50-75% reduction in quantum communication resources needed, while achieving a higher quantum semantic fidelity.
arXiv Detail & Related papers (2022-05-05T03:49:19Z) - Configurable sublinear circuits for quantum state preparation [1.9279780052245203]
We show a configuration that encodes an $N$-dimensional state by a quantum circuit with $O(sqrtN)$ width and depth and entangled information in ancillary qubits.
We show a proof-of-principle on five quantum computers and compare the results.
arXiv Detail & Related papers (2021-08-23T13:52:43Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z) - Depth-efficient proofs of quantumness [77.34726150561087]
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover.
In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
arXiv Detail & Related papers (2021-07-05T17:45:41Z) - Path-encoded high-dimensional quantum communication over a 2 km
multicore fiber [50.591267188664666]
We demonstrate the reliable transmission over a 2 km long multicore fiber of path-encoded high-dimensional quantum states.
A stable interferometric detection is guaranteed, allowing for low error rates and the generation of 6.3 Mbit/s of secret key rate.
arXiv Detail & Related papers (2021-03-10T11:02:45Z) - Quantum Gram-Schmidt Processes and Their Application to Efficient State
Read-out for Quantum Algorithms [87.04438831673063]
We present an efficient read-out protocol that yields the classical vector form of the generated state.
Our protocol suits the case that the output state lies in the row space of the input matrix.
One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
arXiv Detail & Related papers (2020-04-14T11:05:26Z) - Communication Cost of Quantum Processes [49.281159740373326]
A common scenario in distributed computing involves a client who asks a server to perform a computation on a remote computer.
An important problem is to determine the minimum amount of communication needed to specify the desired computation.
We analyze the total amount of (classical and quantum) communication needed by a server in order to accurately execute a quantum process chosen by a client.
arXiv Detail & Related papers (2020-02-17T08:51:42Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.