van Apeldoorn, Joran and Cornelissen, Arjan and Gilyén, András and Nannicini, Giacomo (2023) Quantum tomography using state-preparation unitaries. In: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, Philadelphia (PA), pp. 1265-1318. ISBN 9781611977554
|
Text
1.9781611977554.ch47.pdf - Published Version Download (1MB) | Preview |
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 q-norm error up to logarithmic factors. As a special case, we show that it takes Θ(d/ε) applications of the unitaries to obtain an ε-2-approximation of the state. For mixed states we consider a similar model, where the unitary prepares a purification of the state. We characterize the query complexity for obtaining Schatten q-norm estimates of a rank-r mixed state, up to polylogarithmic factors. In particular, we show that a trace-norm (q = 1) estimate can be obtained with Θ(dr/ε) queries. This improves (assuming our stronger input model) the ε-dependence over the works of O’Donnell and Wright (STOC 2016) and Haah et al. (IEEE Trans. Inf. Theory, 63.9, 2017), that use a joint measurement on O(dr/ε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 require a large amount of computing resources. We describe sample-optimal algorithms for pure states that are simple and fast to implement. Along the way we show that an ∞-norm estimate of a normalized vector induces a (slightly worse) qnorm 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. (arXiv:2111.09283) when the measurement operators do not fully overlap. More specifically, we show that for E1,...,Em normalized measurement operators, all expectation values Tr(Ejρ) can be efficiently learned up to error ε with O( state-preparation unitary for a purification of ρ.
Item Type: | Book Section |
---|---|
Additional Information: | Conference code: 191611 Cited By :1 Export Date: 12 January 2024 CODEN: PAAAF Funding details: Army Research Office, ARO, W911NF-20-1-0014 Funding details: Horizon 2020 Framework Programme, H2020 Funding details: Ministerie van Onderwijs, Cultuur en Wetenschap, OCW, 024.003.037 Funding details: Nederlandse Organisatie voor Wetenschappelijk Onderzoek, NWO Funding text 1: We are grateful to Srinivasan Arunachalam, Ronald de Wolf and anonymous referees for useful discussions and comments. Joran van Apeldoorn is supported by the Dutch Research Council (NWO/OCW), as part of QSC (024.003.037) and by QuantumDelta NL. András Gilyén acknowledges funding provided by the EU's Horizon 2020 Marie Skłodowska-Curie program 891889-QuantOrder. Giacomo Nannicini was partially supported by the Army Research Office under grant number W911NF-20-1-0014. Funding text 2: We are grateful to Srinivasan Arunachalam, Ronald de Wolf and anonymous referees for useful discussions and comments. Joran van Apeldoorn is supported by the Dutch Research Council (NWO/OCW), as part of QSC (024.003.037) and by QuantumDelta NL. András Gilyén acknowledges funding provided by the EU’s Horizon 2020 Marie Sk lodowska-Curie program 891889-QuantOrder. Giacomo Nannicini was partially supported by the Army Research Office under grant number W911NF-20-1-0014. |
Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
SWORD Depositor: | MTMT SWORD |
Depositing User: | MTMT SWORD |
Date Deposited: | 02 Apr 2024 11:40 |
Last Modified: | 02 Apr 2024 11:40 |
URI: | https://real.mtak.hu/id/eprint/191396 |
Actions (login required)
![]() |
Edit Item |