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:1010.3813 · International Journal of Quantum Information

EFFICIENCY OF QUANTUM STATE TOMOGRAPHY FOR QUBITS

Koichi Yamagata

Published Jun 1, 2011• 22 citations
arXivHTMLPDF

Abstract

The efficiency of quantum state tomography is discussed from the point of view of quantum parameter estimation theory, in which the trace of the weighted covariance is to be minimized. It is shown that tomography is optimal only when a special weight is adopted.
DOI
10.1142/s0219749911007551

Related papers

Optimal experiment design for quantum state tomography: Fair, precise, and minimal tomography

J. Nunn, Brian J. Smith, Graciana Puentes +2 more

Given an experimental setup and a fixed number of measurements, how should one take data to optimally reconstruct the state of a quantum system? The problem of optimal experiment design (OED) for quantum state tomography was first broached by Kosut et al. [R. Kosut, I. Walmsley, and H. Rabitz, e-print arXiv:quant-ph/0411093 (2004)]. Here we provide efficient numerical algorithms for finding the optimal design, and analytic results for the case of `minimal tomography'. We also introduce the average OED, which is independent of the state to be reconstructed, and the optimal design for tomography (ODT), which minimizes tomographic bias. Monte Carlo simulations confirm the utility of our results for qubits. Finally, we adapt our approach to deal with constrained techniques such as maximum-likelihood estimation. We find that these are less amenable to optimization than cruder reconstruction methods, such as linear inversion.

arXiv:0911.4310•Physical Review A•Apr 22, 2010•42 citations

Statistical Estimation of the Efficiency of Quantum State Tomography Protocols

Yu. I. Bogdanov, G. Brida, Marco Genovese +3 more

A novel operational method for estimating the efficiency of quantum state tomography protocols is suggested. It is based on a priori estimation of the quality of an arbitrary protocol by means of universal asymptotic fidelity distribution and condition number, which takes minimal value for better protocol. We prove the adequacy of the method both with numerical modeling and through the experimental realization of several practically important protocols of quantum state tomography.

arXiv:1002.3477•Physical Review Letters•Jul 1, 2010•78 citations

BAYESIAN APPROACH TO QUANTUM STATE TOMOGRAPHY

Stefania Castelletto, Ivo Pietro Degiovanni, Maria Luisa Rastello +1 more

In this paper we focus on the main problem of quantum state tomography: the reconstructed density matrices often are not physical because of experimental noise. We propose a method to avoid this problem using Bayesian statistical theory.

Advanced Mathematical and Computational Tools in Metrology (AMCTM)•Jul 1, 2004•0 citations

Practical adaptive quantum tomography

Christopher Granade, Christopher Ferrie, Steven T. Flammia

We introduce a fast and accurate heuristic for adaptive tomography that addresses many of the limitations of prior methods.Previous approaches were either too computationally intensive or tailored to handle special cases such as single qubits or pure states.By contrast, our approach combines the efficiency of online optimization with generally applicable and well-motivated data-processing techniques.We numerically demonstrate these advantages in several scenarios including mixed states, higher-dimensional systems, and restricted measurements.Quantum information processing (QIP) promises advantages in a wide range of different contexts, including machine learning [2-4], chemistry simulation [5][6][7], and number theory [8,9].As such, the experimental effort to build useful QIP devices has exploded in recent years.In the course of this effort, quantum tomography is a valuable tool for diagnosing and debugging small quantum devices, and has subsequently seen a variety of different advances.In particular, Bayesian approaches to tomography which are especially well suited to utilizing prior information and adapting to changing experimental conditions have developed significantly in recent years [10-13], presenting a useful experimental tool [14][15][16].In this paper we demonstrate the efficiency and accuracy of an adaptive tomography protocol that we call PAQT: practical adaptive quantum tomography.PAQT intelligently selects new measurements based on the outcomes of previous ones [10,[17][18][19][20][21].Adaptivity has been experimentally demonstrated [14,15,[22][23][24][25], but is not currently standard practice.Though adaptivity increases accuracy, the computational costs incurred outweigh that of simply repeating standard measurements many times.The PAQT approach employs a simple heuristic that can be efficiently computed between measurements, even with embedded hardware [26][27][28][29].The algorithm we propose is therefore compatible with modern experimental design and avoids an important limitation of previous approaches.We base our algorithm off of self-guided quantum tomography (SGQT), which treats adaptive tomography as a direct optimization problem rather than a new optimization problem between each measurement [30].Though this affords an efficient and easy to implement adaptive heuristic, SGQT is not without its limitations.It requires assuming that the target state is pure, and it does not return rich region estimates for a state.What PAQT achieves is to effectively combine SGQT with conventional and easily-implemented tomographic estimators, such as the Bayesian particle filter or least-squares fit (LSF) estimators.Under this approach, an experimentalist can collect data using SGQT (even if its assumptions are not met), and then post-process this data using particle filtering or LSF.The benefit of PAQT is two-fold.(1) From the point of view of traditional tomography, it gives an adaptive tomography protocol requiring only modest computational resources, as the bulk of the computational cost is offloaded to post-processing.(2) From the point of view of simulation-based optimization tomography (such as SGQT), it effectively augments the output with region estimation providing a statistically robust quantification of uncertainty.Thus, while we do not explicitly demonstrate that the improved scaling of Ferrie [30] remains in the more general case considered here, PAQT does provide a practical and efficient procedure for performing adaptive quantum tomography with rigorous statistical principles.

arXiv:1605.05039•New Journal of Physics•Sep 29, 2017•70 citations

Optimal learning of covariant quantum states and channels

Satoshi Yoshida, Kazuki Okigami, Pietro M. Posta +1 more

We give collective tomography protocols for quantum states and channels with known symmetries, using random purification and dilation to reduce learning to pure-state estimation. For states commuting with a compact-group representation with multiplicities $m_λ$, the optimal copy complexity is $Θ((\sum_λm_λ^2+\logη^{-1})/\varepsilon^2)$ for sufficiently small trace-distance error $\varepsilon$ and failure probability $η$ for the nontrivial case $\sum_λm_λ^2>1$. For $G$-covariant channels with finite-dimensional unitary representations of a compact group $G$, parallel $\widetilde{O}(D_G/\varepsilon^2)$ queries achieve a diamond-distance error $\varepsilon $ at fixed success probability $2/3$, where $D_G$ counts the real parameters of covariant Choi operators before imposing trace preservation. For permutation-covariant channels on $k$ qudits of fixed local dimension $d$, at sufficiently small fixed error and fixed success probability $2/3$, we obtain the optimal query scalings $Θ_d(k^{d^4-1})$ for diamond distance and $Θ_d(k^{d^4-d^2})$ for Choi trace distance. Furthermore, we resolve an open problem in quantum tomography of constructing efficient quantum circuits that approximate the Hayashi measurement for optimal pure-state estimation. We encode states in the symmetric subspace into bosonic occupation modes, realize the measurement by heterodyne detection and normalization, and approximate this procedure on qubits using the quantum Hermite transform. Combined with our symmetry-compatible purification and dilation circuits, this yields query-optimal and gate-efficient learners of permutation-covariant states and channels with gate complexity $O_d(\mathrm{poly}(k,\varepsilon^{-1},\logη^{-1}))$.

quant-pharXiv:2609.39280•Oct 1, 2026•0 citations

Optimization of quantum state tomography in the presence of experimental constraints

Mohammadreza Mohammadi, Agata M. Brańczyk

In the absence of experimental constraints, optimal measurement schemes for quantum state tomography are well understood. We consider the scenario where the experimenter doesn't have arbitrary freedom to construct their measurement set, and may therefore not be able to implement a known optimal scheme. We introduce a simple procedure for minimizing the uncertainty in the reconstructed quantum state for an arbitrary tomographic scheme. We do this by defining a figure of merit based on the equally weighted variance of the measurement statistics. This figure of merit is straightforwardly based on the singular value decomposition of the measurement matrix, making it well suited for optimization.

arXiv:1311.1516•Physical Review A•Jan 16, 2014•7 citations
Given an experimental setup and a fixed number of measurements, how should one take data to optimally reconstruct the state of a quantum system? The problem of optimal experiment design (OED) for quantum state tomography was first broached by Kosut et al. [R. Kosut, I. Walmsley, and H. Rabitz, e-print arXiv:quant-ph/0411093 (2004)]. Here we provide efficient numerical algorithms for finding the optimal design, and analytic results for the case of `minimal tomography'. We also introduce the average OED, which is independent of the state to be reconstructed, and the optimal design for tomography (ODT), which minimizes tomographic bias. Monte Carlo simulations confirm the utility of our results for qubits. Finally, we adapt our approach to deal with constrained techniques such as maximum-likelihood estimation. We find that these are less amenable to optimization than cruder reconstruction methods, such as linear inversion.
We introduce a fast and accurate heuristic for adaptive tomography that addresses many of the limitations of prior methods.Previous approaches were either too computationally intensive or tailored to handle special cases such as single qubits or pure states.By contrast, our approach combines the efficiency of online optimization with generally applicable and well-motivated data-processing techniques.We numerically demonstrate these advantages in several scenarios including mixed states, higher-dimensional systems, and restricted measurements.Quantum information processing (QIP) promises advantages in a wide range of different contexts, including machine learning [2-4], chemistry simulation [5][6][7], and number theory [8,9].As such, the experimental effort to build useful QIP devices has exploded in recent years.In the course of this effort, quantum tomography is a valuable tool for diagnosing and debugging small quantum devices, and has subsequently seen a variety of different advances.In particular, Bayesian approaches to tomography which are especially well suited to utilizing prior information and adapting to changing experimental conditions have developed significantly in recent years [10-13], presenting a useful experimental tool [14][15][16].In this paper we demonstrate the efficiency and accuracy of an adaptive tomography protocol that we call PAQT: practical adaptive quantum tomography.PAQT intelligently selects new measurements based on the outcomes of previous ones [10,[17][18][19][20][21].Adaptivity has been experimentally demonstrated [14,15,[22][23][24][25], but is not currently standard practice.Though adaptivity increases accuracy, the computational costs incurred outweigh that of simply repeating standard measurements many times.The PAQT approach employs a simple heuristic that can be efficiently computed between measurements, even with embedded hardware [26][27][28][29].The algorithm we propose is therefore compatible with modern experimental design and avoids an important limitation of previous approaches.We base our algorithm off of self-guided quantum tomography (SGQT), which treats adaptive tomography as a direct optimization problem rather than a new optimization problem between each measurement [30].Though this affords an efficient and easy to implement adaptive heuristic, SGQT is not without its limitations.It requires assuming that the target state is pure, and it does not return rich region estimates for a state.What PAQT achieves is to effectively combine SGQT with conventional and easily-implemented tomographic estimators, such as the Bayesian particle filter or least-squares fit (LSF) estimators.Under this approach, an experimentalist can collect data using SGQT (even if its assumptions are not met), and then post-process this data using particle filtering or LSF.The benefit of PAQT is two-fold.(1) From the point of view of traditional tomography, it gives an adaptive tomography protocol requiring only modest computational resources, as the bulk of the computational cost is offloaded to post-processing.(2) From the point of view of simulation-based optimization tomography (such as SGQT), it effectively augments the output with region estimation providing a statistically robust quantification of uncertainty.Thus, while we do not explicitly demonstrate that the improved scaling of Ferrie [30] remains in the more general case considered here, PAQT does provide a practical and efficient procedure for performing adaptive quantum tomography with rigorous statistical principles.
We give collective tomography protocols for quantum states and channels with known symmetries, using random purification and dilation to reduce learning to pure-state estimation. For states commuting with a compact-group representation with multiplicities mλm_λmλ​, the optimal copy complexity is Θ((∑λmλ2+log⁡η−1)/ε2)Θ((\sum_λm_λ^2+\logη^{-1})/\varepsilon^2)Θ((∑λ​mλ2​+logη−1)/ε2) for sufficiently small trace-distance error ε\varepsilonε and failure probability ηηη for the nontrivial case ∑λmλ2>1\sum_λm_λ^2>1∑λ​mλ2​>1. For GGG-covariant channels with finite-dimensional unitary representations of a compact group GGG, parallel O~(DG/ε2)\widetilde{O}(D_G/\varepsilon^2)O(DG​/ε2) queries achieve a diamond-distance error $\varepsilon $ at fixed success probability 2/32/32/3, where DGD_GDG​ counts the real parameters of covariant Choi operators before imposing trace preservation. For permutation-covariant channels on kkk qudits of fixed local dimension ddd, at sufficiently small fixed error and fixed success probability 2/32/32/3, we obtain the optimal query scalings Θd(kd4−1)Θ_d(k^{d^4-1})Θd​(kd4−1) for diamond distance and Θd(kd4−d2)Θ_d(k^{d^4-d^2})Θd​(kd4−d2) for Choi trace distance. Furthermore, we resolve an open problem in quantum tomography of constructing efficient quantum circuits that approximate the Hayashi measurement for optimal pure-state estimation. We encode states in the symmetric subspace into bosonic occupation modes, realize the measurement by heterodyne detection and normalization, and approximate this procedure on qubits using the quantum Hermite transform. Combined with our symmetry-compatible purification and dilation circuits, this yields query-optimal and gate-efficient learners of permutation-covariant states and channels with gate complexity Od(poly(k,ε−1,log⁡η−1))O_d(\mathrm{poly}(k,\varepsilon^{-1},\logη^{-1}))Od​(poly(k,ε−1,logη−1)).
In the absence of experimental constraints, optimal measurement schemes for quantum state tomography are well understood. We consider the scenario where the experimenter doesn't have arbitrary freedom to construct their measurement set, and may therefore not be able to implement a known optimal scheme. We introduce a simple procedure for minimizing the uncertainty in the reconstructed quantum state for an arbitrary tomographic scheme. We do this by defining a figure of merit based on the equally weighted variance of the measurement statistics. This figure of merit is straightforwardly based on the singular value decomposition of the measurement matrix, making it well suited for optimization.