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

Selective Quantum State Tomography

Joshua Morris, Borivoje Dakić

Published Sep 12, 2019• 5 citations
arXivHTMLPDF

Abstract

We introduce the concept of selective quantum state tomography or SQST, a tomographic scheme that enables a user to estimate arbitrary elements of an unknown quantum state using a fixed measurement record. We demonstrate how this may be done with the following notable advantages (i) a number of state copies that depends only on the desired precision of the estimation, rather than the dimension of the unknown state; (ii) a similar reduction in the requisite classical memory and computational cost; (iii) an approach to state tomography using $O(ε^{-2}\log d)$ state copies for maximum norm error $ε$, as well as achieving nearly optimal bounds for full tomography with independent measurements. As an immediate extension to this technique we proceed to show that SQST can be used to generate an universal data sample, of fixed and dimension independent size, from which one can extract the mean values from a continuous class of operators on demand.

DOI
10.48550/arxiv.1909.05880

Related papers

Selective and efficient quantum state tomography for multiqubit systems

Aniket Patel, Akshay Gaikwad, Tangyou Huang +2 more

Quantum state tomography (QST) is a crucial tool for characterizing quantum states. However, performing full QST becomes impractical for reconstructing multiqubit density matrices since datasets and computational costs grow exponentially with qubit number. To bypass full QST, we introduce selective and efficient QST (SEEQST)—a method that enables efficient estimation of multiple selected elements of an arbitrary multiqubit density matrix. We show that any N -qubit density matrix can be partitioned into 2 N disjoint subsets, each containing 2 N elements. With SEEQST, any such subset can be accurately estimated from just two experiments with only single-qubit measurements. The complexity for estimating any subset remains constant regardless of Hilbert-space dimension, so, if desired, SEEQST can reconstruct the full density matrix, using 2 N + 1 − 1 experiments, where standard methods would use 3 N experiments. We provide a circuit decomposition for the SEEQST experiments, demonstrating that their maximum circuit depth scales logarithmically with N assuming all-to-all connectivity.

arXiv:2503.20979•Physical Review Research•Feb 13, 2026•1 citation

Quantum verification with few copies

Joshua Morris, Valeria Saggio, Aleksandra Gočanin +1 more

As quantum technologies advance, the ability to generate increasingly large quantum states has experienced rapid development. In this context, the verification of large entangled systems represents one of the main challenges in the employment of such systems for reliable quantum information processing. Though the most complete technique is undoubtedly full tomography, the inherent exponential increase of experimental and post-processing resources with system size makes this approach unfeasible even at moderate scales. For this reason, there is currently an urgent need to develop novel methods that surpass these limitations. This review article presents novel techniques focusing on a fixed number of resources (sampling complexity), and thus prove suitable for systems of arbitrary dimension. Specifically, a probabilistic framework requiring at best only a single copy for entanglement detection is reviewed, together with the concept of shadow and selective quantum state tomography, which enables the estimation of arbitrary elements of an unknown state with a number of copies that is independent of the system's size. These hyper-efficient techniques define a dimensional demarcation for partial tomography and open a path for novel applications.

•Sep 8, 2021•2 citations

Quantum Verification and Estimation with Few Copies

Joshua Morris, Valeria Saggio, Aleksandra Gočanin +1 more

Abstract As quantum technologies advance, the ability to generate increasingly large quantum states has experienced rapid development. In this context, the verification and estimation of large entangled systems represent one of the main challenges in the employment of such systems for reliable quantum information processing. Though the most complete technique is undoubtedly full tomography, the inherent exponential increase of experimental and post‐processing resources with system size makes this approach infeasible even at moderate scales. For this reason, there is currently an urgent need to develop novel methods that surpass these limitations. This review article presents novel techniques focusing on a fixed number of resources (sampling complexity), and thus prove suitable for systems of arbitrary dimension. Specifically, a probabilistic framework requiring at best only a single copy for entanglement detection is reviewed, together with the concept of selective quantum state tomography, which enables the estimation of arbitrary elements of an unknown state with a number of copies that is low and independent of the system's size. These hyper‐efficient techniques define a dimensional demarcation for partial tomography and open a path for novel applications.

arXiv:2109.03860•Advanced Quantum Technologies•Mar 17, 2022•19 citations

Maximum-Likelihood Quantum State Tomography by Soft-Bayes

Lin, Chien-Ming, Yu-Ming Hsu, Yen-Huan Li

Quantum state tomography (QST), the task of estimating an unknown quantum state given measurement outcomes, is essential to building reliable quantum computing devices. Whereas computing the maximum-likelihood (ML) estimate corresponds to solving a finite-sum convex optimization problem, the objective function is not smooth nor Lipschitz, so most existing convex optimization methods lack sample complexity guarantees; moreover, both the sample size and dimension grow exponentially with the number of qubits in a QST experiment, so a desired algorithm should be highly scalable with respect to the dimension and sample size, just like stochastic gradient descent. In this paper, we propose a stochastic first-order algorithm that computes an $\varepsilon$-approximate ML estimate in $O( ( D \log D ) / \varepsilon ^ 2 )$ iterations with $O( D^3 )$ per-iteration time complexity, where $D$ denotes the dimension of the unknown quantum state and $\varepsilon$ denotes the optimization error. Our algorithm is an extension of Soft-Bayes to the quantum setup.

arXiv:2012.15498•Dec 31, 2020•0 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.

International Journal of Quantum Information•Jun 1, 2012•11 citations

Efficient quantum tomography

Ryan O’Donnell, John Wright

In the quantum state tomography problem, one wishes to estimate an unknown d-dimensional mixed quantum state ρ, given few copies. We show that O(d/ε) copies suffice to obtain an estimate ρ that satisfies ||ρ − ρ||F2 ≤ ε (with high probability). An immediate consequence is that O((ρ) · d/ε2) ≤ O(d2/ε2) copies suffice to obtain an ε-accurate estimate in the standard trace distance. This improves on the best known prior result of O(d3/ε2) copies for full tomography, and even on the best known prior result of O(d2log(d/ε)/ε2) copies for spectrum estimation. Our result is the first to show that nontrivial tomography can be obtained using a number of copies that is just linear in the dimension.

arXiv:1508.01907•ACM Symposium on Theory of Computing (STOC)•Jun 10, 2016•181 citations
We introduce the concept of selective quantum state tomography or SQST, a tomographic scheme that enables a user to estimate arbitrary elements of an unknown quantum state using a fixed measurement record. We demonstrate how this may be done with the following notable advantages (i) a number of state copies that depends only on the desired precision of the estimation, rather than the dimension of the unknown state; (ii) a similar reduction in the requisite classical memory and computational cost; (iii) an approach to state tomography using O(ε−2log⁡d)O(ε^{-2}\log d)O(ε−2logd) state copies for maximum norm error εεε, as well as achieving nearly optimal bounds for full tomography with independent measurements. As an immediate extension to this technique we proceed to show that SQST can be used to generate an universal data sample, of fixed and dimension independent size, from which one can extract the mean values from a continuous class of operators on demand.
Quantum state tomography (QST) is a crucial tool for characterizing quantum states. However, performing full QST becomes impractical for reconstructing multiqubit density matrices since datasets and computational costs grow exponentially with qubit number. To bypass full QST, we introduce selective and efficient QST (SEEQST)—a method that enables efficient estimation of multiple selected elements of an arbitrary multiqubit density matrix. We show that any N -qubit density matrix can be partitioned into 2 N disjoint subsets, each containing 2 N elements. With SEEQST, any such subset can be accurately estimated from just two experiments with only single-qubit measurements. The complexity for estimating any subset remains constant regardless of Hilbert-space dimension, so, if desired, SEEQST can reconstruct the full density matrix, using 2 N + 1 − 1 experiments, where standard methods would use 3 N experiments. We provide a circuit decomposition for the SEEQST experiments, demonstrating that their maximum circuit depth scales logarithmically with N assuming all-to-all connectivity.
As quantum technologies advance, the ability to generate increasingly large quantum states has experienced rapid development. In this context, the verification of large entangled systems represents one of the main challenges in the employment of such systems for reliable quantum information processing. Though the most complete technique is undoubtedly full tomography, the inherent exponential increase of experimental and post-processing resources with system size makes this approach unfeasible even at moderate scales. For this reason, there is currently an urgent need to develop novel methods that surpass these limitations. This review article presents novel techniques focusing on a fixed number of resources (sampling complexity), and thus prove suitable for systems of arbitrary dimension. Specifically, a probabilistic framework requiring at best only a single copy for entanglement detection is reviewed, together with the concept of shadow and selective quantum state tomography, which enables the estimation of arbitrary elements of an unknown state with a number of copies that is independent of the system's size. These hyper-efficient techniques define a dimensional demarcation for partial tomography and open a path for novel applications.
Abstract As quantum technologies advance, the ability to generate increasingly large quantum states has experienced rapid development. In this context, the verification and estimation of large entangled systems represent one of the main challenges in the employment of such systems for reliable quantum information processing. Though the most complete technique is undoubtedly full tomography, the inherent exponential increase of experimental and post‐processing resources with system size makes this approach infeasible even at moderate scales. For this reason, there is currently an urgent need to develop novel methods that surpass these limitations. This review article presents novel techniques focusing on a fixed number of resources (sampling complexity), and thus prove suitable for systems of arbitrary dimension. Specifically, a probabilistic framework requiring at best only a single copy for entanglement detection is reviewed, together with the concept of selective quantum state tomography, which enables the estimation of arbitrary elements of an unknown state with a number of copies that is low and independent of the system's size. These hyper‐efficient techniques define a dimensional demarcation for partial tomography and open a path for novel applications.
Quantum state tomography (QST), the task of estimating an unknown quantum state given measurement outcomes, is essential to building reliable quantum computing devices. Whereas computing the maximum-likelihood (ML) estimate corresponds to solving a finite-sum convex optimization problem, the objective function is not smooth nor Lipschitz, so most existing convex optimization methods lack sample complexity guarantees; moreover, both the sample size and dimension grow exponentially with the number of qubits in a QST experiment, so a desired algorithm should be highly scalable with respect to the dimension and sample size, just like stochastic gradient descent. In this paper, we propose a stochastic first-order algorithm that computes an ε\varepsilonε-approximate ML estimate in O((Dlog⁡D)/ε2)O( ( D \log D ) / \varepsilon ^ 2 )O((DlogD)/ε2) iterations with O(D3)O( D^3 )O(D3) per-iteration time complexity, where DDD denotes the dimension of the unknown quantum state and ε\varepsilonε denotes the optimization error. Our algorithm is an extension of Soft-Bayes to the quantum setup.
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.
In the quantum state tomography problem, one wishes to estimate an unknown d-dimensional mixed quantum state ρ, given few copies. We show that O(d/ε) copies suffice to obtain an estimate ρ that satisfies ||ρ − ρ||F2 ≤ ε (with high probability). An immediate consequence is that O((ρ) · d/ε2) ≤ O(d2/ε2) copies suffice to obtain an ε-accurate estimate in the standard trace distance. This improves on the best known prior result of O(d3/ε2) copies for full tomography, and even on the best known prior result of O(d2log(d/ε)/ε2) copies for spectrum estimation. Our result is the first to show that nontrivial tomography can be obtained using a number of copies that is just linear in the dimension.