skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Resource cost results for one-way entanglement distillation and state merging of compound and arbitrarily varying quantum sources

Abstract

We consider one-way quantum state merging and entanglement distillation under compound and arbitrarily varying source models. Regarding quantum compound sources, where the source is memoryless, but the source state an unknown member of a certain set of density matrices, we continue investigations begun in the work of Bjelaković et al. [“Universal quantum state merging,” J. Math. Phys. 54, 032204 (2013)] and determine the classical as well as entanglement cost of state merging. We further investigate quantum state merging and entanglement distillation protocols for arbitrarily varying quantum sources (AVQS). In the AVQS model, the source state is assumed to vary in an arbitrary manner for each source output due to environmental fluctuations or adversarial manipulation. We determine the one-way entanglement distillation capacity for AVQS, where we invoke the famous robustification and elimination techniques introduced by Ahlswede. Regarding quantum state merging for AVQS we show by example that the robustification and elimination based approach generally leads to suboptimal entanglement as well as classical communication rates.

Authors:
;  [1]
  1. Lehrstuhl für Theoretische Informationstechnik, Technische Universität München, 80290 München (Germany)
Publication Date:
OSTI Identifier:
22306026
Resource Type:
Journal Article
Resource Relation:
Journal Name: Journal of Mathematical Physics; Journal Volume: 55; Journal Issue: 8; Other Information: (c) 2014 AIP Publishing LLC; Country of input: International Atomic Energy Agency (IAEA)
Country of Publication:
United States
Language:
English
Subject:
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; COMMUNICATIONS; DENSITY MATRIX; QUANTUM ENTANGLEMENT; QUANTUM MECHANICS; QUANTUM STATES

Citation Formats

Boche, H., E-mail: boche@tum.de, and Janßen, G., E-mail: gisbert.janssen@tum.de. Resource cost results for one-way entanglement distillation and state merging of compound and arbitrarily varying quantum sources. United States: N. p., 2014. Web. doi:10.1063/1.4893635.
Boche, H., E-mail: boche@tum.de, & Janßen, G., E-mail: gisbert.janssen@tum.de. Resource cost results for one-way entanglement distillation and state merging of compound and arbitrarily varying quantum sources. United States. doi:10.1063/1.4893635.
Boche, H., E-mail: boche@tum.de, and Janßen, G., E-mail: gisbert.janssen@tum.de. Fri . "Resource cost results for one-way entanglement distillation and state merging of compound and arbitrarily varying quantum sources". United States. doi:10.1063/1.4893635.
@article{osti_22306026,
title = {Resource cost results for one-way entanglement distillation and state merging of compound and arbitrarily varying quantum sources},
author = {Boche, H., E-mail: boche@tum.de and Janßen, G., E-mail: gisbert.janssen@tum.de},
abstractNote = {We consider one-way quantum state merging and entanglement distillation under compound and arbitrarily varying source models. Regarding quantum compound sources, where the source is memoryless, but the source state an unknown member of a certain set of density matrices, we continue investigations begun in the work of Bjelaković et al. [“Universal quantum state merging,” J. Math. Phys. 54, 032204 (2013)] and determine the classical as well as entanglement cost of state merging. We further investigate quantum state merging and entanglement distillation protocols for arbitrarily varying quantum sources (AVQS). In the AVQS model, the source state is assumed to vary in an arbitrary manner for each source output due to environmental fluctuations or adversarial manipulation. We determine the one-way entanglement distillation capacity for AVQS, where we invoke the famous robustification and elimination techniques introduced by Ahlswede. Regarding quantum state merging for AVQS we show by example that the robustification and elimination based approach generally leads to suboptimal entanglement as well as classical communication rates.},
doi = {10.1063/1.4893635},
journal = {Journal of Mathematical Physics},
number = 8,
volume = 55,
place = {United States},
year = {Fri Aug 01 00:00:00 EDT 2014},
month = {Fri Aug 01 00:00:00 EDT 2014}
}
  • We study how entanglement among the register qubits affects the gate fidelity in the one-way quantum computation if a measurement is inaccurate. We derive an inequality that shows that the mean gate fidelity is upper bounded by a decreasing function of the magnitude of the error of the measurement and the amount of the entanglement between the measured qubit and other register qubits. The consequence of this inequality is that, for a given amount of entanglement, which is theoretically calculated once the algorithm is fixed, we can estimate from this inequality how small the magnitude of the error should bemore » in order not to make the gate fidelity below a threshold, which is specified by a technical requirement in a particular experimental setup or by the threshold theorem of the fault-tolerant quantum computation.« less
  • As our main result show that in order to achieve the randomness assisted message and entanglement transmission capacities of a finite arbitrarily varying quantum channel it is not necessary that sender and receiver share (asymptotically perfect) common randomness. Rather, it is sufficient that they each have access to an unlimited amount of uses of one part of a correlated bipartite source. This access might be restricted to an arbitrary small (nonzero) fraction per channel use, without changing the main result. We investigate the notion of common randomness. It turns out that this is a very costly resource – generically, itmore » cannot be obtained just by local processing of a bipartite source. This result underlines the importance of our main result. Also, the asymptotic equivalence of the maximal- and average error criterion for classical message transmission over finite arbitrarily varying quantum channels is proven. At last, we prove a simplified symmetrizability condition for finite arbitrarily varying quantum channels.« less
  • As our main result show that in order to achieve the randomness assisted message and entanglement transmission capacities of a finite arbitrarily varying quantum channel it is not necessary that sender and receiver share (asymptotically perfect) common randomness. Rather, it is sufficient that they each have access to an unlimited amount of uses of one part of a correlated bipartite source. This access might be restricted to an arbitrary small (nonzero) fraction per channel use, without changing the main result. We investigate the notion of common randomness. It turns out that this is a very costly resource – generically, itmore » cannot be obtained just by local processing of a bipartite source. This result underlines the importance of our main result. Also, the asymptotic equivalence of the maximal- and average error criterion for classical message transmission over finite arbitrarily varying quantum channels is proven. At last, we prove a simplified symmetrizability condition for finite arbitrarily varying quantum channels.« less
  • We consider secret-key distillation from tripartite compound classical-quantum-quantum (cqq) sources with free forward public communication under strong security criterion. We design protocols which are universally reliable and secure in this scenario. These are shown to achieve asymptotically optimal rates as long as a certain regularity condition is fulfilled by the set of its generating density matrices. We derive a multi-letter formula which describes the optimal forward secret-key capacity for all compound cqq sources being regular in this sense. We also determine the forward secret-key distillation capacity for situations where the legitimate sending party has perfect knowledge of his/her marginal statemore » deriving from the source statistics. In this case regularity conditions can be dropped. Our results show that the capacities with and without the mentioned kind of state knowledge are equal as long as the source is generated by a regular set of density matrices. We demonstrate that regularity of cqq sources is not only a technical but also an operational issue. For this reason, we give an example of a source which has zero secret-key distillation capacity without sender knowledge, while achieving positive rates is possible if sender marginal knowledge is provided.« less
  • For a finite-dimensional bipartite system, the relation between local projections and post-selected state dependence on the global state submatrices is given in a general setting. As a result joint state reconstruction is derived with strict local projective measurements and one-way classical communication, reducing the number of detectors in comparison to standard procedures. Generalization to multipartite systems is given, also reducing the number of detectors for multiqubits.