Enhanced Optimal Quantum Communication by Generalized Phase Shift Keying
Coherent Signal
- URL: http://arxiv.org/abs/2112.14425v1
- Date: Wed, 29 Dec 2021 07:13:50 GMT
- Title: Enhanced Optimal Quantum Communication by Generalized Phase Shift Keying
Coherent Signal
- Authors: Min Namkung and Jeong San Kim
- Abstract summary: We consider the quantum communication with $N$-ary phase shift keying ($N$-PSK) signal for an arbitrary positive integer $N>1$.
Unlike the binary case, we show that even super-Poissonianity of non-standard coherent state can improve the maximal success probability of $N$-PSK quantum communication.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: It is well known that the maximal success probability of the binary quantum
communication can be improved by using a sub-Poissonian non-standard coherent
state as an information carrier. In the present article, we consider the
quantum communication with $N$-ary phase shift keying ($N$-PSK) signal for an
arbitrary positive integer $N>1$. By using non-standard coherent state, we
analytically provide the maximal success probability of the quantum
communication with $N$-PSK. Unlike the binary case, we show that even
super-Poissonianity of non-standard coherent state can improve the maximal
success probability of $N$-PSK quantum communication.
Related papers
- The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the extreme multimode bosonic Gaussian channels [53.253900735220796]
Inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes.
Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime.
arXiv Detail & Related papers (2024-10-18T13:59:50Z) - General Communication Enhancement via the Quantum Switch [15.779145740528417]
We conjecture that $mathcalP_n>0$ is both a necessary and sufficient condition for communication enhancement via the quantum $tt SWITCH$.
We then formulate a communication protocol involving the quantum $tt SWITCH$ which enhances the private capacity of the BB84 channel.
arXiv Detail & Related papers (2024-07-03T00:47:13Z) - Communication Complexity of Common Randomness Generation with Isotropic
States [5.312109949216557]
The paper considers two communication models -- one-way classical communication and one-way quantum communication.
We show that in the case of classical communication, quantum isotropic states have no advantage over noisy classical correlation.
In the case of quantum communication, we demonstrate that the common randomness rate can be increased by using superdense coding on quantum isotropic states.
arXiv Detail & Related papers (2023-11-08T14:48:15Z) - Gaussian conversion protocol for heralded generation of qunaught states [66.81715281131143]
bosonic codes map qubit-type quantum information onto the larger bosonic Hilbert space.
We convert between two instances of these codes GKP qunaught states and four-foldsymmetric binomial states corresponding to a zero-logical encoded qubit.
We obtain GKP qunaught states with a fidelity of over 98% and a probability of approximately 3.14%.
arXiv Detail & Related papers (2023-01-24T14:17:07Z) - 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) - High Fidelity Quantum State Transfer by Pontryagin Maximum Principle [68.8204255655161]
We address the problem of maximizing the fidelity in a quantum state transformation process satisfying the Liouville-von Neumann equation.
By introducing fidelity as the performance index, we aim at maximizing the similarity of the final state density operator with the one of the desired target state.
arXiv Detail & Related papers (2022-03-07T13:27:26Z) - One-shot quantum state redistribution and quantum Markov chains [15.66921140731163]
We revisit the task of quantum state redistribution in the one-shot setting.
We design a protocol for this task with communication cost in terms of a measure of distance from quantum Markov chains.
Our result is the first to operationally connect quantum state redistribution and quantum chains.
arXiv Detail & Related papers (2021-04-18T07:34:22Z) - Direct Quantum Communications in the Presence of Realistic Noisy
Entanglement [69.25543534545538]
We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement.
Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
arXiv Detail & Related papers (2020-12-22T13:06:12Z) - Fault-tolerant Coding for Quantum Communication [71.206200318454]
encode and decode circuits to reliably send messages over many uses of a noisy channel.
For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable.
Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
arXiv Detail & Related papers (2020-09-15T15:10:50Z) - A comparison between quantum and classical noise radar sources [0.07829352305480283]
We compare the performance of a quantum radar based on two-mode squeezed states with a classical radar system based on correlated thermal noise.
With a constraint of equal number of photons $N_S$ transmitted to probe the environment, we find that the quantum setup exhibits an advantage with respect to its classical counterpart.
arXiv Detail & Related papers (2020-08-28T15:45:34Z)
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.