Extracting tomographic information about quantum states is a crucial task in the quest towards devising high-precision quantum devices. Current schemes typically require measurement devices for tomography that are a priori calibrated to high precision. Ironically, the accuracy of the measurement calibration is fundamentally limited by the accuracy of state preparation, establishing a vicious cycle. Here, we prove that this cycle can be broken and the dependence on the measurement device's calibration significantly relaxed. We show that exploiting the natural low-rank structure of quantum states of interest suffices to arrive at a highly scalable `blind' tomography scheme with a classically efficient post-processing algorithm. We further improve the efficiency of our scheme by making use of the sparse structure of the calibrations. This is achieved by relaxing the blind quantum tomography problem to the de-mixing of a sparse sum of low-rank matrices. We prove that the proposed algorithm recovers a low-rank quantum state and the calibration provided that the measurement model exhibits a restricted isometry property. For generic measurements, we show that it requires a close-to-optimal number of measurement settings. Complementing these conceptual and mathematical insights, we numerically demonstrate that robust blind quantum tomography is possible in a practical setting inspired by an implementation of trapped ions.
Extracting tomographic information about quantum states is a crucial task in the quest towards devising high-precision quantum devices. Current schemes typically require measurement devices for tomography that are a priori calibrated to high precision. Ironically, the accuracy of the measurement calibration is fundamentally limited by the accuracy of state preparation, establishing a vicious cycle. Here, we prove that this cycle can be broken and the dependence on the measurement device's calibration significantly relaxed. We show that exploiting the natural low-rank structure of quantum states of interest suffices to arrive at a highly scalable `blind' tomography scheme with a classically efficient post-processing algorithm. We further improve the efficiency of our scheme by making use of the sparse structure of the calibrations. This is achieved by relaxing the blind quantum tomography problem to the de-mixing of a sparse sum of low-rank matrices. We prove that the proposed algorithm recovers a low-rank quantum state and the calibration provided that the measurement model exhibits a restricted isometry property. For generic measurements, we show that it requires a close-to-optimal number of measurement settings. Complementing these conceptual and mathematical insights, we numerically demonstrate that robust blind quantum tomography is possible in a practical setting inspired by an implementation of trapped ions.
The calibration of quantum measurements is limited by the ability to accurately prepare quantum states under unknown device errors. We develop an accurate calibration protocol for the measurement apparatus of a quantum computer that is `blind' to the state preparation. Blind calibration quantifies and corrects measurement errors from simple tomographic data on a noisy quantum state. Importantly, it calibrates multiple error mechanisms in a single experiment, eliminating the need for bespoke, separate calibration experiments. Using a trapped-ion quantum computer, we systematically demonstrate the accuracy of the method. We use blind calibration to estimate the native calibration parameters of the experimental system. The recovered calibrations are consistent with directly measured values and perform similarly in predicting the state properties.
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.
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.
In quantum information transformation and quantum computation, the most critical issues are security and accuracy. These features, therefore, stimulate research on quantum state characterization. A characterization tool, Quantum state tomography, reconstructs the density matrix of an unknown quantum state. Theoretically, reconstructing an unknown state using this method can be arbitrarily accurate. However, this is less practical owing to the huge burden of measurements and data processing for large numbers of qubits. Even comprising an efficient estimator and a precise algorithm, an optimal tomographic framework can also be overburdened owing to the exponential growth of the measurements. Moreover, the consequential postprocessing of huge amounts of data challenges the capacity of computers. Thus, it is crucial to build an efficient framework that requires fewer measurements but yields an expected accuracy. To this end, we built a tomography schema by which only a few Pauli measurements enable an accurate tomographic reconstruction. Subsequently, this schema was verified as efficient and accurate through numerical simulations on the tomography of multi-qubit quantum states. Furthermore, this schema was proven to be robust through numerical simulations on a noisy superconducting qubit system. Therefore, the tomography schema paves an alternatively effective way to reconstruct the density matrix of a quantum state owing to its efficiency and accuracy, which are essential for quantum state tomography.
Abstract Characterizing the dynamics of quantum systems is a central task for the development of quantum information processors (QIPs). It serves to benchmark different devices, learn about their specific noise, and plan the next hardware upgrades. However, this task is also very challenging, for it requires a large number of measurements and time-consuming classical processing. Moreover, when interested in the time dependence of the noise, there is an additional overhead since the characterization must be performed repeatedly within the time interval of interest. To overcome this limitation while, at the same time, ordering the learned sources of noise by their relevance, we focus on the inference of the dynamical generators of the noisy dynamics using Lindbladian quantum tomography (LQT). We propose two different improvements of LQT that alleviate previous shortcomings. In the weak-noise regime of current QIPs, we manage to linearize the maximum likelihood estimation of LQT, turning the constrained optimization into a convex problem to reduce the classical computation cost and to improve its robustness. Moreover, by introducing compressed sensing techniques, we reduce the number of required measurements without sacrificing accuracy. To illustrate these improvements, we apply our LQT tools to trapped-ion experiments of single- and two-qubit gates, advancing in this way the previous state of the art.
Estimation of quantum states and measurements is crucial for the implementation of quantum information protocols. The standard method for each is quantum tomography. However, quantum tomography suffers from systematic errors caused by imperfect knowledge of the system. We present a procedure to simultaneously characterize quantum states and measurements that mitigates systematic errors by use of a single high-fidelity state preparation and a limited set of high-fidelity unitary operations. Such states and operations are typical of many state-of-the-art systems. For this situation we design a set of experiments and an optimization algorithm that alternates between maximizing the likelihood with respect to the states and measurements to produce estimates of each. In some cases, the procedure does not enable unique estimation of the states. For these cases, we show how one may identify a set of density matrices compatible with the measurements and use a semi-definite program to place bounds on the state's expectation values. We demonstrate the procedure on data from a simulated experiment with two trapped ions.