Optimal probabilistic dense coding schemes

Página do item simplificado
dc.creatorRoger Alfredo Kögler
dc.creatorLeonardo Teixeira Neves
dc.date.accessioned2025-02-23T18:12:34Z
dc.date.accessioned2025-09-08T23:24:31Z
dc.date.available2025-02-23T18:12:34Z
dc.date.issued2017
dc.description.sponsorshipCNPq - Conselho Nacional de Desenvolvimento Científico e Tecnológico
dc.description.sponsorshipFAPEMIG - Fundação de Amparo à Pesquisa do Estado de Minas Gerais
dc.identifier.doihttps://doi.org/10.1007/s11128-017-1545-7
dc.identifier.issn1573-1332
dc.identifier.urihttps://hdl.handle.net/1843/80343
dc.languageeng
dc.publisherUniversidade Federal de Minas Gerais
dc.relation.ispartofQuantum Information Processing
dc.rightsAcesso Restrito
dc.subjectTeoria da codificação
dc.subject.otherDense coding
dc.subject.otherQuantum-state separation
dc.subject.otherMaximum-confidence measurements
dc.subject.otherMultistage decoding
dc.titleOptimal probabilistic dense coding schemes
dc.typeArtigo de periódico
local.citation.epage22
local.citation.spage1
local.citation.volume16
local.description.resumoDense coding with non-maximally entangled states has been investigated in many different scenarios. We revisit this problem for protocols adopting the standard encoding scheme. In this case, the set of possible classical messages cannot be perfectly distinguished due to the non-orthogonality of the quantum states carrying them. So far, the decoding process has been approached in two ways: (i) The message is always inferred, but with an associated (minimum) error; (ii) the message is inferred without error, but only sometimes; in case of failure, nothing else is done. Here, we generalize on these approaches and propose novel optimal probabilistic decoding schemes. The first uses quantum-state separation to increase the distinguishability of the messages with an optimal success probability. This scheme is shown to include (i) and (ii) as special cases and continuously interpolate between them, which enables the decoder to trade-off between the level of confidence desired to identify the received messages and the success probability for doing so. The second scheme, called multistage decoding, applies only for qudits (d-level quantum systems with d > 2) and consists of further attempts in the state identification process in case of failure in the first one. We show that this scheme is advantageous over (ii) as it increases the mutual information between the sender and receiver.
local.identifier.orcidhttps://orcid.org/0000-0002-6409-761X
local.identifier.orcidhttps://orcid.org/0000-0002-9589-1939
local.publisher.countryBrasil
local.publisher.departmentICX - DEPARTAMENTO DE FÍSICA
local.publisher.initialsUFMG
local.url.externahttps://link.springer.com/article/10.1007/s11128-017-1545-7#citeas

Arquivos

Licença do pacote

Agora exibindo 1 - 1 de 1
Imagem de Miniatura
Nome:
License.txt
Tamanho:
1.99 KB
Formato:
Plain Text
Descrição:
Baixar

Coleções

Artigo de Periódico

Logo UFMG