Problem: Quantum state tomography (QST) is the bottleneck for characterizing intermediate-scale quantum devices, scaling exponentially in measurement complexity (4n) and reconstruction time. Standard iterative optimization methods become computationally intractable for systems beyond 5-6 qubits, limiting real-time characterization capabilities essential for quantum error correction and adaptive protocols. Solution: We introduce Geometric Shadow Inversion (GSI), a reconstruction framework that treats quan- tum state recovery as kernel regression on the density matrix manifold. GSI utilizes a Gaussian-weighted adjoint projection to triangulate the state geometry in a single non-iterative pass, eliminating the computational bottle- neck of iterative optimization entirely. Key Discovery: We identify a fundamental information threshold at measurement ratio M/P ≈1.17 where quantum state reconstruction undergoes a sharp performance transition. Systematic validation across M/P ∈[0.08, 7.84] for 4-qubit systems reveals three distinct regimes: (1) Underdetermined (M/P < 0.6): F < 0.997, performance sensitive to bandwidth; (2) Information Threshold (0.6 < M/P < 2): F crosses 0.9975 and becomes robust to bandwidth—variations of ±50% in σ (range 0.7–1.5) produce fidelity changes < 0.03; (3) Overdetermined (M/P > 2): F →0.999, saturated performance. This robustness at threshold is the signature of geometric regularization making theoretically-sufficient measurements practically sufficient. Our choice of σ = 0.78 operates within this robust plateau, explaining its consistent performance across system sizes n ∈[3, 6]. Below the information threshold, GSI extends into the strongly underdetermined regime (M/P= 0.73), achiev- ing F= 0.905 ±0.004 for 6-qubit states through geometric smoothness priors. Impact: With runtimes of ≈10ms (3 qubits) to ≈5min (6 qubits), GSI enables real-time calibration loops for drift monitoring in logical qubit blocks and tractable diagnostic verification for NISQ hardware. The information threshold phenomenon provides both a practical tool for continuous state characterization and a theoretical framework connecting kernel geometry to fundamental information-theoretic limits in quantum reconstruction.
Problem: Quantum state tomography (QST) is the bottleneck for characterizing intermediate-scale quantum devices, scaling exponentially in measurement complexity (4n) and reconstruction time. Standard iterative optimization methods become computationally intractable for systems beyond 5-6 qubits, limiting real-time characterization capabilities essential for quantum error correction and adaptive protocols. Solution: We introduce Geometric Shadow Inversion (GSI), a reconstruction framework that treats quan- tum state recovery as kernel regression on the density matrix manifold. GSI utilizes a Gaussian-weighted adjoint projection to triangulate the state geometry in a single non-iterative pass, eliminating the computational bottle- neck of iterative optimization entirely. Key Discovery: We identify a fundamental information threshold at measurement ratio M/P ≈1.17 where quantum state reconstruction undergoes a sharp performance transition. Systematic validation across M/P ∈[0.08, 7.84] for 4-qubit systems reveals three distinct regimes: (1) Underdetermined (M/P < 0.6): F < 0.997, performance sensitive to bandwidth; (2) Information Threshold (0.6 < M/P < 2): F crosses 0.9975 and becomes robust to bandwidth—variations of ±50% in σ (range 0.7–1.5) produce fidelity changes < 0.03; (3) Overdetermined (M/P > 2): F →0.999, saturated performance. This robustness at threshold is the signature of geometric regularization making theoretically-sufficient measurements practically sufficient. Our choice of σ = 0.78 operates within this robust plateau, explaining its consistent performance across system sizes n ∈[3, 6]. Below the information threshold, GSI extends into the strongly underdetermined regime (M/P= 0.73), achiev- ing F= 0.905 ±0.004 for 6-qubit states through geometric smoothness priors. Impact: With runtimes of ≈10ms (3 qubits) to ≈5min (6 qubits), GSI enables real-time calibration loops for drift monitoring in logical qubit blocks and tractable diagnostic verification for NISQ hardware. The information threshold phenomenon provides both a practical tool for continuous state characterization and a theoretical framework connecting kernel geometry to fundamental information-theoretic limits in quantum reconstruction.
Quantum computers solve ever more complex tasks using steadily growing system sizes.Characterizing these quantum systems is vital, yet becoming increasingly challenging.The gold-standard method for this task is quantum state tomography (QST), capable of fully reconstructing a quantum state without prior knowledge.The measurement and classical computing costs, however, increase exponentially with the number of constituents (e.g., qubits)-a daunting bottleneck given the scale of existing and nearterm quantum devices.Here, we demonstrate a scalable and practical QST approach that only uses a single measurement setting, namely symmetric informationally complete (SIC) positive operator-valued measures (POVMs).We implement these nonorthogonal measurements on an ion trap quantum processor by utilizing additional energy levels within each ion-without requiring ancillary ions to assist in measurements.More precisely, we locally map the SIC POVM to orthogonal states embedded in a higher-dimensional system, which we read out using repeated in-sequence detections, thereby providing full tomographic information in every shot.Combining this SIC tomography with the recently developed randomized measurement toolbox ("classical shadows") proves to be a powerful combination.SIC tomography alleviates the need for choosing measurement settings at random ("derandomization"), while classical shadows enable the estimation of arbitrary polynomial functions of the density matrix orders of magnitudes faster than standard methods.The latter enables in-depth entanglement characterization, which we experimentally showcase on a five-qubit absolutely maximally entangled state.Moreover, the fact that the full tomography information is available in every shot enables online QST in real time (i.e., while the experiment is running).We demonstrate this on an eight-qubit entangled state (which has 2 8 • 2 8 -1 = 65 535 degrees of freedom), as well as for fast state identification.All in all, these features single out SIC-based classical shadow estimation as a highly scalable and convenient tool for quantum state characterization.
Abstract Quantum state tomography (QST) is a widely employed technique for characterizing the state of a quantum system. However, it is plagued by two fundamental challenges: computational and experimental complexity grows exponentially with the number of qubits, rendering experimental implementation and data post-processing arduous even for moderately sized systems. Here, we introduce gradient-descent (GD) algorithms for the post-processing step of QST in discrete- and continuous-variable systems. To ensure physically valid state reconstruction at each iteration step of the algorithm, we use various density-matrix parameterizations: Cholesky decomposition, Stiefel manifold, and projective normalization. These parameterizations have the added benefit of enabling a rank-controlled ansatz, which simplifies reconstruction when there is prior information about the system. We benchmark the performance of our GD-QST techniques against state-of-the-art methods, including constrained convex optimization, conditional generative adversarial networks, and iterative maximum likelihood estimation. Our comparison focuses on time complexity, iteration counts, data requirements, state rank, and robustness against noise. We find that rank-controlled ansatzes in our stochastic mini-batch GD-QST algorithms effectively handle noisy and incomplete data sets, yielding significantly higher reconstruction fidelity than other methods. Simulations achieving full-rank seven-qubit QST in under three minutes on a standard laptop, with 18 GB of RAM and no dedicated GPU, highlight that GD-QST is computationally more efficient and outperforms other techniques in most scenarios, offering a promising avenue for characterizing noisy intermediate-scale quantum devices. Our Python code for GD-QST algorithms is publicly available at github.com/mstorresh/GD-QST .
Reconstruction of the quantum density operator ρ from finite projective measurement statistics is a foundational requirement for quantum characterization, verification, and benchmarking (QCVB) in modern quantum processors. However, standard linear inversion systematically fails non-negativity (λmin < 0) in the presence of statistical shot noise, yielding unphysical indefinite operators that violate the Born rule and predict negative probabilities. Conversely, standard iterative Maximum Likelihood Estimation (MLE) via Hradil's RρR map or Semidefinite Programming (SDP) incurs high computational overhead and exhibits sensitivity to rank deficiencies, creating severe latency bottlenecks in automated quantum processing unit (QPU) calibration sweeps. Here, we present IdemQST, a deterministic quantum state tomography framework governed by idempotent projection operator theory (Π2 = Π). In an informationally complete orthogonal Pauli basis, sequential projection across measurement hyperplanes collapses in exactly one pass to the unconstrained linear inversion estimate ρlin, and subsequent Euclidean simplex spectral projection ΠΔ yields the exact global Frobenius-closest physical state on the quantum state cone Sd, establishing mathematical equivalence to Projected Linear Inversion (PLI; Smolin, Gambetta, and Smith, 2012). Rather than asserting novel algorithmic optimality for the simplex step, IdemQST re-articulates this foundation within metric idempotent operator algebra, integrates zero-heap static workspace caching (IdemKV), provides empirical dynamic drift cancellation via Dynamic Permutation Networks (DPN), and extends to incomplete or shadow tomography (M < 4N - 1) via cyclic Projections Onto Convex Sets (POCS). Across simulated projective Born measurements on one-, two-, and three-qubit systems under realistic Poisson shot noise (Nshots ∈ [102, 2 × 104]), IdemQST unconditionally eliminates negative eigenvalues (λmin ≥ 0), conserves unit trace to machine precision (10-15), and achieves state fidelities F > 0.994 under pure prior projection or large shot budgets. Crucially, across N=30 repeated timing benchmarks, IdemQST executes the core simplex spectral projection in 96.7 ± 44.3 μs for two-qubit Bell states (39.3× speedup over Hradil MLE and 41.1× over Diluted MLE) and 0.145 ± 0.035 ms (145.0 μs) for three-qubit GHZ states (d=8), achieving a 111.0× speedup over iterative Hradil MLE (16.08 ± 2.17 ms) and 113.6× over accelerated Diluted MLE (16.46 ± 1.58 ms; Šeháček et al., 2007). Furthermore, we incorporate State Preparation and Measurement (SPAM) readout mitigation via simplex-constrained assignment inversion, providing a deterministic, hardware-ready platform for real-time automated QPU calibration.
Quantum state tomography (QST) is a fundamental task in quantum information science that aims to reconstruct unknown quantum states from measurement data. However, the exponential growth of Hilbert-space dimension with system size makes full tomography of general quantum states statistically and computationally prohibitive. This challenge has motivated extensive research on structured quantum state tomography, where prior structure, such as low-rankness, tensor-network representations, shallow quantum circuits, and neural quantum states, can substantially reduce the effective degrees of freedom and enable scalable recovery. In this review, we provide a unified perspective on QST for structured quantum states through three closely related themes: compact state representations, measurement design, and computational algorithms. After reviewing common models for structured quantum states, we survey existing work on geometric preservation properties of measurement frameworks, ranging from informationally complete POVMs to randomized measurements, and their implications for sample complexity. On the algorithmic side, we review optimization methods for reconstructing structured quantum states from empirical measurements. By connecting QST with broader principles from compressive sensing, matrix sensing, and structured inverse problems, this survey highlights common theoretical foundations underlying sample complexity, measurement efficiency, and scalable recovery.
Quantum state tomography (QST) is a fundamental technique in quantum information science, aiming to reconstruct the density matrix of an unknown quantum state from experimental measurements. However, traditional QST methods often suffer from significant computational demands and are highly susceptible to measurement noise, hindering their practical application, particularly with near-term quantum computers. This work proposes a novel approach to QST utilizing variational quantum algorithms (VQAs). VQAs iteratively optimize a parameterized quantum circuit to minimize a cost function related to the fidelity between the desired state and the state predicted by the circuit. This approach dramatically reduces the number of required measurements and offers the potential for achieving high-fidelity state reconstruction with lower quantum resource requirements. We detail the theoretical framework, outlining the core algorithms and mathematical formulations. The key advantage lies in the ability to learn the state directly, mitigating the limitations of traditional methods. We explore the optimization landscape and discuss strategies for improving convergence and robustness. The results demonstrate a promising path toward scalable and robust QST on quantum devices.
Scalable characterization of quantum processors is crucial for mitigating noise and imperfections. While randomized measurement protocols enable efficient access to local observables, inferring a globally consistent description of multi-qubit processes remains challenging. Here we introduce a local-to-global reconstruction framework for one-dimensional multi-qubit states and channels. The method is efficient provided that correlations, as quantified by the conditional mutual information, decay exponentially. In particular, we prove that under this assumption, the required number of samples scales polynomially with the system size and the desired global reconstruction error. Our approach is based on combining local shadow tomography with locally optimal recovery maps obtained by convex optimization. We supplement these rigorous guarantees by studying the performance of the protocol numerically for a system evolving under a local Lindbladian and a noisy, shallow circuit. By employing a tensor networ representation, we reconstruct channels acting on up to 50 qubits and accurately recover global diagnostics such as the process fidelity, the Choi state purity, and Pauli-weight-resolved process matrix elements. Our work thus extends the powerful toolbox local shadow tomography to scalable channel characterization with access to global properties.