Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2608.09625

A Design Space Study of Density Matrix Parameterizations for Diffusion-Based Quantum State Tomography

Shuangu Chang

quant-phmath-phSubmitted Aug 10, 2026• Announced Aug 11, 2026• 0 citations• Revised Aug 13, 2026 (v2)
v1 · Aug 10, 2026v2 · Aug 13, 2026v3 · Sep 19, 2026
arXivHTMLPDF

Abstract

Diffusion-based quantum state tomography (QST) has shown promising results, but all existing methods implicitly adopt a single parameterization (typically Cholesky) without systematic evaluation. We present the first design space study of density matrix parameterizations for diffusion QST, introducing a geometric framework based on the Jacobian Gram matrix $\mathbf{J}^\top\mathbf{J}$. Our calibration of seven parameterizations at 2- and 3-qubit scales, validated by end-to-end training, reveals that \emph{geometric conditioning alone does not predict end-to-end performance}: at 3-qubit scale, Hermitian direct ($κ= 2.0\times$) performs worse than Cholesky ($κ= 27\times$) at all shot levels---a $13.5\times$ isotropy advantage that translates into a fidelity \emph{disadvantage} of up to $+0.51$. The 2-qubit ranking (Hermitian $>$ Bloch) reverses at 3 qubits (Bloch 0.907 vs.\ Hermitian 0.394). We provide a geometric explanation: unbounded parameterizations suffer projection-induced information loss because the PSD constraint couples diagonal and off-diagonal coordinates in ways the unconstrained model cannot respect, whereas the Bloch representation places the maximally mixed state at the center of the valid region, minimizing projection loss.

Related papers

Gradient-descent methods for fast quantum state tomography

Akshay Gaikwad, Manuel Sebastian Torres, Shahnawaz Ahmed +1 more

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 .

arXiv:2503.04526•Quantum Science and Technology•Sep 25, 2025•14 citations

Structured Factorization Approaches for Quantum State Tomography

Zhen Qin, Joseph M. Lukens, Brian T. Kirby +1 more

Since the complexity of quantum state tomography (QST) scales exponentially with system size, exploiting priors such as low-rankness, tensor-network structures, and neural-network representations is essential for scalable QST in terms of sample complexity and parameter complexity. In this paper, we introduce a unified framework, termed structured factorization, that builds on BurerMonteiro-type factorization by parametrizing the density matrix as $FF^\dagger$, where the factor $F$ is constrained to belong to a structured model class. This factorization guarantees physical validity by construction while allowing a broad range of structural priors to be incorporated directly through the choice of the factor space, ranging from the generic Cholesky decomposition to low-rank matrices, matrix product operators, and neural density operators based on multilayer perceptron and transformer architectures. Building on this structured factorization framework, we formulate QST as an optimization problem over the factor space from measurement data. We first develop a unified statistical analysis of the sample complexity of least-squares estimation for a broad class of structured quantum states. We then propose a projected gradient descent method that operates directly on the factor space and accommodates a wide range of structural parametrizations and reconstruction objectives. To further exploit the geometry of the maximum-likelihood estimation formulation and the constraints on the factors, we derive a power method that yields a step-size-free algorithm with fast convergence, recovering Covers method as a special case when the factor is unconstrained.

quant-pharXiv:2607.01608•Jul 3, 2026•3 citations

Quantum State Tomography via Variational Quantum Algorithms

Jincheng Zhang

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.

•Aug 29, 2026•0 citations

Identifiability in Quantum State, Process, and Network Tomography

Athira Kalavampara Raghunadhan, Matheus Guedes De Andrade, Don Towsley +3 more

Quantum State Tomography (QST), Quantum Process Tomography (QPT), and Quantum Network Tomography (QNT) are related parameter-estimation problems that aim to reconstruct different physical quantities. QST estimates an unknown quantum state, represented by its density matrix, from the measurement outcomes. QPT characterises an unknown quantum channel using known input states and measurements of the corresponding outputs. QNT, in contrast, aims to infer parameters associated with individual links from end-to-end probe measurements collected at accessible monitor nodes. A key distinction among the three tomography problems lies in the conditions required to achieve identifiability, the ability to determine unknown parameters uniquely from the available measurement statistics. In QST and QPT, the experimenter can choose an Informationally Complete (IC) measurement set. QNT limits the reachable measurements to what topology and monitor placement allow, so the admissible probe paths fix the information available about the link parameters. This work studies all three tomography problems through a common Fisher Information Matrix (FIM). We factorise QNT FIM and show that its rank equals the rank of the path-link incidence matrix at every interior parameter value, so local and global identifiability coincide. We then show that QST and QPT attain full rank under IC settings, QNT loses rank when the probe paths leave link parameters indistinguishable, and increasing the number of copies scales the FIM eigenvalues while leaving its rank fixed.

quant-pharXiv:2609.13584•Sep 15, 2026•0 citations

Optimal quantum state tomography with noisy gates

Violeta N. Ivanova-Rohling, Niklas Rohling, Guido Burkard

Abstract Quantum state tomography (QST) represents an essential tool for the characterization, verification, and validation (QCVV) of quantum processors. Only for a few idealized scenarios, there are analytic results for the optimal measurement set for QST. E.g., in a setting of non-degenerate measurements, an optimal minimal set of measurement operators for QST has eigenbases which are mutually unbiased. However, in other set-ups, dependent on the rank of the projection operators and the size of the quantum system, the optimal choice of measurements for efficient QST needs to be numerically approximated. We have generalized this problem by introducing the framework of customized efficient QST. Here we extend customized QST and look for the optimal measurement set for QST in the case where some of the quantum gates applied in the measurement process are noisy. To achieve this, we use two distinct noise models: first, the depolarizing channel, and second, over- and under-rotation in single-qubit and to two-qubit gates (for further information, please see Methods). We demonstrate the benefit of using entangling gates for the efficient QST measurement schemes for two qubits at realistic noise levels, by comparing the fidelity of reconstruction of our optimized QST measurement set to the state-of-the-art scheme using only product bases.

arXiv:2203.05677•EPJ Quantum Technology•Jun 28, 2023•17 citations

Physics-Constrained Conditional Generative Learning for Quantum State and Process Tomography

Daming Li, Luhao Shi

Quantum state and process tomography constitute essential diagnostic tools in quantum information science, yet their standard formulations suffer from prohibitive computational scaling as the number of qubits grows. In this work, we introduce a physics-constrained conditional generative adversarial network that bypasses iterative constrained inversion by directly learning a forward generative mapping conditioned on Pauli expectation values. The generator embeds a differentiable Cholesky layer at its output, which enforces Hermiticity, positive semidefiniteness, and unit trace by construction. Our experiments reveal that the strength of the $L^1$ penalty critically governs the emergence of GHZ coherence during training: an excessively large penalty postpones the coherence onset and yields a prolonged low-fidelity plateau, whereas an intermediate value enables the fastest stable convergence. Moreover, for high-temperature thermal states, an over-complete measurement basis proves necessary to prevent sustained late-stage fluctuations. By extending the same Cholesky constraint to the Choi-matrix representation, the framework naturally accommodates quantum process tomography. For systems with $n \ge 6$ qubits, the exponential growth of the underlying $2^n \times 2^n$ density matrix remains the fundamental bottleneck; we discuss how integrating tensor-network structures can contain the per-iteration cost while preserving reconstruction fidelity. Altogether, these results suggest that physically constrained generative learning offers a scalable and amortizable pathway toward data-driven tomography for noisy intermediate-scale quantum devices.

quant-pharXiv:2608.28035•Aug 31, 2026•0 citations
Diffusion-based quantum state tomography (QST) has shown promising results, but all existing methods implicitly adopt a single parameterization (typically Cholesky) without systematic evaluation. We present the first design space study of density matrix parameterizations for diffusion QST, introducing a geometric framework based on the Jacobian Gram matrix J⊤J\mathbf{J}^\top\mathbf{J}J⊤J. Our calibration of seven parameterizations at 2- and 3-qubit scales, validated by end-to-end training, reveals that \emph{geometric conditioning alone does not predict end-to-end performance}: at 3-qubit scale, Hermitian direct (κ=2.0×κ= 2.0\timesκ=2.0×) performs worse than Cholesky (κ=27×κ= 27\timesκ=27×) at all shot levels---a 13.5×13.5\times13.5× isotropy advantage that translates into a fidelity \emph{disadvantage} of up to +0.51+0.51+0.51. The 2-qubit ranking (Hermitian >>> Bloch) reverses at 3 qubits (Bloch 0.907 vs.\ Hermitian 0.394). We provide a geometric explanation: unbounded parameterizations suffer projection-induced information loss because the PSD constraint couples diagonal and off-diagonal coordinates in ways the unconstrained model cannot respect, whereas the Bloch representation places the maximally mixed state at the center of the valid region, minimizing projection loss.
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 .
Since the complexity of quantum state tomography (QST) scales exponentially with system size, exploiting priors such as low-rankness, tensor-network structures, and neural-network representations is essential for scalable QST in terms of sample complexity and parameter complexity. In this paper, we introduce a unified framework, termed structured factorization, that builds on BurerMonteiro-type factorization by parametrizing the density matrix as FF†FF^\daggerFF†, where the factor FFF is constrained to belong to a structured model class. This factorization guarantees physical validity by construction while allowing a broad range of structural priors to be incorporated directly through the choice of the factor space, ranging from the generic Cholesky decomposition to low-rank matrices, matrix product operators, and neural density operators based on multilayer perceptron and transformer architectures. Building on this structured factorization framework, we formulate QST as an optimization problem over the factor space from measurement data. We first develop a unified statistical analysis of the sample complexity of least-squares estimation for a broad class of structured quantum states. We then propose a projected gradient descent method that operates directly on the factor space and accommodates a wide range of structural parametrizations and reconstruction objectives. To further exploit the geometry of the maximum-likelihood estimation formulation and the constraints on the factors, we derive a power method that yields a step-size-free algorithm with fast convergence, recovering Covers method as a special case when the factor is unconstrained.
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.
Quantum State Tomography (QST), Quantum Process Tomography (QPT), and Quantum Network Tomography (QNT) are related parameter-estimation problems that aim to reconstruct different physical quantities. QST estimates an unknown quantum state, represented by its density matrix, from the measurement outcomes. QPT characterises an unknown quantum channel using known input states and measurements of the corresponding outputs. QNT, in contrast, aims to infer parameters associated with individual links from end-to-end probe measurements collected at accessible monitor nodes. A key distinction among the three tomography problems lies in the conditions required to achieve identifiability, the ability to determine unknown parameters uniquely from the available measurement statistics. In QST and QPT, the experimenter can choose an Informationally Complete (IC) measurement set. QNT limits the reachable measurements to what topology and monitor placement allow, so the admissible probe paths fix the information available about the link parameters. This work studies all three tomography problems through a common Fisher Information Matrix (FIM). We factorise QNT FIM and show that its rank equals the rank of the path-link incidence matrix at every interior parameter value, so local and global identifiability coincide. We then show that QST and QPT attain full rank under IC settings, QNT loses rank when the probe paths leave link parameters indistinguishable, and increasing the number of copies scales the FIM eigenvalues while leaving its rank fixed.
Abstract Quantum state tomography (QST) represents an essential tool for the characterization, verification, and validation (QCVV) of quantum processors. Only for a few idealized scenarios, there are analytic results for the optimal measurement set for QST. E.g., in a setting of non-degenerate measurements, an optimal minimal set of measurement operators for QST has eigenbases which are mutually unbiased. However, in other set-ups, dependent on the rank of the projection operators and the size of the quantum system, the optimal choice of measurements for efficient QST needs to be numerically approximated. We have generalized this problem by introducing the framework of customized efficient QST. Here we extend customized QST and look for the optimal measurement set for QST in the case where some of the quantum gates applied in the measurement process are noisy. To achieve this, we use two distinct noise models: first, the depolarizing channel, and second, over- and under-rotation in single-qubit and to two-qubit gates (for further information, please see Methods). We demonstrate the benefit of using entangling gates for the efficient QST measurement schemes for two qubits at realistic noise levels, by comparing the fidelity of reconstruction of our optimized QST measurement set to the state-of-the-art scheme using only product bases.
Quantum state and process tomography constitute essential diagnostic tools in quantum information science, yet their standard formulations suffer from prohibitive computational scaling as the number of qubits grows. In this work, we introduce a physics-constrained conditional generative adversarial network that bypasses iterative constrained inversion by directly learning a forward generative mapping conditioned on Pauli expectation values. The generator embeds a differentiable Cholesky layer at its output, which enforces Hermiticity, positive semidefiniteness, and unit trace by construction. Our experiments reveal that the strength of the L1L^1L1 penalty critically governs the emergence of GHZ coherence during training: an excessively large penalty postpones the coherence onset and yields a prolonged low-fidelity plateau, whereas an intermediate value enables the fastest stable convergence. Moreover, for high-temperature thermal states, an over-complete measurement basis proves necessary to prevent sustained late-stage fluctuations. By extending the same Cholesky constraint to the Choi-matrix representation, the framework naturally accommodates quantum process tomography. For systems with n≥6n \ge 6n≥6 qubits, the exponential growth of the underlying 2n×2n2^n \times 2^n2n×2n density matrix remains the fundamental bottleneck; we discuss how integrating tensor-network structures can contain the per-iteration cost while preserving reconstruction fidelity. Altogether, these results suggest that physically constrained generative learning offers a scalable and amortizable pathway toward data-driven tomography for noisy intermediate-scale quantum devices.