Publication:5855097

DOI10.1088/1367-2630/18/9/093053zbMATH Open1456.81135arXiv1606.02394OpenAlexW2418959496MaRDI QIDQ5855097FDOQ5855097

Giulio Chiribella, Daniel Ebler

Publication date: 12 March 2021

Published in: New Journal of Physics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1606.02394

Mathematics Subject Classification ID

Semidefinite programming (90C22) Quantum computation (81P68)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Introduction to algorithms
• Demonstration of Blind Quantum Computing
• Completely positive linear maps on complex matrices
• Quantum computational networks
• Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
• General teleportation channel, singlet fraction, and quasidistillation
• Universal Blind Quantum Computation
• 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
• Min- and Max-Relative Entropies and a New Entanglement Monotone
• SECURITY OF QUANTUM KEY DISTRIBUTION
• Quantifying Entanglement
• A fidelity measure for quantum channels
• Quantum circuits cannot control unknown operations
• Theory-independent limits on correlations from generalized Bayesian networks
• Method for direct detection of quantum entanglement
• Quantum graphical models and belief propagation
• Quantum computation with programmable connections between gates
• Quantum Gravity Computers: On the Theory of Computation with Indefinite Causal Structure
• Programmable Quantum Gate Arrays
• A simple formula for the average gate fidelity of a quantum dynamical operation
• Smooth Entropies and the Quantum Information Spectrum
• Theoretical framework for quantum networks
• On a measure of distance for quantum strategies
• One-Shot Rates for Entanglement Manipulation Under Non-entangling Maps
• Optimal realization of the transposition maps
• Bounding quantum correlations with indefinite causal order
• Efficient distributed quantum computing
• Optimizing quantum process tomography with unitary2-designs
• A short impossibility proof of quantum bit commitment
• QUANTUM BAYESIAN NETS
• The operator tensor formulation of quantum theory
• A Smooth Entropy Approach to Quantum Hypothesis Testing and the Classical Capacity of Quantum Channels
• A graph-separation theorem for quantum causal models
• Base norms and discrimination of generalized quantum channels

Cited In (7)

• Fast Tests for Probing the Causal Structure of Quantum Processes
• Ordering quantum states and channels based on positive Bayesian evidence
• Extreme quantum states and processes, and extreme points of general spectrahedra in finite dimensional algebras
• Units of rotational information
• One-Shot Rates for Entanglement Manipulation Under Non-entangling Maps
• Quasi-inversion of quantum and classical channels in finite dimensions
• Necessary and sufficient conditions on measurements of quantum channels

Uses Software

• QPL

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)