Efficient quantum tomography

DOI10.1145/2897518.2897544zbMath1373.68229arXiv1508.01907OpenAlexW1944079109WikidataQ130921523 ScholiaQ130921523MaRDI QIDQ5361889

No author found.

Publication date: 29 September 2017

Published in: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

tomographyquantum computinglongest increasing subsequenceRobinson-Schensted-Knuth correspondence

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (12)

QHSL: a quantum hue, saturation, and lightness color model ⋮ Inapproximability of positive semidefinite permanents and quantum state tomography ⋮ Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting) ⋮ Shadow Tomography of Quantum States ⋮ Asymptotic performance of port-based teleportation ⋮ Unnamed Item ⋮ Superdensity operators for spacetime quantum mechanics ⋮ Schur-Weyl duality for the Clifford group with applications: property testing, a robust Hudson theorem, and de Finetti representations ⋮ Online learning of quantum states ⋮ The variational quantum eigensolver: a review of methods and best practices ⋮ Fast state tomography with optimal error bounds ⋮ Multi-parameter estimation beyond quantum Fisher information

This page was built for publication: Efficient quantum tomography