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

Polynomial Complexity of Quantum Sample Tomography

By: Kun Tang and  Jun Lai  
Open Access
|May 2025

Abstract

Efficient quantum tomography is crucial for advancing quantum computing technologies. Traditional quantum state tomography requires an exponential number of measurements for complete reconstruction. Therefore, developing methods that reduce measurement complexity to polynomial scale is essential for practical applications. In this paper, we show that quantum sample tomography can be accomplished with polynomial scale measurements while maintaining accuracy with a high probability. We present a novel approach using conditional recurrent neural networks (RNNs) with solid theoretical foundations from Rademacher complexity and random projection theory. The effectiveness of our method is validated through several quantum models.

DOI: https://doi.org/10.2478/qic-2025-0008 | Journal eISSN: 3106-0544 | Journal ISSN: 1533-7146
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
Related subjects:

© 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.