The complexity of relating quantum channels to master equations

DOI10.1007/s00220-011-1402-yzbMath1243.81100arXiv0908.2128OpenAlexW2130724093WikidataQ57637227 ScholiaQ57637227MaRDI QIDQ766099

Jens Eisert, Toby S. Cubitt, Michael M. Wolf

Publication date: 23 March 2012

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

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

zbMATH Keywords

semi-definite programmingNP-hardquantum tomographyMarkovianity problem

Mathematics Subject Classification ID

Linear programming (90C05) Quantum measurement theory, state operations, state preparations (81P15) Complexity of computation (including implicit computational complexity) (03D15) Monotone and positive operators on ordered Banach spaces or other ordered topological vector spaces (47H07) Channel models (including quantum) in information and communication theory (94A40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Open systems, reduced dynamics, master equations, decoherence (81S22) Quantum state estimation, approximate cloning (81P50) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items

Quantum and classical dynamical semigroups of superchannels and semicausal channels, Embeddability of real and positive operators, The complexity of divisibility, Accessible Maps in a Group of Classical or Quantum Channels, Roots of completely positive maps, Select topics in open quantum systems, Asymptotic Floquet states of open quantum systems: the role of interaction, Dissipative and non-dissipative single-qubit channels: dynamics and geometry, Irreversible quantum evolution with quadratic generator: Review, Machine learning versus semidefinite programming approach to a particular problem of the theory of open quantum systems, Necessary criteria for Markovian divisibility of linear maps, Log-convex set of Lindblad semigroups acting on N-level system, Dynamical maps beyond Markovian regime

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Embeddable Markov matrices
• Dividing quantum channels
• On the imbedding problem for stochastic and doubly stochastic matrices
• Completely positive linear maps on complex matrices
• On the generators of quantum dynamical semigroups
• Continuity properties of fractional powers, of the logarithm, and of holomorphic semigroups
• Characterizations of embeddable \(3 \times 3\) stochastic matrices with a negative eigenvalue
• Integer optimization on convex semialgebraic sets
• Linear transformations which preserve trace and positive semidefiniteness of operators
• Statistical Structure of Quantum Theory
• Assessing Non-Markovian Quantum Dynamics
• Classical deterministic complexity of Edmonds' Problem and quantum entanglement
• Infinitely Divisible Markov Mappings in Quantum Probability Theory
• Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
• Markov Chains
• Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
• The Logarithm Function for Finite-State Markov Semi-Groups
• Some Results on the Imbedding Problem for Finite Markov Chains
• Semidefinite Programming
• The complexity of satisfiability problems
• On Uniqueness of the Logarithm for Markov Semi-Groups
• The imbedding problem for finite Markov chains