We introduce the concept of selective quantum state tomography or SQST, a tomographic scheme that enables a user to estimate arbitrary elements of an unknown quantum state using a fixed measurement record. We demonstrate how this may be done with the following notable advantages (i) a number of state copies that depends only on the desired precision of the estimation, rather than the dimension of the unknown state; (ii) a similar reduction in the requisite classical memory and computational cost; (iii) an approach to state tomography using $O(ε^{-2}\log d)$ state copies for maximum norm error $ε$, as well as achieving nearly optimal bounds for full tomography with independent measurements. As an immediate extension to this technique we proceed to show that SQST can be used to generate an universal data sample, of fixed and dimension independent size, from which one can extract the mean values from a continuous class of operators on demand.
We introduce the concept of selective quantum state tomography or SQST, a tomographic scheme that enables a user to estimate arbitrary elements of an unknown quantum state using a fixed measurement record. We demonstrate how this may be done with the following notable advantages (i) a number of state copies that depends only on the desired precision of the estimation, rather than the dimension of the unknown state; (ii) a similar reduction in the requisite classical memory and computational cost; (iii) an approach to state tomography using O(ε−2logd) state copies for maximum norm error ε, as well as achieving nearly optimal bounds for full tomography with independent measurements. As an immediate extension to this technique we proceed to show that SQST can be used to generate an universal data sample, of fixed and dimension independent size, from which one can extract the mean values from a continuous class of operators on demand.
Quantum state tomography (QST) is a crucial tool for characterizing quantum states. However, performing full QST becomes impractical for reconstructing multiqubit density matrices since datasets and computational costs grow exponentially with qubit number. To bypass full QST, we introduce selective and efficient QST (SEEQST)—a method that enables efficient estimation of multiple selected elements of an arbitrary multiqubit density matrix. We show that any N -qubit density matrix can be partitioned into 2 N disjoint subsets, each containing 2 N elements. With SEEQST, any such subset can be accurately estimated from just two experiments with only single-qubit measurements. The complexity for estimating any subset remains constant regardless of Hilbert-space dimension, so, if desired, SEEQST can reconstruct the full density matrix, using 2 N + 1 − 1 experiments, where standard methods would use 3 N experiments. We provide a circuit decomposition for the SEEQST experiments, demonstrating that their maximum circuit depth scales logarithmically with N assuming all-to-all connectivity.
Quantum state tomography (QST), the task of estimating an unknown quantum state given measurement outcomes, is essential to building reliable quantum computing devices. Whereas computing the maximum-likelihood (ML) estimate corresponds to solving a finite-sum convex optimization problem, the objective function is not smooth nor Lipschitz, so most existing convex optimization methods lack sample complexity guarantees; moreover, both the sample size and dimension grow exponentially with the number of qubits in a QST experiment, so a desired algorithm should be highly scalable with respect to the dimension and sample size, just like stochastic gradient descent. In this paper, we propose a stochastic first-order algorithm that computes an ε-approximate ML estimate in O((DlogD)/ε2) iterations with O(D3) per-iteration time complexity, where D denotes the dimension of the unknown quantum state and ε denotes the optimization error. Our algorithm is an extension of Soft-Bayes to the quantum setup.
Abstract As quantum technologies advance, the ability to generate increasingly large quantum states has experienced rapid development. In this context, the verification and estimation of large entangled systems represent one of the main challenges in the employment of such systems for reliable quantum information processing. Though the most complete technique is undoubtedly full tomography, the inherent exponential increase of experimental and post‐processing resources with system size makes this approach infeasible even at moderate scales. For this reason, there is currently an urgent need to develop novel methods that surpass these limitations. This review article presents novel techniques focusing on a fixed number of resources (sampling complexity), and thus prove suitable for systems of arbitrary dimension. Specifically, a probabilistic framework requiring at best only a single copy for entanglement detection is reviewed, together with the concept of selective quantum state tomography, which enables the estimation of arbitrary elements of an unknown state with a number of copies that is low and independent of the system's size. These hyper‐efficient techniques define a dimensional demarcation for partial tomography and open a path for novel applications.
Quantum tomography requires repeated measurements of many copies of the physical system, all prepared by a source in the unknown state. In the limit of very many copies measured, the often-used maximum-likelihood (ML) method for converting the gathered data into an estimate of the state works very well. For smaller data sets, however, it often suffers from problems of rank deficiency in the estimated state. For many systems of relevance for quantum information processing, the preparation of a very large number of copies of the same quantum state is still a technological challenge, which motivates us to look for estimation strategies that perform well even when there is not much data. After reviewing the concept of minimax state estimation, we use minimax ideas to construct a simple estimator for quantum states. We demonstrate that, for the case of tomography of a single qubit, our estimator significantly outperforms the ML estimator for small number of copies of the state measured. Our estimator is always full-rank, and furthermore, has a natural dependence on the number of copies measured, which is missing in the ML estimator.
We prove that learning an unknown mixed fermionic Gaussian state on m modes to trace distance ε requires Ω(m3/ε2) copies when measurements act on one copy at a time, even with arbitrary POVMs, fresh ancillas and classical adaptivity, but without quantum memory between copies. The bound holds for 0<ε≤1/3600 and separates this model from the known collective rate Θ(m2/ε2). It follows from a uniform single-copy Fisher-information budget and a dimension-independent comparison between trace distance and Gaussian parameters. On covariance matrices of operator norm at most 1−c, we prove a Frobenius-to-trace-norm continuity bound with constant [2c(2−c)]−1/2; matchgate shadows then attain O(m3/(cε2)) copies. This also gives explicit error certificates for thermal free-fermion states. For a class of mixed passive bosonic Gaussian states with total mean photon number at most one, a reduction to bounded-block qudit tomography gives a single-copy lower bound Ω(m3/(ε2log(m/ε))), versus collective complexity Θ(m2/ε2). These separations answer the mixed-state measurement-resource question posed by Chen et al. A two-mode example has optimal two-copy Fisher trace 5, versus the separable ceiling 4. An IBM replication gave a pre-registered witness lower bound 4.12 at one-sided 95% shot-noise confidence; its interpretation assumes the prescribed preparations and a common measurement channel and does not bound preparation systematics.
Given an experimental setup and a fixed number of measurements, how should one take data to optimally reconstruct the state of a quantum system? The problem of optimal experiment design (OED) for quantum state tomography was first broached by Kosut et al. [R. Kosut, I. Walmsley, and H. Rabitz, e-print arXiv:quant-ph/0411093 (2004)]. Here we provide efficient numerical algorithms for finding the optimal design, and analytic results for the case of `minimal tomography'. We also introduce the average OED, which is independent of the state to be reconstructed, and the optimal design for tomography (ODT), which minimizes tomographic bias. Monte Carlo simulations confirm the utility of our results for qubits. Finally, we adapt our approach to deal with constrained techniques such as maximum-likelihood estimation. We find that these are less amenable to optimization than cruder reconstruction methods, such as linear inversion.