Quantum tomography is the most informative tool for estimating the quality of preparation and transformation of quantum states. Its development is crucially necessary for debugging of developed quantum processors. Many existing methods of quantum tomography differ in types of performed measurements and in procedures of their processing. The practical implementation of quantum tomography requires the comparison of different methods, which is complicated because of the absence of a general methodology of estimation. A universal methodology based on numerical experiments has been proposed in this work to estimate the quality of quantum state tomography methods. The developed methodology has been applied to three quantum tomography methods (root approach, compressed sensing, and adaptive tomography) efficiently operating with almost pure states, which is relevant for the current technological foundation of the experiments.
Quantum tomography is the most informative tool for estimating the quality of preparation and transformation of quantum states. Its development is crucially necessary for debugging of developed quantum processors. Many existing methods of quantum tomography differ in types of performed measurements and in procedures of their processing. The practical implementation of quantum tomography requires the comparison of different methods, which is complicated because of the absence of a general methodology of estimation. A universal methodology based on numerical experiments has been proposed in this work to estimate the quality of quantum state tomography methods. The developed methodology has been applied to three quantum tomography methods (root approach, compressed sensing, and adaptive tomography) efficiently operating with almost pure states, which is relevant for the current technological foundation of the experiments.
This paper establishes the methods for quantum state tomography based on compressed sensing.These methods are specialized for quantum states that are fairly pure,and they offer a significant performance improvement on large quantum systems.In particular,they are able to reconstruct an unknown density matrix of dimension d and rank r using O(rdlog2d) measurement settings,compared to standard methods that require d2 settings.The methods have several features that make them amenable to experimental implementation: they require only simple Pauli measurements,use fast convex optimization,are stable against noise,and can be applied to states that are only approximately low rank.The acquired data can be used to certify that the state is indeed close to pure,so no a priori assumptions are needed.
The development of large-scale platforms for quantum information requires new methods for verification and validation of quantum behavior. Quantum tomography (QT) is the standard tool for diagnosing quantum states, process, and readout devices by providing complete information. However, QT is limited since it is expensive to not only implement experimentally, but also requires heavy classical post-processing of data. In this dissertation, we introduce new methods for QT that are more efficient to implement and robust to noise and errors, thereby making QT a more practical tool for current quantum information experiments. The crucial detail that makes these new, efficient, and robust methods possible is prior information about the quantum system. This prior information is prompted by the goals of most experiments in quantum information, which require pure states, unitary processes, and rank-1 POVM operators. Therefore, most experiments are designed to operate near this ideal regime. We show that when this is the case, QT can be accomplished with significantly fewer resources, and produce a robust estimate in the presence of noise and errors. Moreover, the estimate is also robust if the state is not exactly pure, the process is not exactly unitary, or the POVM is not exactly rank-1. Such compelling methods are only made possible by the positivity constraint on quantum states, processes, and POVMs. This requirement is an inherent feature of quantum mechanics, but has powerful consequences to QT. Since QT is necessarily an experimental tool, we discuss a test of these new methods in an experimental setting. The physical system is an ensemble of laser-cooled cesium atoms in the laboratory of Prof. Poul Jessen. Experiments were conducted by Hector Sosa-Martinez et al. to demonstrate different QT protocols. We compare the results, and conclude that the new methods are effective.
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 currently the standard tool for verifying that a state prepared in the lab is close to an ideal target state, but up to now there have been no rigorous methods for evaluating the precision of the state preparation in tomographic experiments. We propose a new estimator for quantum state tomography, and prove that the (always physical) estimates will be close to the true prepared state with a high probability. We derive an explicit formula for evaluating how high the probability is for an arbitrary finite-dimensional system and explicitly give the one- and two-qubit cases as examples. This formula applies for any informationally complete sets of measurements, arbitrary finite number of data sets, and general loss functions including the infidelity, the Hilbert-Schmidt, and the trace distances. Using the formula, we can evaluate not only the difference between the estimated and prepared states, but also the difference between the prepared and target states. This is the first result directly applicable to the problem of evaluating the precision of estimation and preparation in quantum tomographic experiments.
Abstract Quantum tomography is a process of quantum state recognition with multiple measurements. An essential goal for the quantum tomography algorithm is to find measurements that will maximize the useful information about an unknown quantum state obtained through measurements. One of the recently proposed methods of quantum tomography is the algorithm based on rank-preserving transformations. The main idea is to transform a basic measurement set in the way to provide a situation that is equivalent to measuring the maximally mixed state. As long as the tomography of the fully mixed state has the fastest convergence comparing to other states, this method is expected to be highly accurate. We present numerical and experimental comparisons of rank-preserving tomography with another adaptive method, which includes measurements in the estimator eigenbasis and with random-basis tomography. We also study ways to improve the efficiency of the rank-preserving transformations method using the transformation unitary freedom and a measurement set complementation.