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:2512.15801

Geometric Latent Space Tomography with Metric-Preserving Autoencoders

S. M. Yousuf Iqbal Tomal, Abdullah Al Shafin

quant-phSubmitted Dec 16, 2025• Announced Dec 18, 2025• 0 citations
arXivHTMLPDF

Abstract

Quantum state tomography faces exponential scaling with system size, while recent neural network approaches achieve polynomial scaling at the cost of losing the geometric structure of quantum state space. We introduce geometric latent space tomography, combining classical neural encoders with parameterized quantum circuit decoders trained via a metric-preservation loss that enforces proportionality between latent Euclidean distances and quantum Bures geodesics. On two-qubit mixed states with purity 0.85--0.95 representing NISQ-era decoherence, we achieve high-fidelity reconstruction (mean fidelity $F = 0.942 \pm 0.03$) with an interpretable 20-dimensional latent structure. Critically, latent geodesics exhibit strong linear correlation with Bures distances (Pearson $r = 0.88$, $R^2 = 0.78$), preserving 78\% of quantum metric structure. Geometric analysis reveals intrinsic manifold dimension 6.35 versus 20 ambient dimensions and measurable local curvature ($κ= 0.011 \pm 0.006$), confirming non-trivial Riemannian geometry with $O(d^2)$ computational advantage over $O(4^n)$ density matrix operations. Unlike prior neural tomography, our geometry-aware latent space enables direct state discrimination, fidelity estimation from Euclidean distances, and interpretable error manifolds for quantum error mitigation without repeated full tomography, providing critical capabilities for NISQ devices with limited coherence times.

Comments
9 pages, 4 figures, 5 tables

Related papers

Geometric Shadow Inversion: Real-Time Quantum State Tomography at the Information Threshold

Moralez, Marcos

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.

•Nov 25, 2025•0 citations

Quantum Riemannian Geometry: Curved Geometry of Quantum State Manifolds and its Physical Implications

Rowan Brad Quni-Gudzinas

This manuscript explores the Riemannian geometry of quantum state manifolds and its physical implications. We establish that quantum state manifolds, as submanifolds of Hilbert space, possess intrinsic Riemannian geometry characterized by a metric tensor derived from the Hilbert space inner product. This geometric framework reveals fundamental connections: the distance between nearby states scales with quantum fluctuations, curvature indicates state robustness, and geometric phase transitions occur in many-body systems. We review historical developments from early quantum geometry to modern quantum information geometry, and present methodologies for computing geometric quantities and their physical interpretations. Results include distance-fluctuation relations for coherent states, curvature calculations for SU(2) manifolds, and applications to quantum optimization and metrology via the quantum Fisher information metric. The discussion interprets geometric quantities in terms of uncertainty principles, state robustness, and quantum criticality, while outlining future research directions in quantum chaos-geometry correlations, non-associative geometry, and geometric quantum algorithm design. We conclude that Riemannian geometry provides a powerful framework for understanding and exploiting the structure of quantum state space, with applications across quantum information processing, metrology, and foundational physics.

•Jan 31, 2026•0 citations

Tomography of Quantum States From Structured Measurements via Quantum-Aware Transformer

Hailan Ma, Zhenhong Sun, Daoyi Dong +2 more

Quantum state tomography (QST) is the process of reconstructing the state of a quantum system (mathematically described as a density matrix) through a series of different measurements, which can be solved by learning a parameterized function to translate experimentally measured statistics into physical density matrices. However, the specific structure of quantum measurements for characterizing a quantum state has been neglected in previous work. In this article, we explore the similarity between highly structured sentences in natural language and intrinsically structured measurements in QST. To fully leverage the intrinsic quantum characteristics involved in QST, we design a quantum-aware transformer (QAT) model to capture the complex relationship between measured frequencies and density matrices. In particular, we query quantum operators in the architecture to facilitate informative representations of quantum data and integrate the Bures distance into the loss function to evaluate quantum state fidelity, thereby enabling the reconstruction of quantum states from measured data with high fidelity. Extensive simulations and experiments (on IBM quantum computers) demonstrate the superiority of the QAT in reconstructing quantum states with favorable robustness against experimental noise.

arXiv:2305.05433•IEEE Transactions on Cybernetics•Apr 14, 2025•27 citations

Inductive Graph Convolutional Quantum Process Tomography: A Scalable Geometric Deep Learning Approach

Imed Bouaker

Abstract Quantum process tomography (QPT) is a fundamental task in quantum information science, yet it suffers from exponential scaling in the number of qubits. We introduce an inductive graph convolutional approach, IGC-QPT, that overcomes this limitation by exploiting the geometric structure of Choi matrices. The method constructs a graph based on a fast low-rank approximation of the Bures distance, then learns a GraphSAGE encoder to map measurement data to low-dimensional embeddings that preserve the local geometry of the process space. This enables efficient and accurate reconstruction of unknown quantum processes from limited measurements for systems up to seven qubits. Theoretical analysis provides sample complexity bounds with complete proofs, including a detailed analysis of the low-rank approximation error. Extensive numerical experiments on 2–7 qubit systems, with full statistical reporting, demonstrate that IGC-QPT significantly outperforms standard QPT (LS), compressed sensing (CS), and neural network methods (NN), achieving high fidelity with orders of magnitude speedup. A detailed discussion of assumptions, limitations, and practical considerations such as transfer learning for reducing training requirements is provided, along with robustness checks.

•Mar 24, 2026•0 citations

BuresTomFlow: Bures-Geometric Flow Matching for Posterior Quantum Tomography

Lu Wei, Yufeng Wang, Chenfeng Cao +1 more

Finite-shot quantum tomography often leaves a posterior over many density matrices compatible with the same measurement record, but fast reconstruction methods collapse this uncertainty to a single state. We frame this setting as amortized posterior sampling and introduce BuresTomFlow, a measurement-conditioned Flow Matching sampler for full-rank density matrices. The method transports base density matrices along Bures-Wasserstein paths on the positive matrix cone, projects the path back to the trace-one state space, and trains the velocity field with a Bures-aligned tangent loss. Thus the sampler is trained in the same fidelity-based geometry used to judge posterior quality. We evaluate BuresTomFlow in dense four-qubit simulations with count, shadow, and mixed measurement records. Against Cholesky, log-density, and generic Riemannian Flow Matching controls at comparable learned-sampler runtime, BuresTomFlow improves Bures distance, credible-ball coverage, and held-out observable prediction. In the main comparison across multiple seeds, mean Bures distance decreases from 0.618 for the Cholesky baseline to 0.367 for BuresTomFlow, and mean coverage error decreases from 0.203 to 0.100. These results show that the value of Bures geometry is not merely enforcing physical states, but producing calibrated posterior uncertainty when finite-record tomography cannot be reduced to one reconstruction.

•Nov 11, 2026•0 citations

Loss-aware state space geometry for quantum variational algorithms

Ankit Gill, Kunal Pal

The natural gradient descent optimisation technique is an efficient optimising protocol for broad classes of classical and quantum systems that takes the underlying geometry of the parameter manifold into account by means of using either the Fisher information metric of the classical probability distribution function or the Fubini-Study tensor of the associated parametrised quantum states in the consequent update rules. Even though the natural gradient descent procedure utilises the geometry of the space of probability or states, it is, however, insensitive to the measure of parametrised distance on the space of possible outcomes when the corresponding optimising problem is considered for the expectation value of a classical or quantum observable with respect to the probability distribution or the quantum state. In this work, we introduce a generic optimising principle, where the intrinsic geometry of the space of outcomes has been taken into account suitably, either by using an ambient space construction with a base statistical manifold with the usual Fisher information metric (or the Fubini-Study tensor), where the loss hypersurface is embedded to, or by means of a first-principle construction from the overlap of nearby quantum states on the projective Hilbert space. This construction as well as a family of conformal variants yields a form of loss-aware natural gradient updates that rescale the effective step size while preserving the descent direction. We benchmark the resulting optimisers on variational quantum circuit examples and on a classical neural network task, finding that, while the standard natural gradient remains the most robust on average, the proposed conformal schemes can improve best-case convergence in favourable regimes.

quant-pharXiv:2604.05627•Journal of Physics A Mathematical and Theoretical•Apr 8, 2026•0 citations
Quantum state tomography faces exponential scaling with system size, while recent neural network approaches achieve polynomial scaling at the cost of losing the geometric structure of quantum state space. We introduce geometric latent space tomography, combining classical neural encoders with parameterized quantum circuit decoders trained via a metric-preservation loss that enforces proportionality between latent Euclidean distances and quantum Bures geodesics. On two-qubit mixed states with purity 0.85--0.95 representing NISQ-era decoherence, we achieve high-fidelity reconstruction (mean fidelity F=0.942±0.03F = 0.942 \pm 0.03F=0.942±0.03) with an interpretable 20-dimensional latent structure. Critically, latent geodesics exhibit strong linear correlation with Bures distances (Pearson r=0.88r = 0.88r=0.88, R2=0.78R^2 = 0.78R2=0.78), preserving 78% of quantum metric structure. Geometric analysis reveals intrinsic manifold dimension 6.35 versus 20 ambient dimensions and measurable local curvature (κ=0.011±0.006κ= 0.011 \pm 0.006κ=0.011±0.006), confirming non-trivial Riemannian geometry with O(d2)O(d^2)O(d2) computational advantage over O(4n)O(4^n)O(4n) density matrix operations. Unlike prior neural tomography, our geometry-aware latent space enables direct state discrimination, fidelity estimation from Euclidean distances, and interpretable error manifolds for quantum error mitigation without repeated full tomography, providing critical capabilities for NISQ devices with limited coherence times.
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.
This manuscript explores the Riemannian geometry of quantum state manifolds and its physical implications. We establish that quantum state manifolds, as submanifolds of Hilbert space, possess intrinsic Riemannian geometry characterized by a metric tensor derived from the Hilbert space inner product. This geometric framework reveals fundamental connections: the distance between nearby states scales with quantum fluctuations, curvature indicates state robustness, and geometric phase transitions occur in many-body systems. We review historical developments from early quantum geometry to modern quantum information geometry, and present methodologies for computing geometric quantities and their physical interpretations. Results include distance-fluctuation relations for coherent states, curvature calculations for SU(2) manifolds, and applications to quantum optimization and metrology via the quantum Fisher information metric. The discussion interprets geometric quantities in terms of uncertainty principles, state robustness, and quantum criticality, while outlining future research directions in quantum chaos-geometry correlations, non-associative geometry, and geometric quantum algorithm design. We conclude that Riemannian geometry provides a powerful framework for understanding and exploiting the structure of quantum state space, with applications across quantum information processing, metrology, and foundational physics.
Quantum state tomography (QST) is the process of reconstructing the state of a quantum system (mathematically described as a density matrix) through a series of different measurements, which can be solved by learning a parameterized function to translate experimentally measured statistics into physical density matrices. However, the specific structure of quantum measurements for characterizing a quantum state has been neglected in previous work. In this article, we explore the similarity between highly structured sentences in natural language and intrinsically structured measurements in QST. To fully leverage the intrinsic quantum characteristics involved in QST, we design a quantum-aware transformer (QAT) model to capture the complex relationship between measured frequencies and density matrices. In particular, we query quantum operators in the architecture to facilitate informative representations of quantum data and integrate the Bures distance into the loss function to evaluate quantum state fidelity, thereby enabling the reconstruction of quantum states from measured data with high fidelity. Extensive simulations and experiments (on IBM quantum computers) demonstrate the superiority of the QAT in reconstructing quantum states with favorable robustness against experimental noise.
Abstract Quantum process tomography (QPT) is a fundamental task in quantum information science, yet it suffers from exponential scaling in the number of qubits. We introduce an inductive graph convolutional approach, IGC-QPT, that overcomes this limitation by exploiting the geometric structure of Choi matrices. The method constructs a graph based on a fast low-rank approximation of the Bures distance, then learns a GraphSAGE encoder to map measurement data to low-dimensional embeddings that preserve the local geometry of the process space. This enables efficient and accurate reconstruction of unknown quantum processes from limited measurements for systems up to seven qubits. Theoretical analysis provides sample complexity bounds with complete proofs, including a detailed analysis of the low-rank approximation error. Extensive numerical experiments on 2–7 qubit systems, with full statistical reporting, demonstrate that IGC-QPT significantly outperforms standard QPT (LS), compressed sensing (CS), and neural network methods (NN), achieving high fidelity with orders of magnitude speedup. A detailed discussion of assumptions, limitations, and practical considerations such as transfer learning for reducing training requirements is provided, along with robustness checks.
Finite-shot quantum tomography often leaves a posterior over many density matrices compatible with the same measurement record, but fast reconstruction methods collapse this uncertainty to a single state. We frame this setting as amortized posterior sampling and introduce BuresTomFlow, a measurement-conditioned Flow Matching sampler for full-rank density matrices. The method transports base density matrices along Bures-Wasserstein paths on the positive matrix cone, projects the path back to the trace-one state space, and trains the velocity field with a Bures-aligned tangent loss. Thus the sampler is trained in the same fidelity-based geometry used to judge posterior quality. We evaluate BuresTomFlow in dense four-qubit simulations with count, shadow, and mixed measurement records. Against Cholesky, log-density, and generic Riemannian Flow Matching controls at comparable learned-sampler runtime, BuresTomFlow improves Bures distance, credible-ball coverage, and held-out observable prediction. In the main comparison across multiple seeds, mean Bures distance decreases from 0.618 for the Cholesky baseline to 0.367 for BuresTomFlow, and mean coverage error decreases from 0.203 to 0.100. These results show that the value of Bures geometry is not merely enforcing physical states, but producing calibrated posterior uncertainty when finite-record tomography cannot be reduced to one reconstruction.
The natural gradient descent optimisation technique is an efficient optimising protocol for broad classes of classical and quantum systems that takes the underlying geometry of the parameter manifold into account by means of using either the Fisher information metric of the classical probability distribution function or the Fubini-Study tensor of the associated parametrised quantum states in the consequent update rules. Even though the natural gradient descent procedure utilises the geometry of the space of probability or states, it is, however, insensitive to the measure of parametrised distance on the space of possible outcomes when the corresponding optimising problem is considered for the expectation value of a classical or quantum observable with respect to the probability distribution or the quantum state. In this work, we introduce a generic optimising principle, where the intrinsic geometry of the space of outcomes has been taken into account suitably, either by using an ambient space construction with a base statistical manifold with the usual Fisher information metric (or the Fubini-Study tensor), where the loss hypersurface is embedded to, or by means of a first-principle construction from the overlap of nearby quantum states on the projective Hilbert space. This construction as well as a family of conformal variants yields a form of loss-aware natural gradient updates that rescale the effective step size while preserving the descent direction. We benchmark the resulting optimisers on variational quantum circuit examples and on a classical neural network task, finding that, while the standard natural gradient remains the most robust on average, the proposed conformal schemes can improve best-case convergence in favourable regimes.