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

Learning to Reconstruct Wigner Functions in Phase Space

Xinyu Tang, Yi-hsin Lin, Yan Zhu, Tailong Xiao, Yuxuan Du, Giulio Chiribella, Qiongyi He, Ya-dong Wu

quant-phSubmitted Jul 7, 2026• Announced Jul 8, 2026• 0 citations
arXivHTMLPDF

Abstract

Wigner function learning is a central tool for characterizing continuous variable quantum systems. A fundamental challenge in this setting is to infer a continuous phase-space function from sparse pointwise measurement data, a task that becomes increasingly demanding as the effective dimension enlarges. Here, we develop a general machine learning framework to reconstruct Wigner functions directly as continuous functions from sparse phase-space data. For states with sparse Fock-space or coherent-state representations, such as binomial code states and cat states, we devise provably efficient regression models whose measurement complexity scales only logarithmically with the effective Hilbert-space dimension. For more general states, such as the Gottesman-Kitaev-Preskill (GKP) states, we design a deep learning model that reconstructs the Wigner function from sparse measurements and generalizes to arbitrary phase-space resolution. We demonstrate the broad applicability of our framework on both simulated data and experimental data from a circuit quantum electrodynamic (circuit-QED) system. Interestingly, on experimental data, we find that our model reconstructs Wigner functions of GKP code states across multiple rounds of quantum error correction and identifies the dominant error process using significantly fewer measurements than conventional estimation techniques.

Related papers

Efficient Reconstruction of Wigner Function from Marginals with Deep Generative Model

Po-Hsuan Chen, Li-An Lo, Tzu-Chia Liu +2 more

The Wigner function is one of the most important tools for characterizing quantum states in continuous-variable and quantum optical systems, with its negativity serving as a strong indicator of nonclassicality. However, its experimental reconstruction from measurable raw data is a tedious task requiring substantial experimental resources. On the other hand, machine learning has made immense strides and been successfully applied across various scientific disciplines. Building on our previous development of a ResNet-based deep generative model (DGM), here we further optimize the DGM to reconstruct complex Wigner functions by processing merely three experimentally measurable marginal distributions. We validate our approach using two sophisticated cavity quantum electrodynamics models, where coherent light-matter interactions introduce intricate phase-space features. Our results reveal that the DGM is capable of capturing statistical features and physical characteristics within the marginals and reproducing the intricate patterns of the Wigner functions with high accuracy. Furthermore, we demonstrate its superior performance over a widely adopted denoising diffusion model, as well as its generalizability to the time evolution of states modestly beyond the training range. Consequently, our approach is expected to substantially reduce the experimental resources required for quantum state tomography.

IEEE Transactions on Quantum Engineering•Jan 1, 2026•0 citations

Flow-based Phase-space Tomography of Continuous-variable Quantum States

Owen Dugan, Rumen Dangovski, Peter Y. Lu +1 more

Continuous-variable quantum state tomography is limited by the cost of resolving non-Gaussian structure in high-dimensional phase space. We introduce QST-Flow, a quantum state tomography framework via flow-based generative modeling that represents experimentally accessible phase-space quasiprobability distributions with normalized, samplable neural densities rather than a truncated density matrix. The framework has two variants: QST-QFlow models the positive Husimi-$Q$ function with a single normalizing flow, while QST-WFlow models sign-changing Wigner functions as a trainable difference of two normalized flows. This construction preserves quasiprobability normalization and enables exact density evaluation, direct sampling, and importance-sampled learning from finite phase-space measurements without a fixed grid. Benchmarks on non-Gaussian cat, binomial, Gottesman-Kitaev-Preskill, number, and Fock states show accurate single-mode reconstructions, extension to multimode states, robustness on noisy Wigner data, and improved reconstruction error compared with prior machine-learning tomography methods. QST-Flow opens a promising route toward scalable, measurement-efficient phase-space tomography of nonclassical bosonic systems.

quant-pharXiv:2607.21584•Jul 24, 2026•0 citations

Adaptive Reconstruction of Bosonic Quantum States

Vasilisa Usova, Phila Rembold, Ian Yang +4 more

Bosonic quantum systems provide a hardware-efficient platform for quantum information processing but remain challenging to characterise due to their large Hilbert space and the high measurement cost of state tomography. Existing approaches estimate the fidelity with respect to a single target state, making them unsuitable for applications in which physically equivalent states differ by phase space translations, rotations, or other transformations. Here, we introduce an adaptive reconstruction technique that estimates the fidelity with respect to a family of bosonic states while reconstructing the underlying Wigner function from a small number of measurements. The method combines a physics-informed parametric model with Bayesian inference, bootstrap, and active learning to iteratively select the most informative phase space sampling points. We implement the approach on a circuit quantum electrodynamics platform and benchmark it on Schrödinger cat states with amplitudes $α\in[1,3]$. The reconstruction yields reproducible fidelity estimates within a few minutes, remains robust to substantial displacements and rotations in phase space despite using a mismatched prior, and is sensitive to subtle state imperfections. We further compare the adaptive strategy with existing Wigner function sampling protocols experimentally, demonstrating the advantage of adaptive sampling for measurement-efficient fidelity estimation with respect to a family of cat states. Finally, we incorporate the reconstructed fidelity into the figure of merit used in a proof-of-principle closed-loop quantum optimal control experiment, demonstrating the applicability of the method to autonomous optimisation of bosonic quantum states.

quant-pharXiv:2608.02049•Aug 4, 2026•1 citation

Phase-space methods for representing, manipulating, and correcting Gottesman-Kitaev-Preskill qubits

Lucas J. Mensen, Ben Q. Baragiola, Nicolas C. Menicucci

The Gottesman-Kitaev-Preskill (GKP) encoding of a qubit into a bosonic mode is a promising bosonic code for quantum computation due to its tolerance for noise and all-Gaussian gate set. We present a toolkit for phase-space description and manipulation of GKP encodings that includes Wigner functions for ideal and approximate GKP states, for various types of mixed GKP states, and for GKP-encoded operators. One advantage of a phase-space approach is that Gaussian unitaries, required for computation with GKP codes, correspond to simple transformations on the arguments of Wigner functions. We use this fact and our toolkit to describe GKP error correction, including magic-state preparation, entirely in phase space using operations on Wigner functions. While our focus here is on the square-lattice GKP code, we provide a general framework for GKP codes defined on any lattice.

arXiv:2012.12488•Physical Review A•Aug 6, 2021•24 citations

Equivalence of approximate Gottesman-Kitaev-Preskill codes

Takaya Matsuura, Hayata Yamasaki, Masato Koashi

The Gottesman-Kitaev-Preskill (gkp) quantum error-correcting code attracts much attention in continuous variable (CV) quantum computation and CV quantum communication due to the simplicity of error-correcting routines and the high tolerance against Gaussian errors. Since the gkp code state should be regarded as a limit of physically meaningful approximate ones, various approximations have been developed until today, but explicit relations among them are still unclear. In this paper, we rigorously prove the equivalence of these approximate gkp codes with an explicit correspondence of the parameters. We also propose a standard form of the approximate code states in the position representation, which enables us to derive closed-form expressions for the Wigner function, inner products, and the average photon number in terms of the theta functions. Our results serve as fundamental tools for further analyses of fault-tolerant quantum computation and channel coding using approximate gkp codes.

arXiv:1910.08301•Physical Review A•Sep 15, 2020•79 citations

Exponentially improved efficient machine learning for quantum many-body states with provable guarantees

Yanming Che, Clemens Gneiting, Franco Nori

Solving the ground state and the ground-state properties of quantum many-body systems is generically a hard task for classical algorithms. For a family of Hamiltonians defined on an m -dimensional space of physical parameters, the ground state and its properties at an arbitrary parameter configuration can be predicted via a machine learning protocol up to a prescribed prediction error ɛ , provided that a sample set (of size N ) of the states can be efficiently prepared and measured. In a recent work [Huang , ], a rigorous guarantee for such a generalization was proved. Unfortunately, an exponential scaling for the provable sample complexity, N = m O ( 1 ɛ ) , was found to be universal for generic gapped Hamiltonians. This result applies to the situation where the dimension of the parameter space is large, while the scaling with the accuracy is not an urgent factor, not entering the realm of more precise learning and prediction. In this work, we consider an alternative relevant scenario, where the effective dimension m is a finite, not necessarily large constant, while the scaling with the prediction error becomes the central concern. By jointly preserving the fundamental properties of density matrices in the learning protocol and utilizing the continuity of quantum states in the parameter range of interest, we rigorously obtain a polynomial sample complexity for predicting quantum many-body states and their properties, with respect to the prediction error ɛ and the number of qubits, n , with N = poly ( ɛ − 1 , n , ln 1 δ ) , where poly denotes a polynomial function, and ( 1 − δ ) is the probability of success. Moreover, if restricted to learning local quantum-state properties, the number of samples can be further reduced to N = poly ( ɛ − 1 , ln n δ ) . Numerical demonstrations confirm our findings, and an alternative approach utilizing statistical learning theory with reproducing kernel Hilbert space achieves consistent results. The mere continuity assumption indicates that our results are not restricted to gapped Hamiltonian systems and properties within the same phase. Published by the American Physical Society 2024

arXiv:2304.04353•Physical Review Research•Jul 8, 2024•14 citations
Wigner function learning is a central tool for characterizing continuous variable quantum systems. A fundamental challenge in this setting is to infer a continuous phase-space function from sparse pointwise measurement data, a task that becomes increasingly demanding as the effective dimension enlarges. Here, we develop a general machine learning framework to reconstruct Wigner functions directly as continuous functions from sparse phase-space data. For states with sparse Fock-space or coherent-state representations, such as binomial code states and cat states, we devise provably efficient regression models whose measurement complexity scales only logarithmically with the effective Hilbert-space dimension. For more general states, such as the Gottesman-Kitaev-Preskill (GKP) states, we design a deep learning model that reconstructs the Wigner function from sparse measurements and generalizes to arbitrary phase-space resolution. We demonstrate the broad applicability of our framework on both simulated data and experimental data from a circuit quantum electrodynamic (circuit-QED) system. Interestingly, on experimental data, we find that our model reconstructs Wigner functions of GKP code states across multiple rounds of quantum error correction and identifies the dominant error process using significantly fewer measurements than conventional estimation techniques.
The Wigner function is one of the most important tools for characterizing quantum states in continuous-variable and quantum optical systems, with its negativity serving as a strong indicator of nonclassicality. However, its experimental reconstruction from measurable raw data is a tedious task requiring substantial experimental resources. On the other hand, machine learning has made immense strides and been successfully applied across various scientific disciplines. Building on our previous development of a ResNet-based deep generative model (DGM), here we further optimize the DGM to reconstruct complex Wigner functions by processing merely three experimentally measurable marginal distributions. We validate our approach using two sophisticated cavity quantum electrodynamics models, where coherent light-matter interactions introduce intricate phase-space features. Our results reveal that the DGM is capable of capturing statistical features and physical characteristics within the marginals and reproducing the intricate patterns of the Wigner functions with high accuracy. Furthermore, we demonstrate its superior performance over a widely adopted denoising diffusion model, as well as its generalizability to the time evolution of states modestly beyond the training range. Consequently, our approach is expected to substantially reduce the experimental resources required for quantum state tomography.
Continuous-variable quantum state tomography is limited by the cost of resolving non-Gaussian structure in high-dimensional phase space. We introduce QST-Flow, a quantum state tomography framework via flow-based generative modeling that represents experimentally accessible phase-space quasiprobability distributions with normalized, samplable neural densities rather than a truncated density matrix. The framework has two variants: QST-QFlow models the positive Husimi-QQQ function with a single normalizing flow, while QST-WFlow models sign-changing Wigner functions as a trainable difference of two normalized flows. This construction preserves quasiprobability normalization and enables exact density evaluation, direct sampling, and importance-sampled learning from finite phase-space measurements without a fixed grid. Benchmarks on non-Gaussian cat, binomial, Gottesman-Kitaev-Preskill, number, and Fock states show accurate single-mode reconstructions, extension to multimode states, robustness on noisy Wigner data, and improved reconstruction error compared with prior machine-learning tomography methods. QST-Flow opens a promising route toward scalable, measurement-efficient phase-space tomography of nonclassical bosonic systems.
Bosonic quantum systems provide a hardware-efficient platform for quantum information processing but remain challenging to characterise due to their large Hilbert space and the high measurement cost of state tomography. Existing approaches estimate the fidelity with respect to a single target state, making them unsuitable for applications in which physically equivalent states differ by phase space translations, rotations, or other transformations. Here, we introduce an adaptive reconstruction technique that estimates the fidelity with respect to a family of bosonic states while reconstructing the underlying Wigner function from a small number of measurements. The method combines a physics-informed parametric model with Bayesian inference, bootstrap, and active learning to iteratively select the most informative phase space sampling points. We implement the approach on a circuit quantum electrodynamics platform and benchmark it on Schrödinger cat states with amplitudes α∈[1,3]α\in[1,3]α∈[1,3]. The reconstruction yields reproducible fidelity estimates within a few minutes, remains robust to substantial displacements and rotations in phase space despite using a mismatched prior, and is sensitive to subtle state imperfections. We further compare the adaptive strategy with existing Wigner function sampling protocols experimentally, demonstrating the advantage of adaptive sampling for measurement-efficient fidelity estimation with respect to a family of cat states. Finally, we incorporate the reconstructed fidelity into the figure of merit used in a proof-of-principle closed-loop quantum optimal control experiment, demonstrating the applicability of the method to autonomous optimisation of bosonic quantum states.
The Gottesman-Kitaev-Preskill (GKP) encoding of a qubit into a bosonic mode is a promising bosonic code for quantum computation due to its tolerance for noise and all-Gaussian gate set. We present a toolkit for phase-space description and manipulation of GKP encodings that includes Wigner functions for ideal and approximate GKP states, for various types of mixed GKP states, and for GKP-encoded operators. One advantage of a phase-space approach is that Gaussian unitaries, required for computation with GKP codes, correspond to simple transformations on the arguments of Wigner functions. We use this fact and our toolkit to describe GKP error correction, including magic-state preparation, entirely in phase space using operations on Wigner functions. While our focus here is on the square-lattice GKP code, we provide a general framework for GKP codes defined on any lattice.
The Gottesman-Kitaev-Preskill (gkp) quantum error-correcting code attracts much attention in continuous variable (CV) quantum computation and CV quantum communication due to the simplicity of error-correcting routines and the high tolerance against Gaussian errors. Since the gkp code state should be regarded as a limit of physically meaningful approximate ones, various approximations have been developed until today, but explicit relations among them are still unclear. In this paper, we rigorously prove the equivalence of these approximate gkp codes with an explicit correspondence of the parameters. We also propose a standard form of the approximate code states in the position representation, which enables us to derive closed-form expressions for the Wigner function, inner products, and the average photon number in terms of the theta functions. Our results serve as fundamental tools for further analyses of fault-tolerant quantum computation and channel coding using approximate gkp codes.
Solving the ground state and the ground-state properties of quantum many-body systems is generically a hard task for classical algorithms. For a family of Hamiltonians defined on an m -dimensional space of physical parameters, the ground state and its properties at an arbitrary parameter configuration can be predicted via a machine learning protocol up to a prescribed prediction error ɛ , provided that a sample set (of size N ) of the states can be efficiently prepared and measured. In a recent work [Huang , ], a rigorous guarantee for such a generalization was proved. Unfortunately, an exponential scaling for the provable sample complexity, N = m O ( 1 ɛ ) , was found to be universal for generic gapped Hamiltonians. This result applies to the situation where the dimension of the parameter space is large, while the scaling with the accuracy is not an urgent factor, not entering the realm of more precise learning and prediction. In this work, we consider an alternative relevant scenario, where the effective dimension m is a finite, not necessarily large constant, while the scaling with the prediction error becomes the central concern. By jointly preserving the fundamental properties of density matrices in the learning protocol and utilizing the continuity of quantum states in the parameter range of interest, we rigorously obtain a polynomial sample complexity for predicting quantum many-body states and their properties, with respect to the prediction error ɛ and the number of qubits, n , with N = poly ( ɛ − 1 , n , ln 1 δ ) , where poly denotes a polynomial function, and ( 1 − δ ) is the probability of success. Moreover, if restricted to learning local quantum-state properties, the number of samples can be further reduced to N = poly ( ɛ − 1 , ln n δ ) . Numerical demonstrations confirm our findings, and an alternative approach utilizing statistical learning theory with reproducing kernel Hilbert space achieves consistent results. The mere continuity assumption indicates that our results are not restricted to gapped Hamiltonian systems and properties within the same phase. Published by the American Physical Society 2024