The estimation of the density matrix of a k-level quantum system is studied when the parametrization is given by the real and imaginary part of the entries and they are estimated by a finite number of independent measurements. For pure or nearly pure states, a simple and provable correct constraining algorithm is proposed that yields an asymptotically unbiased estimate. The quality of the estimate is characterized by the mean quadratic error (MQE) matrix. The determinant of the averaged MQE matrix is minimal for mutually unbiased measurements. For 2-label systems, an adaptive optimal two-step-measurement scheme is proposed that uses a set of initialization measurements to determine the number of measurements in each of the measurement directions that is applied in the second step. An improved version of the algorithm uses the rotation of the measurement axes in the second step, too.
The estimation of the density matrix of a k-level quantum system is studied when the parametrization is given by the real and imaginary part of the entries and they are estimated by a finite number of independent measurements. For pure or nearly pure states, a simple and provable correct constraining algorithm is proposed that yields an asymptotically unbiased estimate. The quality of the estimate is characterized by the mean quadratic error (MQE) matrix. The determinant of the averaged MQE matrix is minimal for mutually unbiased measurements. For 2-label systems, an adaptive optimal two-step-measurement scheme is proposed that uses a set of initialization measurements to determine the number of measurements in each of the measurement directions that is applied in the second step. An improved version of the algorithm uses the rotation of the measurement axes in the second step, too.
The estimation of the density matrix of a k -level quantum system is studied when the parametrization is given by the real and imaginary part of the entries, and they are estimated by independent measurements. It is established that the properties of the estimation procedure depend very much on the invertibility of the true state. In particular, in the case of a pure state, the estimation should be constrained to ensure the positive definiteness of the estimate. An efficient constraining algorithm is proposed and it yields an asymptotically unbiased estimate. Moreover, several estimation schemes are compared for the unknown state of a qubit when one copy is measured at a time. It is shown that the average mean quadratic error matrix is the smallest if the applied observables are complementary. All the results are illustrated by computer simulations.
In quantum estimation for a d-parameter family of density operators on a finite-dimensional Hilbert space H, an estimator is specified by a pair (M,θ^), where M is a POVM with a finite outcome set Ω and θ^:Ω→Rd is a classical estimator map. Since the number of outcomes ∣Ω∣ is a priori unbounded, the space of admissible POVMs is vast, which makes the search for optimal estimators difficult. In this paper, for the minimization of the weighted trace of the mean squared error among locally unbiased estimators, we prove that it suffices to consider POVMs with at most (dimH)2+d(d+1)/2−1 outcomes, and that the optimization can be restricted to rank-one measurements. For Bayesian estimation with a general loss function, we show that rank-one POVMs with at most (dimH)2 outcomes are sufficient for the infimum value of the Bayes risk. Furthermore, when the model admits a real sufficient subalgebra, we show that the (dimH)2 term in the above support-size bounds can be reduced in both the locally unbiased and Bayesian settings. These bounds substantially reduce the search space for optimal measurements and justify restricting numerical optimization to rank-one POVMs with finitely many outcomes.
Recent experimental progress in the preparation and control of quantum systems has brought to light the importance of Quantum State Tomography (QST) in validating the results. In this thesis we investigate several aspects of QST, whose central problem is to devise estimation schemes for the recovery of an unknown state, given an ensemble of n independent identically prepared systems. The key issues in tackling QST for large dimensional systems is the construction of physically relevant low dimensional state models, and the design of appropriate measurements. Inspired by compressed sensing tomography, in chapters 4, 5 we consider the statistical problem of estimating low rank states (r ≪ d) in the set-up of Multiple Ions Tomography (MIT), where r and d are the rank and the dimension of the state respectively. We investigate how the estimation error behaves with a reduction in the number of measurement settings, compared to ‘full’ QST in two setups - Pauli and random bases measurement designs. We study the estimation errors in this ‘incomplete’ measurement setup in terms of a concentration of the Fisher information matrix. For the random bases design we demonstrate that O(r logd) settings suffice for the mean square error w.r.t the Frobenius norm to achieve the optimal O(1/n) rate of estimation. When the error functions are locally quadratic, like the Frobenius norm, then the expected error (or risk) of standard procedures achieves this optimal rate. However, for fidelity based errors such as the Bures distance we show that no ‘compressive’ recovery exists for states close to the boundary, and it is known that even with conventional ‘full’ tomography schemes the risk scales as O(1/√n) for such states and error functions. For qubit states this boundary is the surface of the Bloch sphere. Several estimators have been proposed to improve this scaling with ‘adaptive’ tomography. In chapter 6 we analyse this problem from the perspective of the maximum Bures risk over all qubit states. We propose two adaptive estimation strategies, one based on local measurements and another based on collective measurements utilising the results of quantum local asymptotic normality. We demonstrate a scaling of O(1/n) for the maximum Bures risk with both estimation strategies, and also discuss the construction of a minimax optimal estimator. In chapter 7 we return to the MIT setup and systematically compare several tomographic estimators in an extensive simulation study. We present and analyse results from this study, investigating the performance of the estimators across various states, measurement designs and error functions. Along with commonly used estimators like maximum likelihood, we propose and evaluate a few new ones. We finally introduce two web-based applications designed as tools for performing QST simulations online.
Quantum state tomography estimates an unknown density operator from measurement data. Dense reconstruction however, can be impractical for many-qubit systems because the Hilbert-space dimension grows exponentially. This contribution develops a rank-adaptive matrix-free approach to low-rank quantum state tomography based on rank-one atomic coordinates. The density operator is represented as a convex combination of pure-state atoms, which preserves positivity and unit trace while avoiding dense density, measurement, and gradient matrices. The resultant algorithm combines atom updates, simplex-constrained coefficient reweighting, and periodic spectral refactorization using only predicted probability vectors, atom vectors, and descriptor-level measurement actions. These computations decompose across measurement outcomes, and admit a master--worker implementation with the measurements partitioned across workers. A rank penalty adapts the representation size during optimization. Provable feasibility, prediction consistency, monotone descent of the penalized objective, and an exact spectral proximal characterization of the refactorization step are established. Simulations with Pauli measurements show favorable accuracy--runtime--memory tradeoffs relative to competing alternatives.
Abstract Adaptive techniques have great potential for wide application in enhancing the precision of quantum parameter estimation. We present an adaptive quantum state tomography protocol for finite dimensional quantum systems and experimentally implement the adaptive tomography protocol on two-qubit systems. In this adaptive quantum state tomography protocol, an adaptive measurement strategy and a recursive linear regression estimation algorithm are performed. Numerical results show that our adaptive quantum state tomography protocol can outperform tomography protocols using mutually unbiased bases and the two-stage mutually unbiased bases adaptive strategy, even with the simplest product measurements. When nonlocal measurements are available, our adaptive quantum state tomography can beat the Gill–Massar bound for a wide range of quantum states with a modest number of copies. We use only the simplest product measurements to implement two-qubit tomography experiments. In the experiments, we use error-compensation techniques to tackle systematic error due to misalignments and imperfection of wave plates, and achieve about a 100-fold reduction of the systematic error. The experimental results demonstrate that the improvement of adaptive quantum state tomography over nonadaptive tomography is significant for states with a high level of purity. Our results also show that this adaptive tomography method is particularly effective for the reconstruction of maximally entangled states, which are important resources in quantum information.
Fermionic Gaussian states form a central class of classically tractable quantum states, while fermionic non-Gaussianity provides the resource required to go beyond free-fermion dynamics. A key challenge is to quantify this resource through monotones that are both mathematically rigorous and experimentally accessible. Here, we show that the fermionic entropy, defined through the squared Frobenius norm of the correlation matrix, is a strong pure-state Gaussian monotone. Its simple closed-form expression also makes it directly measurable: we show that the associated fermionic purity can be unbiasedly estimated up to additive error ε using O(ε−2) two-copy measurements, independently of the system size. Moreover, we prove that the fermionic entropy obeys asymptotic continuity and, as a direct consequence, establish its operational meaning as the upper bound to the asymptotic rate of non-Gaussianity distillation. We further derive a linear sample complexity bound for tolerant testing of fermionic Gaussian states, providing a quadratic improvement over the state of the art. As a further application of our results, we study unitary designs generated by Matchgate circuits supplemented with Majorana-local non-Gaussian gates. We prove that a linear number of such gates is necessary even to achieve an approximate state 2-design with error below 0.4%. Combined with known nearly linear upper bounds for relative-error designs, this determines the optimal doping level, up to logarithmic factors, across all relevant design notions and reveals the extensive non-Gaussianity cost required to generate Haar-like quantum dynamics in this architecture.