Quantum state tomography (QST) aims at estimating a quantum state from averaged quantum measurements made on copies of that state. Most quantum algorithms rely on QST at some point and it is a well-explored topic in the literature, mostly for mixed states. In this paper we focus on the QST of a pure quantum state using parallel unentangled measurements. Pure states are a small but useful subset of all quantum states, and their tomography requires fewer measurements and is essentially a phase recovery problem. Parallel unentangled measurements are easy to implement in practice because they allow the user to measure each qubit individually, e.g., using one-qubit Pauli measurements. We propose two sets of quantum measurements that one can make on a pure state as well as the algorithms that use the measurement outcomes in order to identify the state. We also discuss how those estimates can be fine tuned by finding the state that maximizes the likelihood of the measurements with different variants of the likelihood. The performances of the proposed three types of QST methods are validated by means of detailed numerical tests, including for mixed states that are close to being pure.
Quantum state tomography (QST) aims at estimating a quantum state from averaged quantum measurements made on copies of that state. Most quantum algorithms rely on QST at some point and it is a well-explored topic in the literature, mostly for mixed states. In this paper we focus on the QST of a pure quantum state using parallel unentangled measurements. Pure states are a small but useful subset of all quantum states, and their tomography requires fewer measurements and is essentially a phase recovery problem. Parallel unentangled measurements are easy to implement in practice because they allow the user to measure each qubit individually, e.g., using one-qubit Pauli measurements. We propose two sets of quantum measurements that one can make on a pure state as well as the algorithms that use the measurement outcomes in order to identify the state. We also discuss how those estimates can be fine tuned by finding the state that maximizes the likelihood of the measurements with different variants of the likelihood. The performances of the proposed three types of QST methods are validated by means of detailed numerical tests, including for mixed states that are close to being pure.
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) has been the traditional method for characterization of an unknown state. Recently, many direct measurement methods have been implemented to reconstruct the state in a resource efficient way. In this Letter, we present an interferometric method, in which any qubit state, whether mixed or pure, can be inferred from the visibility, phase shift, and average intensity of an interference pattern using a single-shot measurement-hence, we call it quantum state interferography. This provides us with a "black box" approach to quantum state estimation, wherein, between the incidence of the photon and extraction of state information, we are not changing any conditions within the setup, thus giving us a true single shot estimation of the quantum state. In contrast, standard QST requires at least two measurements for pure state qubit and at least three measurements for mixed state qubit reconstruction. We then go on to show that QSI is more resource efficient than QST for quantification of entanglement in pure bipartite qubits. We experimentally implement our method with high fidelity using the polarization degree of freedom of light. An extension of the scheme to pure states involving d-1 interferograms for d-dimensional systems is also presented. Thus, the scaling gain is even more dramatic in the qudit scenario for our method, where, in contrast, standard QST, without any assumptions, scales roughly as d^{2}.
A longstanding belief in quantum tomography is that estimating a mixed state is far harder than estimating a pure state. This is borne out in the mathematics, where mixed state algorithms have always required more sophisticated techniques to design and analyze than pure state algorithms. We present a new approach to tomography demonstrating that, contrary to this belief, state-of-the-art mixed state tomography follows easily and naturally from pure state algorithms.
We analyze the following strategy: given n copies of an unknown state ρ, convert them into copies of a purification ∣ρ⟩; run a pure state tomography algorithm to produce an estimate of ∣ρ⟩; and output the resulting estimate of ρ. The purification subroutine was recently discovered via the "acorn trick" of Tang, Wright, and Zhandry. With this strategy, we obtain the first tomography algorithm which is sample-optimal in all parameters. For a rank-rd-dimensional state, it uses n=O((rd+log(1/δ))/ε) samples to output an estimate which is ε-close in fidelity with probability at least 1−δ. This algorithm also uses poly(n) gates, making it the first gate-efficient tomography algorithm which is sample-optimal even in terms of the dimension d alone. Moreover, with this method we recover essentially all results on mixed state tomography, including its applications to tomography with limited entanglement, classical shadows, and quantum metrology. Our proofs are simple, closing the gap in conceptual difficulty between mixed and pure tomography. Our results also clarify the role of entangled measurement in mixed state tomography: the only step of the algorithm which requires entanglement across copies is the purification step, suggesting that, for tomography, the reason entanglement is useful is for consistent purification.
Quantum process tomography (QPT) methods aim at identifying a given quantum process. QPT is a major quantum information processing tool, since it allows one to characterize the actual behavior of quantum gates, which are the building blocks of quantum computers. The present paper focuses on the estimation of a unitary process. This class is of particular interest because quantum mechanics postulates that the evolution of any closed quantum system is described by a unitary transformation. The standard approach of QPT is to measure copies of a particular set of predetermined (generally pure) states after they have been modified by the process to be identified. The main problem with this setup is that preparing an input state and setting it precisely to a predetermined value is challenging and thus yields errors. These errors can be decomposed into a sum of centered errors (i.e., whose average on all the copies is zero) and systematic errors that are the same for all the copies. The latter is often the main source of error in QPT. The algorithm we introduce works for any input states that make QPT theoretically possible (i.e., unless there are several solutions due to, e.g., a lack of diversity in the input states). The fact that we do not require the input states to be precisely set to predetermined values means that we can use a trick to remove the issue of systematic errors by considering that some states' copies are unknown but measured before they go through the process to be identified. We achieve this by splitting the copies of each input state into several groups and measuring the copies of the kth group after they have successively been transferred through k instances of the process to be identified (each copy of each input state is used for only a single measurement). Using this approach, we can compute estimates of the measured states before and after they go through the process without using the knowledge we might have about the initial states. We test our algorithm with simulated data, and we assess its performance with a cnot gate on a trapped-ions qubit quantum computer.
Quantum state tomography (QST) refers to any method that allows one to reconstruct the accurate representation of a quantum system based on data obtainable from an experiment. In this paper, we concentrate on theoretical methods of quantum tomography, but some significant experimental results are also presented. Due to a considerable body of literature and intensive ongoing research activity in the field of QST, this overview is restricted to presenting selected ideas, methods, and results. First, we discuss tomography of pure states by distinguishing two aspects—complex vector reconstruction and wavefunction measurement. Then, we move on to the Wigner function reconstruction. Finally, the core section of the article is devoted to the stroboscopic tomography, which provides the optimal criteria for state recovery by including the dynamics in the scheme. Throughout the paper, we pay particular attention to photonic tomography, since multiple protocols in quantum optics require well-defined states of light.
We give an algorithm for pure state tomography with near-optimal copy and time complexity using only single-qubit measurements. Specifically, given O(2n/ε) copies of an unknown n-qubit pure state ∣ψ⟩, the algorithm performs only nonadaptive Pauli measurements, runs in time O(2n/ε), and outputs ∣ψ⟩ with fidelity at least 1−ε with ∣ψ⟩ with high probability. This is the first algorithm for pure state tomography that achieves near-optimal running time.