Optimal quantum networks and one-shot entropies
From MaRDI portal
(Redirected from Publication:5855097)
Abstract: We develop a semidefinite programming method for the optimization of quantum networks, including both causal networks and networks with indefinite causal structure. Our method applies to a broad class of performance measures, defined operationally in terms of interactive tests set up by a verifier. We show that the optimal performance is equal to a max relative entropy, which quantifies the informativeness of the test. Building on this result, we extend the notion of conditional min-entropy from quantum states to quantum causal networks. The optimization method is illustrated in a number of applications, including the inversion, charge conjugation, and controlization of an unknown unitary dynamics. In the non-causal setting, we show a proof-of-principle application to the maximization of the winning probability in a non-causal quantum game.
Recommendations
Cites work
- A fidelity measure for quantum channels
- A graph-separation theorem for quantum causal models
- A short impossibility proof of quantum bit commitment
- A simple formula for the average gate fidelity of a quantum dynamical operation
- A Smooth Entropy Approach to Quantum Hypothesis Testing and the Classical Capacity of Quantum Channels
- Base norms and discrimination of generalized quantum channels
- Bounding quantum correlations with indefinite causal order
- Completely positive linear maps on complex matrices
- Demonstration of Blind Quantum Computing
- Efficient distributed quantum computing
- General teleportation channel, singlet fraction, and quasidistillation
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1776257 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Introduction to algorithms
- Method for direct detection of quantum entanglement
- Min- and Max-Relative Entropies and a New Entanglement Monotone
- On a measure of distance for quantum strategies
- One-Shot Rates for Entanglement Manipulation Under Non-entangling Maps
- Optimal realization of the transposition maps
- Optimizing quantum process tomography with unitary2-designs
- Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
- Programmable Quantum Gate Arrays
- Quantifying Entanglement
- Quantum Bayesian nets
- Quantum circuits cannot control unknown operations
- Quantum computation with programmable connections between gates
- Quantum computational networks
- Quantum graphical models and belief propagation
- Quantum Gravity Computers: On the Theory of Computation with Indefinite Causal Structure
- SECURITY OF QUANTUM KEY DISTRIBUTION
- Smooth Entropies and the Quantum Information Spectrum
- States, effects, and operations. Fundamental notions of quantum theory. Lectures in mathematical physics at the University of Texas at Austin. Ed. by A. Böhm, J. D. Dollard and W. H. Wootters
- The Operational Meaning of Min- and Max-Entropy
- The operator tensor formulation of quantum theory
- Theoretical framework for quantum networks
- Theory-independent limits on correlations from generalized Bayesian networks
- Towards a general theory of quantum games
- Universal Blind Quantum Computation
Cited in
(11)- Optimal covariant quantum networks
- Ordering quantum states and channels based on positive Bayesian evidence
- Efficient optimization of the quantum relative entropy
- Theoretical framework for quantum networks
- Fast tests for probing the causal structure of quantum processes
- Optimal networks for quantum metrology: semidefinite programs and product rules
- Necessary and sufficient conditions on measurements of quantum channels
- One-Shot Rates for Entanglement Manipulation Under Non-entangling Maps
- Quasi-inversion of quantum and classical channels in finite dimensions
- Units of rotational information
- Extreme quantum states and processes, and extreme points of general spectrahedra in finite dimensional algebras
This page was built for publication: Optimal quantum networks and one-shot entropies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5855097)
