This HTML5 document contains 44 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n13http://localhost/temp/predkladatel/
n11http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F61989592%3A15310%2F05%3A00002241%21RIV06-MSM-15310___/
n10http://linked.opendata.cz/resource/domain/vavai/projekt/
n5http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n15http://linked.opendata.cz/ontology/domain/vavai/
n19http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n16http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n17http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F61989592%3A15310%2F05%3A00002241%21RIV06-MSM-15310___
rdf:type
n15:Vysledek skos:Concept
dcterms:description
We present an iterative algorithm that finds the optimal measurement for extracting the accessible information in any quantum communication scenario. The maximization is achieved by a steepest-ascent approach toward the extremal point, following the gradient uphill in sufficiently small steps. We apply it to a simple ad hoc example, as well as to a problem with a bearing on the security of a tomographic protocol for quantum key distribution. We present an iterative algorithm that finds the optimal measurement for extracting the accessible information in any quantum communication scenario. The maximization is achieved by a steepest-ascent approach toward the extremal point, following the gradient uphill in sufficiently small steps. We apply it to a simple ad hoc example, as well as to a problem with a bearing on the security of a tomographic protocol for quantum key distribution. Je navržen nový iterační postup pro maximalizaci vzájemné informace a aplikován na prakticky důležitý problém bezpečnosti kvantové distribuce klíče v kvantové kryptografii.
dcterms:title
Iterative procedure for computing accessible information in quantum communication Iterační algoritmus pro výpočet vzájemné informace v kvantových komunikacích Iterative procedure for computing accessible information in quantum communication
skos:prefLabel
Iterative procedure for computing accessible information in quantum communication Iterační algoritmus pro výpočet vzájemné informace v kvantových komunikacích Iterative procedure for computing accessible information in quantum communication
skos:notation
RIV/61989592:15310/05:00002241!RIV06-MSM-15310___
n3:strany
054303-1-054303-4
n3:aktivita
n9:Z n9:P
n3:aktivity
P(LN00A015), Z(MSM6198959213)
n3:cisloPeriodika
5
n3:dodaniDat
n17:2006
n3:domaciTvurceVysledku
n5:6180523
n3:druhVysledku
n14:J
n3:duvernostUdaju
n7:S
n3:entitaPredkladatele
n11:predkladatel
n3:idSjednocenehoVysledku
525793
n3:idVysledku
RIV/61989592:15310/05:00002241
n3:jazykVysledku
n16:eng
n3:klicovaSlova
iterative procedure; computing accessible information
n3:klicoveSlovo
n4:computing%20accessible%20information n4:iterative%20procedure
n3:kodStatuVydavatele
US - Spojené státy americké
n3:kontrolniKodProRIV
[B8045A4C7570]
n3:nazevZdroje
Physical Review A
n3:obor
n12:BH
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
3
n3:projekt
n10:LN00A015
n3:rokUplatneniVysledku
n17:2005
n3:svazekPeriodika
71
n3:tvurceVysledku
Englert, Berthold-Georg Kaszlikowski, Dagomir Řeháček, Jaroslav
n3:zamer
n19:MSM6198959213
s:issn
1050-2947
s:numberOfPages
116
n13:organizacniJednotka
15310