Skip to content
Publish & Distribute
Publishing Solutions
Distribution Solutions
Library Services
Subjects
Architecture and Design
Arts
Business and Economics
Chemistry
Classical and Ancient Near Eastern Studies
Computer Sciences
Cultural Studies
Engineering
General Interest
Geosciences
History
Industrial Chemistry
Jewish Studies
Law
Library and Information Science, Book Studies
Life Sciences
Linguistics and Semiotics
Literary Studies
Materials Sciences
Mathematics
Medicine
Music
Pharmacy
Philosophy
Physics
Social Sciences
Sports and Recreation
Theology and Religion
Publications
Journals
Books
Proceedings
Publishers
Journal Matcher
Blog
Contact
Search
English
English
Deutsch
Polski
Español
Français
Italiano
Cart
Home
Journals
Quantum Information & Computation
Volume 25 (2025): Issue 2 (May 2025)
Open Access
Polynomial Complexity of Quantum Sample Tomography
Kun Tang
Kun Tang
School of Mathematical Sciences, Zhejiang University
Hangzhou, China
Search for this author on
Sciendo
|
Google Scholar
Tang, Kun
and
Jun Lai
Jun Lai
School of Mathematical Sciences, Zhejiang University
Hangzhou, China
Search for this author on
Sciendo
|
Google Scholar
Lai, Jun
May 26, 2025
Quantum Information & Computation
Volume 25 (2025): Issue 2 (May 2025)
About this article
Previous Article
Next Article
Abstract
Article
Figures & Tables
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Download Cover
Article Category:
Article
Published Online:
May 26, 2025
Page range:
156 - 174
DOI:
https://doi.org/10.2478/qic-2025-0008
Keywords
quantum sample tomography
,
Rademacher complexity
,
random projection
,
neural network
© 2025 Kun Tang et al., published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
