Optimizing Completely Positive Maps using Semidefinite Programming

Abstract

Recently, a lot of attention has been devoted to finding physically realisable operations that realise as closely as possible certain desired transformations between quantum states, e.g. quantum cloning, teleportation, quantum gates, etc. Mathematically, this problem boils down to finding a completely positive trace-preserving (CPTP) linear map that maximizes the (mean) fidelity between the map itself and the desired transformation. In this note we want to draw attention to the fact that this problem belongs to the class of so-called semidefinite programming (SDP) problems. As SDP problems are convex, it immediately follows that they do not suffer from local optima. Furthermore, this implies that the numerical optimization of the CPTP map can, and should, be done using methods from the well-established SDP field, as these methods exploit convexity and are guaranteed to converge to the real solution. Finally, we show how the duality inherent to convex and SDP problems can be exploited to prove analytically the optimality of a proposed solution. We give an example of how to apply this proof method by proving the optimality of Hardy and Song's proposed solution for the universal qubit $\theta$-shifter (quant-ph/0102100).

4 pages; references corrected and added; shortened to fit 4-page format

Cited by in corpus (49)

• A complete family of separability criteria
• Performance and structure of single-mode bosonic codes
• Designing Optimal Quantum Detectors Via Semidefinite Programming
• A Semidefinite Programming Approach to Optimal Unambiguous Discrimination of Quantum States
• Optimal discrimination of mixed quantum states involving inconclusive results
• Quantum Cloning Machines and the Applications
• Optimum Quantum Error Recovery using Semidefinite Programming
• Complete hierarchies of efficient approximations to problems in entanglement theory
• Finding optimal strategies for minimum-error quantum-state discrimination
• Quantum Control of a Single Qubit
• Mixed quantum state detection with inconclusive results
• Encoding a qubit in a spin
• Optimal probabilistic cloning and purification of quantum states
• Universal measurement apparatus controlled by quantum software
• Quantum Channel Construction with Circuit Quantum Electrodynamics
• Semidefinite programming relaxations for quantum correlations
• Suboptimal quantum-error-correcting procedure based on semidefinite programming
• Experimental quantum forgery of quantum optical money
• Quantum cloning of orthogonal qubits
• Optimal Experiment Design for Quantum State and Process Tomography and Hamiltonian Parameter Estimation
• Phase-Covariant Quantum Benchmarks
• Cloning the entanglement of a pair of quantum bits
• On quantum channels
• Maximally entangled mixed states for qubit-qutrit systems
• Positive maps and entanglement in real Hilbert spaces
• Non-unity gain minimal disturbance measurement
• Numerical construction of multipartite entanglement witnesses
• The Near-optimal Performance of Quantum Error Correction Codes
• Quantum Process Fidelity Bounds from Sets of Input States
• Investigating a Class of $2\otimes 2\otimes d$ Chessboard Density Matrices via Linear and Non-linear Entanglement Witnesses Constructed by Exact Convex Optimization
• Neural Network-Based Design of Approximate Gottesman-Kitaev-Preskill Code
• Orthogonalization of partly unknown quantum states
• Modern compressive tomography for quantum information science
• Quantum State Detector Design: Optimal Worst-Case a posteriori Performance
• Universal quantum Controlled-NOT gate
• Robustness of channel-adapted quantum error correction
• Quantum operation, quantum Fourier transform and semi-definite programming
• Checking $2\times M$ separability via semidefinite programming
• Optimal tracking for pairs of qubit states
• Choi representation of completely positive maps in brief
• Bounds on quantum process fidelity from minimum required number of quantum state fidelity measurements
• Machine learning of quantum channels on NISQ devices
• Degree of separability of bipartite quantum states
• Parameter estimation of quantum processes using convex optimization
• Experiment design and parameter estimation of Pauli channels using convex optimization
• Process-optimized phase covariant quantum cloning
• Convicting emergent multipartite entanglement with evidence from a partially blind witness
• Estimating the performance boundary of Gottesman-Kitaev-Preskill codes and number-phase codes
• A short note on the 0-fidelity