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:1306.0981 · Quantum Information Processing

Maximal noiseless code rates for collective rotation channels on qudits

Chi-Kwong Li, Mikio Nakahara, Yiu‐Tung Poon, Nung-Sing Sze

Published Sep 2, 2015• 3 citations
arXivHTMLPDF
DOI
10.1007/s11128-015-1101-2

Related papers

Asymmetric quantum codes with high code rates

Xilin Tang, Weixian Li, Wei Zhao

Quantum Information Processing•Oct 10, 2022•1 citation

Dimensional advantage in secure information trading via the noisy dense-coding protocol

Ayan Patra, Rivu Gupta, Tamoghna Das +1 more

The quantum dense-coding (DC) protocol, which has no security feature, deals with the transmission of classical information encoded in a quantum state by using shared entanglement between a single sender and a single receiver. Its appropriate variant has been established as a quantum key distribution (QKD) scheme for shared two-qubit maximally entangled states, with the security proof utilizing the uncertainty relation of complementary observables and the Shor-Preskill entanglement purification scheme. We present the DC-based QKD protocol for higher-dimensional systems and report the lower bounds on the secret key rate, when the shared state is a two-qudit maximally entangled state, and mixtures of maximally entangled states with different ranks. The analysis also includes the impact of noisy channels on the secure key rates, before and after encoding. In both the noiseless and the noisy scenarios, we demonstrate that the key rate as well as the robustness of the protocol against noise increases with the dimension. Further, we prove that the set of useless states in the DC-based QKD protocol is convex and compact.

arXiv:2310.20688•Physical Review A•Sep 16, 2024•7 citations

1/2+1/2>1 for quantum error correction

Zhuo Wang, Sixia Yu, Heng Fan +1 more

Quantum error correction assisted by entanglement helps to transmit the encoded qudits through quantum channels with some of them being noiseless. Here we consider a more realistic scheme for experiments what we called as partial-noisy quantum channels in which, instead of completely free of noise, only part of the qudit suffers no noise. In this scenario we show by an explicit example that two half-noisy channels work better than one noiseless channel, a queer phenomenon showing 1/2+1/2>1. Our example also saturates a unified quantum Singleton bound, valid for the standard and entanglement-assisted codes as well. Furthermore, as illustrated by a mixed-alphabet code with half-noisy channels, a higher dimensional physical qudit can so improve the performance of a partial-noisy channel that it even outperforms a noiseless channel.

arXiv:1208.6529•Aug 31, 2012•0 citations

A recursive construction of noiseless subsystem for qudits

Utkan G ung ord u, Chi-Kwong Li, Mikio Nakahara +2 more

Bulletin of the American Physical Society•Mar 4, 2014•0 citations

A distribution scheme for qubit over collective-noise channel

Takashi Yamamoto, Junichi Shimamura, Ryoji Nagase +3 more

Conference on Lasers and Electro-Optics•Jan 1, 2005•0 citations

Recursive encoding and decoding of the noiseless subsystem for qudits

Utkan Güngördü, Chi-Kwong Li, Mikio Nakahara +2 more

We give a full explanation of the noiseless subsystem that protects a single qubit against collective errors and the corresponding recursive scheme described by C.-K. Li et al. [Phys. Rev. A 84, 044301 (2011)] from a representation theory point of view. Furthermore, we extend the construction to qudits under the influence of collective SU($d$) errors. We find that under this recursive scheme, the asymptotic encoding rate is $1/d$.

arXiv:1310.4401•Physical Review A•Apr 2, 2014•2 citations
The quantum dense-coding (DC) protocol, which has no security feature, deals with the transmission of classical information encoded in a quantum state by using shared entanglement between a single sender and a single receiver. Its appropriate variant has been established as a quantum key distribution (QKD) scheme for shared two-qubit maximally entangled states, with the security proof utilizing the uncertainty relation of complementary observables and the Shor-Preskill entanglement purification scheme. We present the DC-based QKD protocol for higher-dimensional systems and report the lower bounds on the secret key rate, when the shared state is a two-qudit maximally entangled state, and mixtures of maximally entangled states with different ranks. The analysis also includes the impact of noisy channels on the secure key rates, before and after encoding. In both the noiseless and the noisy scenarios, we demonstrate that the key rate as well as the robustness of the protocol against noise increases with the dimension. Further, we prove that the set of useless states in the DC-based QKD protocol is convex and compact.
Quantum error correction assisted by entanglement helps to transmit the encoded qudits through quantum channels with some of them being noiseless. Here we consider a more realistic scheme for experiments what we called as partial-noisy quantum channels in which, instead of completely free of noise, only part of the qudit suffers no noise. In this scenario we show by an explicit example that two half-noisy channels work better than one noiseless channel, a queer phenomenon showing 1/2+1/2>1. Our example also saturates a unified quantum Singleton bound, valid for the standard and entanglement-assisted codes as well. Furthermore, as illustrated by a mixed-alphabet code with half-noisy channels, a higher dimensional physical qudit can so improve the performance of a partial-noisy channel that it even outperforms a noiseless channel.
We give a full explanation of the noiseless subsystem that protects a single qubit against collective errors and the corresponding recursive scheme described by C.-K. Li et al. [Phys. Rev. A 84, 044301 (2011)] from a representation theory point of view. Furthermore, we extend the construction to qudits under the influence of collective SU(ddd) errors. We find that under this recursive scheme, the asymptotic encoding rate is 1/d1/d1/d.