The complexity of divisibility

DOI10.1016/J.LAA.2016.03.041zbMath1381.68094arXiv1411.7380OpenAlexW1778086900WikidataQ33782819 ScholiaQ33782819MaRDI QIDQ286139

Johannes Bausch, Toby S. Cubitt

Publication date: 20 May 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

stochastic matricesprobability distributionsdivisibilitydecomposabilitycomplexity theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Probability distributions: general theory (60E05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Stochastic matrices (15B51) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (7)

Quantum and classical dynamical semigroups of superchannels and semicausal channels ⋮ Embeddability of real and positive operators ⋮ Roots of completely positive maps ⋮ Pauli semigroups and unistochastic quantum channels ⋮ Necessary criteria for Markovian divisibility of linear maps ⋮ Diffusion and consensus on weakly connected directed graphs ⋮ Log-convex set of Lindblad semigroups acting on N-level system

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(p\)th roots of stochastic matrices
• Computing real square roots of a real matrix
• The complexity of relating quantum channels to master equations
• Dividing quantum channels
• Completely positive linear maps on complex matrices
• On the generators of quantum dynamical semigroups
• The nonnegative inverse eigenvalue problem.
• Über eine Eigenschaft der normalen Verteilungsfunktion
• Quantum Subdivision Capacities and Continuous-Time Quantum Coding
• On the infinite divisbility of the Pareto distribution
• On the infinite divisibility of the lognormal distribution
• Completely positive dynamical semigroups of N-level systems
• Practical polynomial factoring in polynomial time
• Geometry of Quantum States
• Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
• The imbedding problem for finite Markov chains

This page was built for publication: The complexity of divisibility