Quantum tomography using state-preparation unitaries

Joran van Apeldoorn, A. Cornelissen, Andr'as Gily'en, G. Nannicini
{"title":"Quantum tomography using state-preparation unitaries","authors":"Joran van Apeldoorn, A. Cornelissen, Andr'as Gily'en, G. Nannicini","doi":"10.48550/arXiv.2207.08800","DOIUrl":null,"url":null,"abstract":"We describe algorithms to obtain an approximate classical description of a $d$-dimensional quantum state when given access to a unitary (and its inverse) that prepares it. For pure states we characterize the query complexity for $\\ell_q$-norm error up to logarithmic factors. As a special case, we show that it takes $\\widetilde{\\Theta}(d/\\varepsilon)$ applications of the unitaries to obtain an $\\varepsilon$-$\\ell_2$-approximation of the state. For mixed states we consider a similar model, where the unitary prepares a purification of the state. In this model we give an efficient algorithm for obtaining Schatten $q$-norm estimates of a rank-$r$ mixed state, giving query upper bounds that are close to optimal. In particular, we show that a trace-norm ($q=1$) estimate can be obtained with $\\widetilde{\\mathcal{O}}(dr/\\varepsilon)$ queries. This improves (assuming our stronger input model) the $\\varepsilon$-dependence over the algorithm of Haah et al.\\ (2017) that uses a joint measurement on $\\widetilde{\\mathcal{O}}(dr/\\varepsilon^2)$ copies of the state. To our knowledge, the most sample-efficient results for pure-state tomography come from setting the rank to $1$ in generic mixed-state tomography algorithms, which can be computationally demanding. We describe sample-optimal algorithms for pure states that are easy and fast to implement. Along the way we show that an $\\ell_\\infty$-norm estimate of a normalized vector induces a (slightly worse) $\\ell_q$-norm estimate for that vector, without losing a dimension-dependent factor in the precision. We also develop an unbiased and symmetric version of phase estimation, where the probability distribution of the estimate is centered around the true value. Finally, we give an efficient method for estimating multiple expectation values, improving over the recent result by Huggins et al.\\ (2021) when the measurement operators do not fully overlap.","PeriodicalId":92709,"journal":{"name":"Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms","volume":"41 1","pages":"1265-1318"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2207.08800","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 24

Abstract

We describe algorithms to obtain an approximate classical description of a $d$-dimensional quantum state when given access to a unitary (and its inverse) that prepares it. For pure states we characterize the query complexity for $\ell_q$-norm error up to logarithmic factors. As a special case, we show that it takes $\widetilde{\Theta}(d/\varepsilon)$ applications of the unitaries to obtain an $\varepsilon$-$\ell_2$-approximation of the state. For mixed states we consider a similar model, where the unitary prepares a purification of the state. In this model we give an efficient algorithm for obtaining Schatten $q$-norm estimates of a rank-$r$ mixed state, giving query upper bounds that are close to optimal. In particular, we show that a trace-norm ($q=1$) estimate can be obtained with $\widetilde{\mathcal{O}}(dr/\varepsilon)$ queries. This improves (assuming our stronger input model) the $\varepsilon$-dependence over the algorithm of Haah et al.\ (2017) that uses a joint measurement on $\widetilde{\mathcal{O}}(dr/\varepsilon^2)$ copies of the state. To our knowledge, the most sample-efficient results for pure-state tomography come from setting the rank to $1$ in generic mixed-state tomography algorithms, which can be computationally demanding. We describe sample-optimal algorithms for pure states that are easy and fast to implement. Along the way we show that an $\ell_\infty$-norm estimate of a normalized vector induces a (slightly worse) $\ell_q$-norm estimate for that vector, without losing a dimension-dependent factor in the precision. We also develop an unbiased and symmetric version of phase estimation, where the probability distribution of the estimate is centered around the true value. Finally, we give an efficient method for estimating multiple expectation values, improving over the recent result by Huggins et al.\ (2021) when the measurement operators do not fully overlap.
使用状态制备酉元的量子层析成像
我们描述了当给定对准备它的酉(及其逆)的访问时获得$d$维量子态的近似经典描述的算法。对于纯状态,我们将查询复杂度表征为$\ell_q$ -范数误差到对数因子。作为一种特殊情况,我们证明了它需要$\widetilde{\Theta}(d/\varepsilon)$应用酉元来获得状态的$\varepsilon$ - $\ell_2$ -近似。对于混合状态,我们考虑一个类似的模型,其中单位准备状态的净化。在该模型中,我们给出了一种有效的算法来获得秩$r$混合状态的Schatten $q$ -范数估计,并给出了接近最优的查询上界。特别地,我们展示了可以通过$\widetilde{\mathcal{O}}(dr/\varepsilon)$查询获得跟踪范数($q=1$)估计。这改善了(假设我们的输入模型更强)对Haah等人(2017)算法的$\varepsilon$依赖,该算法使用对$\widetilde{\mathcal{O}}(dr/\varepsilon^2)$个状态副本的联合测量。据我们所知,纯状态层析成像的样本效率最高的结果来自于在通用混合状态层析成像算法中将秩设置为$1$,这可能对计算要求很高。我们描述了简单且快速实现的纯状态的样本最优算法。在此过程中,我们展示了标准化向量的$\ell_\infty$ -范数估计会导致该向量的$\ell_q$ -范数估计(稍微差一点),而不会失去精度中的维度相关因素。我们还开发了一种无偏对称的相位估计,其中估计的概率分布以真实值为中心。最后,我们给出了一种有效的估计多个期望值的方法,在测量算子不完全重叠的情况下,改进了Huggins等人(2021)最近的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
6.50
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书