The outcomes of quantum mechanical measurements are inherently random. It is therefore necessary to develop stringent methods for quantifying the degree of statistical uncertainty about the results of quantum experiments. For the particularly relevant task of quantum state tomography, it has been shown that a significant reduction in uncertainty can be achieved by taking the positivity of quantum states into account. However—the large number of partial results and heuristics notwithstanding—no efficient general algorithm is known that produces an optimal uncertainty region from experimental data, while making use of the prior constraint of positivity. Here, we provide a precise formulation of this problem and show that the general case is NP-hard. Our result leaves room for the existence of efficient approximate solutions, and therefore does not in itself imply that the practical task of quantum uncertainty quantification is intractable. However, it does show that there exists a non-trivial trade-off between optimality and computational efficiency for error regions. We prove two versions of the result: one for frequentist and one for Bayesian statistics.
The outcomes of quantum mechanical measurements are inherently random. It is therefore necessary to develop stringent methods for quantifying the degree of statistical uncertainty about the results of quantum experiments. For the particularly relevant task of quantum state tomography, it has been shown that a significant reduction in uncertainty can be achieved by taking the positivity of quantum states into account. However—the large number of partial results and heuristics notwithstanding—no efficient general algorithm is known that produces an optimal uncertainty region from experimental data, while making use of the prior constraint of positivity. Here, we provide a precise formulation of this problem and show that the general case is NP-hard. Our result leaves room for the existence of efficient approximate solutions, and therefore does not in itself imply that the practical task of quantum uncertainty quantification is intractable. However, it does show that there exists a non-trivial trade-off between optimality and computational efficiency for error regions. We prove two versions of the result: one for frequentist and one for Bayesian statistics.
Quantum state tomography is the task of inferring the state of a quantum system by appropriate measurements. Since the frequency distributions of the outcomes of any finite number of measurements will generally deviate from their asymptotic limits, the estimates computed by standard methods do not in general coincide with the true state and, therefore, have no operational significance unless their accuracy is defined in terms of error bounds. Here we show that quantum state tomography, together with an appropriate data analysis procedure, yields reliable and tight error bounds, specified in terms of confidence regions-a concept originating from classical statistics. Confidence regions are subsets of the state space in which the true state lies with high probability, independently of any prior assumption on the distribution of the possible states. Our method for computing confidence regions can be applied to arbitrary measurements including fully coherent ones; it is practical and particularly well suited for tomography on systems consisting of a small number of qubits, which are currently in the focus of interest in experimental quantum information science.
Results concerning the construction of quantum Bayesian error regions as a means to certify the quality of parameter point estimators have been reported in recent years. This task remains numerically formidable in practice for large dimensions and so far, no analytical expressions of the region size and credibility (probability of any given true parameter residing in the region) are known, which form the two principal region properties to be reported alongside a point estimator obtained from collected data. We first establish analytical formulas for the size and credibility that are valid for a uniform prior distribution over parameters, sufficiently large data samples and general constrained convex parameter estimation settings. These formulas provide a means to an efficient asymptotic error certification for parameters of arbitrary dimensions. Next, we demonstrate the accuracies of these analytical formulas as compared to numerically computed region quantities with simulated examples in qubit and qutrit quantum-state tomography where computations of the latter are feasible.
Quantum state tomography (QST) is a crucial technique for characterizing the state of a quantum system, often employed in quantum metrology, quantum communication, and fundamental quantum information science. However, QST inherently suffers from significant measurement redundancy and uncertainty, demanding a large number of measurements to achieve a desired level of accuracy. This work proposes a novel framework for QST leveraging concepts from algorithmic information theory, specifically Kolmogorov complexity, to rigorously quantify this uncertainty and redundancy. We introduce a tailored complexity measure for quantum states that allows for the design of measurement strategies optimized to minimize the number of required measurements while maintaining a specified accuracy. Our approach shifts the focus from purely statistical estimation to a fundamental information-theoretic analysis, offering a deeper understanding of the reconstruction problem and potentially leading to more efficient and robust QST protocols. The core claim is that applying Kolmogorov complexity provides a quantifiable metric for the inherent uncertainty within a quantum state, directly informing the development of improved estimation techniques. The mechanism involves defining and utilizing this complexity measure to guide the selection of measurement angles, ultimately reducing redundancy and improving the precision of state reconstruction.
We introduce a fast and accurate heuristic for adaptive tomography that addresses many of the limitations of prior methods.Previous approaches were either too computationally intensive or tailored to handle special cases such as single qubits or pure states.By contrast, our approach combines the efficiency of online optimization with generally applicable and well-motivated data-processing techniques.We numerically demonstrate these advantages in several scenarios including mixed states, higher-dimensional systems, and restricted measurements.Quantum information processing (QIP) promises advantages in a wide range of different contexts, including machine learning [2-4], chemistry simulation [5][6][7], and number theory [8,9].As such, the experimental effort to build useful QIP devices has exploded in recent years.In the course of this effort, quantum tomography is a valuable tool for diagnosing and debugging small quantum devices, and has subsequently seen a variety of different advances.In particular, Bayesian approaches to tomography which are especially well suited to utilizing prior information and adapting to changing experimental conditions have developed significantly in recent years [10-13], presenting a useful experimental tool [14][15][16].In this paper we demonstrate the efficiency and accuracy of an adaptive tomography protocol that we call PAQT: practical adaptive quantum tomography.PAQT intelligently selects new measurements based on the outcomes of previous ones [10,[17][18][19][20][21].Adaptivity has been experimentally demonstrated [14,15,[22][23][24][25], but is not currently standard practice.Though adaptivity increases accuracy, the computational costs incurred outweigh that of simply repeating standard measurements many times.The PAQT approach employs a simple heuristic that can be efficiently computed between measurements, even with embedded hardware [26][27][28][29].The algorithm we propose is therefore compatible with modern experimental design and avoids an important limitation of previous approaches.We base our algorithm off of self-guided quantum tomography (SGQT), which treats adaptive tomography as a direct optimization problem rather than a new optimization problem between each measurement [30].Though this affords an efficient and easy to implement adaptive heuristic, SGQT is not without its limitations.It requires assuming that the target state is pure, and it does not return rich region estimates for a state.What PAQT achieves is to effectively combine SGQT with conventional and easily-implemented tomographic estimators, such as the Bayesian particle filter or least-squares fit (LSF) estimators.Under this approach, an experimentalist can collect data using SGQT (even if its assumptions are not met), and then post-process this data using particle filtering or LSF.The benefit of PAQT is two-fold.(1) From the point of view of traditional tomography, it gives an adaptive tomography protocol requiring only modest computational resources, as the bulk of the computational cost is offloaded to post-processing.(2) From the point of view of simulation-based optimization tomography (such as SGQT), it effectively augments the output with region estimation providing a statistically robust quantification of uncertainty.Thus, while we do not explicitly demonstrate that the improved scaling of Ferrie [30] remains in the more general case considered here, PAQT does provide a practical and efficient procedure for performing adaptive quantum tomography with rigorous statistical principles.
Quantum state tomography is the task of inferring the state of a quantum system from measurement data. A reliable tomography scheme should not only report an estimate for that state, but also well-justified error bars. These may be specified in terms of confidence regions, i.e., subsets of the state space which contain the system's state with high probability. Here, building upon a quantum generalization of Clopper-Pearson confidence intervals-a notion known from classical statistics-we present a simple and reliable scheme for generating confidence regions. These have the shape of a polytope and can be computed efficiently. We provide several examples to demonstrate the practical usability of the scheme in experiments.
Quantum state tomography (QST) is a fundamental task in quantum information science that aims to reconstruct unknown quantum states from measurement data. However, the exponential growth of Hilbert-space dimension with system size makes full tomography of general quantum states statistically and computationally prohibitive. This challenge has motivated extensive research on structured quantum state tomography, where prior structure, such as low-rankness, tensor-network representations, shallow quantum circuits, and neural quantum states, can substantially reduce the effective degrees of freedom and enable scalable recovery. In this review, we provide a unified perspective on QST for structured quantum states through three closely related themes: compact state representations, measurement design, and computational algorithms. After reviewing common models for structured quantum states, we survey existing work on geometric preservation properties of measurement frameworks, ranging from informationally complete POVMs to randomized measurements, and their implications for sample complexity. On the algorithmic side, we review optimization methods for reconstructing structured quantum states from empirical measurements. By connecting QST with broader principles from compressive sensing, matrix sensing, and structured inverse problems, this survey highlights common theoretical foundations underlying sample complexity, measurement efficiency, and scalable recovery.