,
Zhicheng Zhang
Creative Commons Attribution 4.0 International license
We settle the problem of estimating the trace distance and (square root) fidelity between n-qubit pure quantum states to within additive error ε, given their independent samples, which was raised as an open question by Wang (IEEE Trans. Inf. Theory 2024). This is achieved by a quantum algorithm with optimal sample complexity Θ(1/ε²), improving the long-standing folklore with sample complexity O(1/ε⁴). At the heart of our algorithm is a samplized phase estimation of the product of two Householder reflections. This is realized by an improved (multi-)samplizer for pure states, through which any quantum query algorithm using Q queries to the reflection operator I - 2 |ψ⟩⟨ψ| can be converted to a δ-close (in the diamond norm distance) quantum sample algorithm using Θ(Q²/δ) samples of the state |ψ⟩. This samplizer for pure states is also shown to be optimal.
@InProceedings{wang_et_al:LIPIcs.ICALP.2026.154,
author = {Wang, Qisheng and Zhang, Zhicheng},
title = {{Sample-Optimal Quantum Estimators for Pure-State Trace Distance and Fidelity via Samplizer}},
booktitle = {53rd International Colloquium on Automata, Languages, and Programming (ICALP 2026)},
pages = {154:1--154:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-428-4},
ISSN = {1868-8969},
year = {2026},
volume = {374},
editor = {Bhattacharya, Sayan and Nanongkai, Danupon and Benedikt, Michael and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.154},
URN = {urn:nbn:de:0030-drops-265433},
doi = {10.4230/LIPIcs.ICALP.2026.154},
annote = {Keywords: Quantum algorithms, sample complexity, trace distance, fidelity, pure states, lower bounds, samplizer}
}