Polynomial complexity of quantum sample tomography

DOI10.2478/QIC-2025-0008MaRDI QIDQ7295895zbMATH OpenFDO

Authors Kun Tang, Jun Lai

Publication date 14 July 2026

Published in Quantum Information \& Computation (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.2478/QIC-2025-0008

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum state tomography, quantum state discrimination (81P18) Quantum computation (81P68)

Cites work

• A Vector-Contraction Inequality for Rademacher Complexities
• An elementary proof of a theorem of Johnson and Lindenstrauss
• scientific article; zbMATH DE number 1776257 (Why is no real title available?)
• Local Rademacher complexities
• Quantum state tomography for matrix product density operators
• Quantum tomography benchmarking
• Quantum tomography using state-preparation unitaries
• Shadow tomography of quantum states
• The learnability of quantum states

This page was built for publication: Polynomial complexity of quantum sample tomography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7295895)