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

Flexible quantum state tomography

Daniel Uzcátegui Contreras, Dardo Goyeneche

Published Dec 12, 2019• 0 citations
OpenAlex

Abstract

We present an efficient algorithm that solves the quantum state tomography problem from an arbitrary number of projective measurements in any finite dimension $d$. The algorithm is flexible enough to allow us to impose any desired rank $r$ to the state to be reconstructed, ranging from pure ($r=1$) to full rank $(r=d)$ quantum states. The method exhibits successful and fast convergence under the presence of realistic errors in both state preparation and measurement stages, and also when considering overcomplete sets of observables. We demonstrate that the method outperforms semidefinite programming quantum state tomography for some sets of physically relevant quantum measurements in every finite dimension.

Related papers

Quantum State Tomography via Compressed Sensing

David Gross, Yi-Kai Liu, Steven T. Flammia +2 more

We establish methods for quantum state tomography based on compressed sensing. These methods are specialized for quantum states that are fairly pure, and they offer a significant performance improvement on large quantum systems. In particular, they are able to reconstruct an unknown density matrix of dimension d and rank r using O(rdlog²d) measurement settings, compared to standard methods that require d² settings. Our methods have several features that make them amenable to experimental implementation: they require only simple Pauli measurements, use fast convex optimization, are stable against noise, and can be applied to states that are only approximately low rank. The acquired data can be used to certify that the state is indeed close to pure, so no a priori assumptions are needed.

arXiv:0909.3304•Physical Review Letters•Oct 4, 2010•1,137 citations

Fast and simple quantum state estimation

Daniel Uzcátegui Contreras, Gabriel Senno, Dardo Goyeneche

Abstract We present an iterative method to solve the multipartite quantum state estimation problem. We demonstrate convergence for any informationally complete set of generalized quantum measurements in every finite dimension. Our method exhibits fast convergence in high dimensions and strong robustness under the presence of realistic errors both in state preparation and measurement stages. In particular, for mutually unbiased bases and tensor product of generalized Pauli observables it converges in a single iteration.

arXiv:1912.05754•Journal of Physics A Mathematical and Theoretical•Jan 14, 2021•2 citations

A SIMPLE MINIMAX ESTIMATOR FOR QUANTUM STATES

Hui Khoon Ng, Berthold‐Georg Englert

Quantum tomography requires repeated measurements of many copies of the physical system, all prepared by a source in the unknown state. In the limit of very many copies measured, the often-used maximum-likelihood (ML) method for converting the gathered data into an estimate of the state works very well. For smaller data sets, however, it often suffers from problems of rank deficiency in the estimated state. For many systems of relevance for quantum information processing, the preparation of a very large number of copies of the same quantum state is still a technological challenge, which motivates us to look for estimation strategies that perform well even when there is not much data. After reviewing the concept of minimax state estimation, we use minimax ideas to construct a simple estimator for quantum states. We demonstrate that, for the case of tomography of a single qubit, our estimator significantly outperforms the ML estimator for small number of copies of the state measured. Our estimator is always full-rank, and furthermore, has a natural dependence on the number of copies measured, which is missing in the ML estimator.

arXiv:1202.5136•International Journal of Quantum Information•Jun 1, 2012•15 citations

Stable pure state quantum tomography from five orthonormal bases

Claudio Carmeli, Teiko Heinosaari, Michael Kech +2 more

For any finite-dimensional Hilbert space, we construct explicitly five orthonormal bases such that the corresponding measurements allow for efficient tomography of an arbitrary pure quantum state. This means that such measurements can be used to distinguish an arbitrary pure state from any other state, pure or mixed, and the pure state can be reconstructed from the outcome distribution in a feasible way. The set of measurements we construct is independent of the unknown state, and therefore our results provide a fixed scheme for pure state tomography, as opposed to the adaptive (state-dependent) scheme proposed by Goyeneche et al. ( Phys. Rev. Lett. , 115 (2015) 090401). We show that our scheme is robust with respect to noise, in the sense that any measurement scheme which approximates these measurements well enough is equally suitable for pure state tomography. Finally, we present two convex programs which can be used to reconstruct the unknown pure state from the measurement outcome distributions.

arXiv:1604.02970•Europhysics Letters (EPL)•Aug 1, 2016•34 citations

Research on Technology of Quantum Tomography Based on Compressed Sensing

Wenying Li

This paper establishes the methods for quantum state tomography based on compressed sensing.These methods are specialized for quantum states that are fairly pure,and they offer a significant performance improvement on large quantum systems.In particular,they are able to reconstruct an unknown density matrix of dimension d and rank r using O(rdlog2d) measurement settings,compared to standard methods that require d2 settings.The methods have several features that make them amenable to experimental implementation: they require only simple Pauli measurements,use fast convex optimization,are stable against noise,and can be applied to states that are only approximately low rank.The acquired data can be used to certify that the state is indeed close to pure,so no a priori assumptions are needed.

Computer and Modernization•Jan 1, 2011•0 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•18 citations
We present an efficient algorithm that solves the quantum state tomography problem from an arbitrary number of projective measurements in any finite dimension ddd. The algorithm is flexible enough to allow us to impose any desired rank rrr to the state to be reconstructed, ranging from pure (r=1r=1r=1) to full rank (r=d)(r=d)(r=d) quantum states. The method exhibits successful and fast convergence under the presence of realistic errors in both state preparation and measurement stages, and also when considering overcomplete sets of observables. We demonstrate that the method outperforms semidefinite programming quantum state tomography for some sets of physically relevant quantum measurements in every finite dimension.
We establish methods for quantum state tomography based on compressed sensing. These methods are specialized for quantum states that are fairly pure, and they offer a significant performance improvement on large quantum systems. In particular, they are able to reconstruct an unknown density matrix of dimension d and rank r using O(rdlog²d) measurement settings, compared to standard methods that require d² settings. Our methods have several features that make them amenable to experimental implementation: they require only simple Pauli measurements, use fast convex optimization, are stable against noise, and can be applied to states that are only approximately low rank. The acquired data can be used to certify that the state is indeed close to pure, so no a priori assumptions are needed.
Abstract We present an iterative method to solve the multipartite quantum state estimation problem. We demonstrate convergence for any informationally complete set of generalized quantum measurements in every finite dimension. Our method exhibits fast convergence in high dimensions and strong robustness under the presence of realistic errors both in state preparation and measurement stages. In particular, for mutually unbiased bases and tensor product of generalized Pauli observables it converges in a single iteration.
Quantum tomography requires repeated measurements of many copies of the physical system, all prepared by a source in the unknown state. In the limit of very many copies measured, the often-used maximum-likelihood (ML) method for converting the gathered data into an estimate of the state works very well. For smaller data sets, however, it often suffers from problems of rank deficiency in the estimated state. For many systems of relevance for quantum information processing, the preparation of a very large number of copies of the same quantum state is still a technological challenge, which motivates us to look for estimation strategies that perform well even when there is not much data. After reviewing the concept of minimax state estimation, we use minimax ideas to construct a simple estimator for quantum states. We demonstrate that, for the case of tomography of a single qubit, our estimator significantly outperforms the ML estimator for small number of copies of the state measured. Our estimator is always full-rank, and furthermore, has a natural dependence on the number of copies measured, which is missing in the ML estimator.
For any finite-dimensional Hilbert space, we construct explicitly five orthonormal bases such that the corresponding measurements allow for efficient tomography of an arbitrary pure quantum state. This means that such measurements can be used to distinguish an arbitrary pure state from any other state, pure or mixed, and the pure state can be reconstructed from the outcome distribution in a feasible way. The set of measurements we construct is independent of the unknown state, and therefore our results provide a fixed scheme for pure state tomography, as opposed to the adaptive (state-dependent) scheme proposed by Goyeneche et al. ( Phys. Rev. Lett. , 115 (2015) 090401). We show that our scheme is robust with respect to noise, in the sense that any measurement scheme which approximates these measurements well enough is equally suitable for pure state tomography. Finally, we present two convex programs which can be used to reconstruct the unknown pure state from the measurement outcome distributions.
This paper establishes the methods for quantum state tomography based on compressed sensing.These methods are specialized for quantum states that are fairly pure,and they offer a significant performance improvement on large quantum systems.In particular,they are able to reconstruct an unknown density matrix of dimension d and rank r using O(rdlog2d) measurement settings,compared to standard methods that require d2 settings.The methods have several features that make them amenable to experimental implementation: they require only simple Pauli measurements,use fast convex optimization,are stable against noise,and can be applied to states that are only approximately low rank.The acquired data can be used to certify that the state is indeed close to pure,so no a priori assumptions are needed.
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.