Holevo's theorem (original) (raw)
Holevo's theorem is an important limitative theorem in quantum computing, an interdisciplinary field of physics and computer science. It is sometimes called Holevo's bound, since it establishes an upper bound to the amount of information that can be known about a quantum state (accessible information). It was published by Alexander Holevo in 1973.
| Property | Value |
|---|---|
| dbo:abstract | Holevo's theorem is an important limitative theorem in quantum computing, an interdisciplinary field of physics and computer science. It is sometimes called Holevo's bound, since it establishes an upper bound to the amount of information that can be known about a quantum state (accessible information). It was published by Alexander Holevo in 1973. (en) Il teorema di Holevo, pubblicato da nel 1973, assume rilievo in fisica, soprattutto nel campo dell'informazione quantistica. È a volte chiamato limite di Holevo, dal momento che esso stabilisce un limite superiore. Secondo il teorema, l'informazione accessibile data da uno stato quantistico è limitata dalla sua informazione di Holevo: dove è l'entropia di von Neumann e sono gli stati usati per codificare l'informazione sotto la distribuzione . In pratica questo teorema prova che n qubits possono rappresentare solo fino a n bits classici (non codificati in modo quantistico). (it) Теорема Холево — важная ограничивающая теорема в области квантовых вычислений, междисциплинарной области физики и информатики. Её иногда называют границей Холево, поскольку теорема устанавливает верхнюю границу на количество информации, которую можно узнать о квантовом состоянии (доступная информация). Теорему опубликовал Александр Семёнович Холево в 1973 году. (ru) |
| dbo:wikiPageID | 5687865 (xsd:integer) |
| dbo:wikiPageLength | 10362 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1119168471 (xsd:integer) |
| dbo:wikiPageWikiLink | dbc:Limits_of_computation dbr:Quantum_state dbr:Qubit dbr:Partial_trace dbr:Alice_and_Bob dbr:Joint_probability_distribution dbr:Upper_bound dbr:Von_Neumann_entropy dbr:Quantum_computing dbr:Quantum_instrument dbr:Quantum_Computation_and_Quantum_Information_(book) dbr:Complex_number dbr:POVM dbr:Entropy_(information_theory) dbr:Mutual_information dbc:Quantum_information_theory dbr:Completely_positive_map dbr:Computer_science dbr:Density_matrix dbr:Physics dbr:Quantum_channel dbr:Alexander_Holevo dbc:Quantum_mechanical_entropy dbr:Random_variable dbr:Bit dbr:Superdense_coding dbr:Quantum_mutual_information dbr:Quantum_measurement |
| dbp:wikiPageUsesTemplate | dbt:Cite_arXiv dbt:Cite_book dbt:Cite_journal dbt:Reflist dbt:Short_description dbt:Use_American_English dbt:Quantum_computing |
| dcterms:subject | dbc:Limits_of_computation dbc:Quantum_information_theory dbc:Quantum_mechanical_entropy |
| gold:hypernym | dbr:Theorem |
| rdfs:comment | Holevo's theorem is an important limitative theorem in quantum computing, an interdisciplinary field of physics and computer science. It is sometimes called Holevo's bound, since it establishes an upper bound to the amount of information that can be known about a quantum state (accessible information). It was published by Alexander Holevo in 1973. (en) Il teorema di Holevo, pubblicato da nel 1973, assume rilievo in fisica, soprattutto nel campo dell'informazione quantistica. È a volte chiamato limite di Holevo, dal momento che esso stabilisce un limite superiore. Secondo il teorema, l'informazione accessibile data da uno stato quantistico è limitata dalla sua informazione di Holevo: dove è l'entropia di von Neumann e sono gli stati usati per codificare l'informazione sotto la distribuzione . In pratica questo teorema prova che n qubits possono rappresentare solo fino a n bits classici (non codificati in modo quantistico). (it) Теорема Холево — важная ограничивающая теорема в области квантовых вычислений, междисциплинарной области физики и информатики. Её иногда называют границей Холево, поскольку теорема устанавливает верхнюю границу на количество информации, которую можно узнать о квантовом состоянии (доступная информация). Теорему опубликовал Александр Семёнович Холево в 1973 году. (ru) |
| rdfs:label | Teorema di Holevo (it) Holevo's theorem (en) Теорема Холево (ru) |
| owl:sameAs | freebase:Holevo's theorem wikidata:Holevo's theorem dbpedia-it:Holevo's theorem dbpedia-ru:Holevo's theorem https://global.dbpedia.org/id/3gsWf |
| prov:wasDerivedFrom | wikipedia-en:Holevo's_theorem?oldid=1119168471&ns=0 |
| foaf:isPrimaryTopicOf | wikipedia-en:Holevo's_theorem |
| is dbo:knownFor of | dbr:Alexander_Holevo |
| is dbo:wikiPageRedirects of | dbr:Holevo's_bound dbr:Holevo_bound dbr:Holevo_information dbr:Accessible_information |
| is dbo:wikiPageWikiLink of | dbr:Index_of_physics_articles_(H) dbr:Timeline_of_quantum_computing_and_communication dbr:Measurement_in_quantum_mechanics dbr:Moscow_Institute_of_Physics_and_Technology dbr:Alexander_Holevo dbr:History_of_quantum_mechanics dbr:James_P._Gordon dbr:Jensen–Shannon_divergence dbr:Choi's_theorem_on_completely_positive_maps dbr:Superdense_coding dbr:Quantum_information dbr:Holevo's_bound dbr:Holevo_bound dbr:Holevo_information dbr:Accessible_information |
| is dbp:knownFor of | dbr:Alexander_Holevo |
| is foaf:primaryTopic of | wikipedia-en:Holevo's_theorem |