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

Efficient Quantum Mixed-State Tomography with Unsupervised Tensor Network Machine Learning

Wenjun Li, Kai Xu, Heng Fan, Shi-Ju Ran, Gang Su

Published Aug 14, 2023• 1 citation
arXivHTMLPDF

Abstract

Quantum state tomography (QST) is plagued by the ``curse of dimensionality'' due to the exponentially-scaled complexity in measurement and data post-processing. Efficient QST schemes for large-scale mixed states are currently missing. In this work, we propose an efficient and robust mixed-state tomography scheme based on the locally purified state ansatz. We demonstrate the efficiency and robustness of our scheme on various randomly initiated states with different purities. High tomography fidelity is achieved with much smaller numbers of positive-operator-valued measurement (POVM) bases than the conventional least-square (LS) method. On the superconducting quantum experimental circuit [Phys. Rev. Lett. 119, 180511 (2017)], our scheme accurately reconstructs the Greenberger-Horne-Zeilinger (GHZ) state and exhibits robustness to experimental noises. Specifically, we achieve the fidelity $F \simeq 0.92$ for the 10-qubit GHZ state with just $N_m = 500$ POVM bases, which far outperforms the fidelity $F \simeq 0.85$ by the LS method using the full $N_m = 3^{10} = 59049$ bases. Our work reveals the prospects of applying tensor network state ansatz and the machine learning approaches for efficient QST of many-body states.

DOI
10.48550/arxiv.2308.06900

Related papers

Quantum process tomography with unsupervised learning and tensor networks

Giacomo Torlai, Christopher J. Wood, Atithi Acharya +3 more

The impressive pace of advance of quantum technology calls for robust and scalable techniques for the characterization and validation of quantum hardware. Quantum process tomography, the reconstruction of an unknown quantum channel from measurement data, remains the quintessential primitive to completely characterize quantum devices. However, due to the exponential scaling of the required data and classical post-processing, its range of applicability is typically restricted to one- and two-qubit gates. Here, we present a technique for performing quantum process tomography that addresses these issues by combining a tensor network representation of the channel with a data-driven optimization inspired by unsupervised machine learning. We demonstrate our technique through synthetically generated data for ideal one- and two-dimensional random quantum circuits of up to 10 qubits, and a noisy 5-qubit circuit, reaching process fidelities above 0.99 using several orders of magnitude fewer (single-qubit) measurement shots than traditional tomographic techniques. Our results go far beyond state-of-the-art, providing a practical and timely tool for benchmarking quantum circuits in current and near-term quantum computers.

arXiv:2006.02424•Nature Communications•May 19, 2023•91 citations

Experimental Sample-Efficient Quantum State Tomography via Parallel Measurements

Chang-Kang Hu, Chao Wei, C. L. Liu +11 more

Quantum state tomography (QST) via local measurements on reduced density matrices (LQST) is a promising approach but becomes impractical for large systems. To tackle this challenge, we developed an efficient quantum state tomography method inspired by quantum overlapping tomography [Phys. Rev. Lett. 124, 100401 (2020)PRLTAO0031-900710.1103/PhysRevLett.124.100401], which utilizes parallel measurements (PQST). In contrast to LQST, PQST significantly reduces the number of measurements and offers more robustness against shot noise. Experimentally, we demonstrate the feasibility of PQST in a treelike superconducting qubit chip by designing high-efficiency circuits, preparing W states, ground states of Hamiltonians, and random states, and then reconstructing these density matrices using full quantum state tomography (FQST), LQST, and PQST. Our results show that PQST reduces measurement cost, achieving fidelities of 98.68% and 95.07% after measuring 75 and 99 observables for six-qubit and nine-qubit W states, respectively. Furthermore, the reconstruction of the largest density matrix of the 12-qubit W state is achieved with the similarity of 89.23% after just measuring 243 parallel observables, while 3^{12}=531 441 complete observables are needed for FQST. Consequently, PQST will be a useful tool for future tasks such as the reconstruction, characterization, benchmarking, and properties learning of states.

arXiv:2409.12614•Physical Review Letters•Oct 17, 2024•14 citations

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•8 citations

Quantum machine learning for state tomography using classical data

S. Jabeen, Dmytro Kurdydyk, Aadi Palnitkar +3 more

Reconstructing quantum states from measurement data represents a formidable challenge in quantum information science, especially as system sizes grow beyond the reach of traditional tomography methods. While recent studies have explored quantum machine learning (QML) for quantum state tomography (QST), nearly all rely on idealized assumptions, such as direct access to the unknown quantum state as quantum data input, which are incompatible with current hardware constraints. In this work, we present a QML-based tomography protocol that operates entirely on classical measurement data and is fully executable on noisy intermediate-scale quantum (NISQ) devices. Our approach employs a variational quantum circuit trained to reconstruct quantum states based solely on measurement outcomes. We test the method in simulation, achieving high-fidelity reconstructions of diverse quantum states, including GHZ states, spin chain ground states, and states generated by random circuits. The protocol is then validated on quantum hardware from IBM and IonQ. Additionally, we demonstrate accurate tomography is possible using incomplete measurement bases, a crucial step towards scaling up our protocol. Our results in various scenarios illustrate successful state reconstruction with fidelity reaching 90% or higher. To our knowledge, this is the first QML-based tomography scheme that has been implemented on real quantum processors using exclusively classical measurements. This work establishes the feasibility of QML-based tomography on current quantum platforms and offers a scalable pathway for practical quantum state reconstruction.

arXiv:2507.01246•Quantum Machine Intelligence•Apr 2, 2026•0 citations

Quantum state tomography with locally purified density operators and local measurements

Yuchen Guo, Shuo Yang

Abstract Understanding quantum systems holds significant importance for assessing the performance of quantum hardware and software, as well as exploring quantum control and quantum sensing. An efficient representation of quantum states enables realizing quantum state tomography with minimal measurements. In this study, we propose a new approach to state tomography that uses tensor network representations of mixed states through locally purified density operators and employs a classical optimization algorithm requiring only local measurements. Through numerical simulations of one-dimensional pure and mixed states and two-dimensional random tensor network states up to size $8\times 8$, we demonstrate the efficiency, accuracy, and robustness of our proposed methods. Experiments on the IBM Quantum platform complement these numerical simulations. Our study opens new avenues in quantum state tomography for two-dimensional systems using tensor network formalism.

arXiv:2307.16381•Communications Physics•Oct 6, 2024•17 citations

Quantum state tomography with tensor train cross approximation

Alexander Lidiak, Casey Jameson, Zhen Qin +4 more

It has been recently shown that a state generated by a one-dimensional noisy quantum computer is well approximated by a matrix product operator with a finite bond dimension independent of the number of qubits. We show that full quantum state tomography can be performed for such a state with a minimal number of measurement settings using a method known as tensor train cross approximation. The method works for reconstructing full rank density matrices and only requires measuring local operators, which are routinely performed in state-of-art experimental quantum platforms. Our method requires exponentially fewer state copies than the best known tomography method for unstructured states and local measurements. The fidelity of our reconstructed state can be further improved via supervised machine learning, without demanding more experimental data. Scalable tomography is achieved if the full state can be reconstructed from local reductions.

arXiv:2207.06397•Jul 13, 2022•5 citations
Quantum state tomography (QST) is plagued by the ``curse of dimensionality'' due to the exponentially-scaled complexity in measurement and data post-processing. Efficient QST schemes for large-scale mixed states are currently missing. In this work, we propose an efficient and robust mixed-state tomography scheme based on the locally purified state ansatz. We demonstrate the efficiency and robustness of our scheme on various randomly initiated states with different purities. High tomography fidelity is achieved with much smaller numbers of positive-operator-valued measurement (POVM) bases than the conventional least-square (LS) method. On the superconducting quantum experimental circuit [Phys. Rev. Lett. 119, 180511 (2017)], our scheme accurately reconstructs the Greenberger-Horne-Zeilinger (GHZ) state and exhibits robustness to experimental noises. Specifically, we achieve the fidelity F≃0.92F \simeq 0.92F≃0.92 for the 10-qubit GHZ state with just Nm=500N_m = 500Nm​=500 POVM bases, which far outperforms the fidelity F≃0.85F \simeq 0.85F≃0.85 by the LS method using the full Nm=310=59049N_m = 3^{10} = 59049Nm​=310=59049 bases. Our work reveals the prospects of applying tensor network state ansatz and the machine learning approaches for efficient QST of many-body states.
The impressive pace of advance of quantum technology calls for robust and scalable techniques for the characterization and validation of quantum hardware. Quantum process tomography, the reconstruction of an unknown quantum channel from measurement data, remains the quintessential primitive to completely characterize quantum devices. However, due to the exponential scaling of the required data and classical post-processing, its range of applicability is typically restricted to one- and two-qubit gates. Here, we present a technique for performing quantum process tomography that addresses these issues by combining a tensor network representation of the channel with a data-driven optimization inspired by unsupervised machine learning. We demonstrate our technique through synthetically generated data for ideal one- and two-dimensional random quantum circuits of up to 10 qubits, and a noisy 5-qubit circuit, reaching process fidelities above 0.99 using several orders of magnitude fewer (single-qubit) measurement shots than traditional tomographic techniques. Our results go far beyond state-of-the-art, providing a practical and timely tool for benchmarking quantum circuits in current and near-term quantum computers.
Quantum state tomography (QST) via local measurements on reduced density matrices (LQST) is a promising approach but becomes impractical for large systems. To tackle this challenge, we developed an efficient quantum state tomography method inspired by quantum overlapping tomography [Phys. Rev. Lett. 124, 100401 (2020)PRLTAO0031-900710.1103/PhysRevLett.124.100401], which utilizes parallel measurements (PQST). In contrast to LQST, PQST significantly reduces the number of measurements and offers more robustness against shot noise. Experimentally, we demonstrate the feasibility of PQST in a treelike superconducting qubit chip by designing high-efficiency circuits, preparing W states, ground states of Hamiltonians, and random states, and then reconstructing these density matrices using full quantum state tomography (FQST), LQST, and PQST. Our results show that PQST reduces measurement cost, achieving fidelities of 98.68% and 95.07% after measuring 75 and 99 observables for six-qubit and nine-qubit W states, respectively. Furthermore, the reconstruction of the largest density matrix of the 12-qubit W state is achieved with the similarity of 89.23% after just measuring 243 parallel observables, while 3^{12}=531 441 complete observables are needed for FQST. Consequently, PQST will be a useful tool for future tasks such as the reconstruction, characterization, benchmarking, and properties learning of states.
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 .
Reconstructing quantum states from measurement data represents a formidable challenge in quantum information science, especially as system sizes grow beyond the reach of traditional tomography methods. While recent studies have explored quantum machine learning (QML) for quantum state tomography (QST), nearly all rely on idealized assumptions, such as direct access to the unknown quantum state as quantum data input, which are incompatible with current hardware constraints. In this work, we present a QML-based tomography protocol that operates entirely on classical measurement data and is fully executable on noisy intermediate-scale quantum (NISQ) devices. Our approach employs a variational quantum circuit trained to reconstruct quantum states based solely on measurement outcomes. We test the method in simulation, achieving high-fidelity reconstructions of diverse quantum states, including GHZ states, spin chain ground states, and states generated by random circuits. The protocol is then validated on quantum hardware from IBM and IonQ. Additionally, we demonstrate accurate tomography is possible using incomplete measurement bases, a crucial step towards scaling up our protocol. Our results in various scenarios illustrate successful state reconstruction with fidelity reaching 90% or higher. To our knowledge, this is the first QML-based tomography scheme that has been implemented on real quantum processors using exclusively classical measurements. This work establishes the feasibility of QML-based tomography on current quantum platforms and offers a scalable pathway for practical quantum state reconstruction.
Abstract Understanding quantum systems holds significant importance for assessing the performance of quantum hardware and software, as well as exploring quantum control and quantum sensing. An efficient representation of quantum states enables realizing quantum state tomography with minimal measurements. In this study, we propose a new approach to state tomography that uses tensor network representations of mixed states through locally purified density operators and employs a classical optimization algorithm requiring only local measurements. Through numerical simulations of one-dimensional pure and mixed states and two-dimensional random tensor network states up to size 8×88\times 88×8, we demonstrate the efficiency, accuracy, and robustness of our proposed methods. Experiments on the IBM Quantum platform complement these numerical simulations. Our study opens new avenues in quantum state tomography for two-dimensional systems using tensor network formalism.
It has been recently shown that a state generated by a one-dimensional noisy quantum computer is well approximated by a matrix product operator with a finite bond dimension independent of the number of qubits. We show that full quantum state tomography can be performed for such a state with a minimal number of measurement settings using a method known as tensor train cross approximation. The method works for reconstructing full rank density matrices and only requires measuring local operators, which are routinely performed in state-of-art experimental quantum platforms. Our method requires exponentially fewer state copies than the best known tomography method for unstructured states and local measurements. The fidelity of our reconstructed state can be further improved via supervised machine learning, without demanding more experimental data. Scalable tomography is achieved if the full state can be reconstructed from local reductions.