The accessibility of convex bodies and derandomization of the hit and run algorithm

zbMath1396.52005arXiv1312.7061MaRDI QIDQ4604053

Benoit Collins, Termeh Kousha, Tomasz Szarek, Rafał Kulik, Karol Życzkowski

Publication date: 23 February 2018

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

zbMATH Keywords

convex bodyderandomizationhit \& run algorithm

Mathematics Subject Classification ID

Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Random convex sets and integral geometry (aspects of convex geometry) (52A22)

Related Items (3)

Robust Hadamard matrices, unistochastic rays in Birkhoff polytope and equi-entangled bases in composite spaces ⋮ Convex set of quantum states with positive partial transpose analysed by hit and run algorithm ⋮ Nested sampling methods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random quantum operations
• Markov chains and stochastic stability
• The Bloch vector for \(N\)-level systems
• Random quantum correlations and density operator distributions
• Geometry of quantum inference
• Induced measures in the space of mixed quantum states
• The geometry of logconcave functions and sampling algorithms
• Subnormalized states and trace-nonincreasing maps
• Random bistochastic matrices
• A random polynomial-time algorithm for approximating the volume of convex bodies
• Hit-and-Run from a Corner

This page was built for publication: The accessibility of convex bodies and derandomization of the hit and run algorithm