Quantum state tomography (QST), a required technology for the characterization of quantum communication or computing systems, remains an active research area to increase the throughput of any quantum information system. Traditional fixed Pauli-basis routines take many measurement shots to reach the fidelities demanded by quantum calibration, communication, and sensing protocols. To address this problem for a single-qubit system, we propose a novel adaptive QST method that achieves optimally bounded measurements. Using a discretized Bloch sphere, we update a Bayesian posterior after each measurement to select a new measurement axis, determined by expected information gain. Such a method takes advantage of the infinite dimensionality of Hilbert space by including numerous measurement bases - far more than the standard Pauli triad - and uniquely motivating a search-space reduction method to discard unlikely states and uninformative bases, making the high basis count manageable. Our adaptive QST offers tunable convergence controls such that users can adapt according to required speed and accuracy, noise environments, and workload constraints. Large-scale simulations show our method rapidly approaches the best possible fidelity that closely track the Massar-Popescu optimal mean-fidelity curve with standard deviation scaling of$\mathcal {O}(1/N)$. A photonic experiment implementing QST over 13 candidate bases validates our multi-basis theory.
Quantum state tomography (QST), a required technology for the characterization of quantum communication or computing systems, remains an active research area to increase the throughput of any quantum information system. Traditional fixed Pauli-basis routines take many measurement shots to reach the fidelities demanded by quantum calibration, communication, and sensing protocols. To address this problem for a single-qubit system, we propose a novel adaptive QST method that achieves optimally bounded measurements. Using a discretized Bloch sphere, we update a Bayesian posterior after each measurement to select a new measurement axis, determined by expected information gain. Such a method takes advantage of the infinite dimensionality of Hilbert space by including numerous measurement bases - far more than the standard Pauli triad - and uniquely motivating a search-space reduction method to discard unlikely states and uninformative bases, making the high basis count manageable. Our adaptive QST offers tunable convergence controls such that users can adapt according to required speed and accuracy, noise environments, and workload constraints. Large-scale simulations show our method rapidly approaches the best possible fidelity that closely track the Massar-Popescu optimal mean-fidelity curve with standard deviation scaling ofO(1/N). A photonic experiment implementing QST over 13 candidate bases validates our multi-basis theory.
Quantum state tomography (QST) estimates an unknown quantum state from a measurement process typically performed on identical copies of the target state and plays a core role in characterizing quantum information systems. However, because quantum measurement outcomes are probabilistic, QST methods often require many shots per basis to achieve high-fidelity estimates, which hinders scalability to many-qubit applications and slows the transmission of quantum information. A more efficient procedure is therefore required for modern-day quantum operations in quantum computing, communications, and sensing. We address this need with an adaptive QST approach that measures a single-qubit state in a wide set of bases. We include bases beyond the Pauli triad {X,Y,Z} by leveraging the infinite-dimensional Hilbert space of quantum mechanics, increasing the likelihood of producing highly polarized measurement outcomes and finding an optimally informative basis. With this basis, the state can be identified with fewer measurements by focusing on directions that most reduce uncertainty of the state. In addition to theoretical innovation in [9], we experimentally verify in a simplified photonic realization using 13 bases that having many more available measurement bases than the Pauli triad benefits QST. This engineering implementation demonstrates that adaptive QST is both efficient in performance and practical to implement.
Quantum state tomography (QST) is a fundamental technique for characterizing the state of a quantum system. However, traditional QST protocols often require a large number of measurements, leading to significant experimental overhead and uncertainties in the reconstructed state. This paper proposes a novel approach to QST that leverages reinforcement learning (RL) to dynamically adapt measurement strategies. The core idea is to train an RL agent to control the parameters of the QST experiment, learning to optimize the measurement process based on feedback from the acquired data. The agent learns to select measurement bases and angles that minimize the uncertainty in the reconstructed quantum state. This adaptive strategy significantly reduces the number of measurements needed compared to traditional QST while maintaining high accuracy. We present a theoretical framework for this approach, outlining the key components and demonstrating its potential for improved QST performance. The proposed method offers a promising direction for enhancing the efficiency and reliability of QST, contributing to the advancement of quantum information processing.
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.
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.
Recently, tremendous progress has been made in the field of quantum science and technologies: different platforms for quantum simulation as well as quantum computing, ranging from superconducting qubits to neutral atoms, are starting to reach unprecedentedly large systems. In order to benchmark these systems and gain physical insights, the need for efficient tools to characterize quantum states arises. The exponential growth of the Hilbert space with system size renders a full reconstruction of the quantum state prohibitively demanding in terms of the number of necessary measurements. Here we propose and implement an efficient scheme for quantum state tomography using active learning. Based on a few initial measurements, the active learning protocol proposes the next measurement basis, designed to yield the maximum information gain. We apply the active learning quantum state tomography scheme to reconstruct different multi-qubit states with varying degree of entanglement as well as to ground states of the XXZ model in 1D and a kinetically constrained spin chain. In all cases, we obtain a significantly improved reconstruction as compared to a reconstruction based on the exact same number of measurements and measurement configurations, but with randomly chosen basis configurations. Our scheme is highly relevant to gain physical insights in quantum many-body systems as well as for benchmarking and characterizing quantum devices, e.g. for quantum simulation, and paves the way for scalable adaptive protocols to probe, prepare, and manipulate quantum systems.
Abstract Current algorithms for quantum state tomography (QST) are costly both on the experimental front, requiring measurement of many copies of the state, and on the classical computational front, needing a long time to analyze the gathered data. Here, we introduce neural adaptive quantum state tomography (NAQT), a fast, flexible machine-learning-based algorithm for QST that adapts measurements and provides orders of magnitude faster processing while retaining state-of-the-art reconstruction accuracy. As in other adaptive QST schemes, measurement adaptation makes use of the information gathered from previous measured copies of the state to perform a targeted sensing of the next copy, maximizing the information gathered from that next copy. Our NAQT approach allows for a rapid and seamless integration of measurement adaptation and statistical inference, using a neural-network replacement of the standard Bayes’ update, to obtain the best estimate of the state. Our algorithm, which falls into the machine learning subfield of “meta-learning” (in effect “learning to learn” about quantum states), does not require any ansatz about the form of the state to be estimated. Despite this generality, it can be retrained within hours on a single laptop for a two-qubit situation, which suggests a feasible time-cost when extended to larger systems and potential speed-ups if provided with additional structure, such as a state ansatz.