Quantum channels with memory
Open accessThe DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
We present a general model for quantum channels with memory and show that it is sufficiently general to encompass all causal automata: any quantum process in which outputs up to some time $t$ do not depend on inputs at times ${t}^{\ensuremath{'}}>t$ can be decomposed into a concatenated memory channel. We then examine and present different physical setups in which channels with memory may be operated for the transfer of (private) classical and quantum information. These include setups in which either the receiver or a malicious third party have control of the initializing memory. We introduce classical and quantum channel capacities for these settings and give several examples to show that they may or may not coincide. Entropic upper bounds on the various channel capacities are given. For forgetful quantum channels, in which the effect of the initializing memory dies out as time increases, coding theorems are presented to show that these bounds may be saturated. Forgetful quantum channels are shown to be open and dense in the set of quantum memory channels.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Theory of quantum error-correcting codes
Knill, E., & Laflamme, R. (1997) · Physical Review A · doi:10.1103/physreva.55.900 · Cited by 1,593
Perfect State Transfer in Quantum Spin Networks
Christandl, M., Datta, N., Ekert, A., & Landahl, A. J. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.187902 · Cited by 1,179
The capacity of the quantum channel with general signal states
Holevo, A. S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.651037 · Cited by 1,176
Theory of Quantum Error Correction for General Noise
Knill, E., Laflamme, R., & Viola, L. (2000) · Physical Review Letters · doi:10.1103/physrevlett.84.2525 · Cited by 866
The Private Classical Capacity and Quantum Capacity of a Quantum Channel
Devetak, I. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839515 · Cited by 823
Operator Algebras and Quantum Statistical Mechanics 1
Bratteli, O., & Robinson, D. W. (1987) · doi:10.1007/978-3-662-02520-8 · Cited by 788
Positive Functions on C ∗ -Algebras
Stinespring, W. F. (1955) · Proceedings of the American Mathematical Society · doi:10.2307/2032342 · Cited by 714
Perfect transfer of arbitrary states in quantum spin networks
Christandl, M., Datta, N., Dorlas, T. C., Ekert, A., Kay, A., & Landahl, A. J. (2005) · Physical Review A · doi:10.1103/physreva.71.032312 · Cited by 512
Tema con variazioni: quantum channel capacity
Kretschmann, D., & Werner, R. F. (2004) · New Journal of Physics · doi:10.1088/1367-2630/6/1/026 · Cited by 123
Self-citation
Cited by
Theoretical framework for quantum networks
Chiribella, G., D’Ariano, G. M., & Perinotti, P. (2009) · Physical Review A · doi:10.1103/physreva.80.022339 · Cited by 517
Probabilistic theories with purification
Chiribella, G., D’Ariano, G. M., & Perinotti, P. (2010) · Physical Review A · doi:10.1103/physreva.81.062348 · Cited by 442
Chiribella, G., D’Ariano, G. M., & Perinotti, P. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.060401 · Cited by 381
Non-Markovian quantum processes: Complete framework and efficient characterization
Pollock, F. A., Rodríguez-Rosario, C., Frauenheim, T., Paternostro, M., & Modi, K. (2018) · Physical Review A · doi:10.1103/physreva.97.012127 · Cited by 334
Quantum channels and memory effects
Caruso, F., Giovannetti, V., Lupo, C., & Mancini, S. (2012) · arXiv · doi:10.48550/arxiv.1207.5435 · Cited by 331
Quantum channels and memory effects
Caruso, F., Giovannetti, V., Lupo, C., & Mancini, S. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.1203 · Cited by 330
Transforming quantum operations: Quantum supermaps
Chiribella, G., D'Ariano, G. M., & Perinotti, P. (2008) · EPL (Europhysics Letters) · doi:10.1209/0295-5075/83/30004 · Cited by 321
One-Shot Classical-Quantum Capacity and Hypothesis Testing
Wang, L., & Renner, R. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.200501 · Cited by 299
Operational Markov Condition for Quantum Processes
Pollock, F. A., Rodríguez-Rosario, C., Frauenheim, T., Paternostro, M., & Modi, K. (2018) · Physical Review Letters · doi:10.1103/physrevlett.120.040405 · Cited by 261
The Information-Disturbance Tradeoff and the Continuity of Stinespring's Representation
Kretschmann, D., Schlingemann, D., & Werner, R. F. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.917696 · Cited by 122
Self-citationAll (qubit) decoherences: Complete characterization and physical implementation
Ziman, M., & Bužek, V. (2005) · Physical Review A · doi:10.1103/physreva.72.022110 · Cited by 111
Quantum Turbo Decoding for Quantum Channels Exhibiting Memory
Mohd Izhar, M. A., Babar, Z., Nguyen, H. V., Botsinis, P., Alanis, D., Chandra, D., Ng, S. X., & Hanzo, L. (2018) · IEEE Access · doi:10.1109/access.2018.2808373 · Cited by 9
“In 2005, a unified framework for quantum channels exhibiting memory was developed by Kretschmann and Werner [17], where the upper bounds of classical and of quantum channel capacities were derived for various scenarios, depending on whether the transmitter, the receiver or the eavesdropper has the control on the initi…”
BackgroundInfluential
Metadata
- Authors
- Kretschmann, D., & Werner, R. F.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2005-12-16
- Volume
- 72
- Issue
- 6
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2031170573
- Cited by
- 236
- References
- 10
- FWCI
- 14.43
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.