Skip to main content
Have a personal or library account? Click to login
Polynomial Complexity of Quantum Sample Tomography Cover

Polynomial Complexity of Quantum Sample Tomography

Quantum Information & Computation
Volume 25 (2025): Issue 2 (May 2025)
By:  and    
Open Access
|May 2025
Authors

Authors

Kun Tang

kun.tang@zju.edu.cn

School of Mathematical Sciences, Zhejiang University, Hangzhou, China

Jun Lai

laijun6@zju.edu.cn

School of Mathematical Sciences, Zhejiang University, Hangzhou, China
DOI: https://doi.org/10.2478/qic-2025-0008 | Journal eISSN: 3106-0544 | Journal ISSN: 1533-7146
Journal RSS Feed
Language: English
Page range: 156 - 174
Published on: May 26, 2025
Published by: Cerebration Science Publishing Co., Limited
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year
Keywords:
quantum sample tomography,
Rademacher complexity,
random projection,
neural network
Related subjects:
Physics,
Quantum physics,
Mathematics,
Applied mathematics,
Computer sciences,
Computer sciences in the humanities,
Computer sciences,
Computer sciences in natural sciences

© 2025 Kun Tang, Jun Lai, published by Cerebration Science Publishing Co., Limited
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Volume 25 (2025): Issue 2 (May 2025)
Previous article
Next article