Streaming quantum state purification
Andrew M. Childs, Honghao Fu, Debbie Leung, Zhi Li, Maris Ozols, and, Vedang Vyas

TL;DR
This paper introduces an efficient, recursive quantum state purification protocol for qudits of any dimension, suitable for streaming data, with asymptotically optimal sample complexity in reducing errors.
Contribution
It develops a novel purification method based on the swap test that works for qudits of any dimension and is optimal in sample complexity.
Findings
Protocol is asymptotically optimal in final error parameter
Applicable in streaming scenarios with minimal quantum memory
Works for qudits of any dimension
Abstract
Quantum state purification is the task of recovering a nearly pure copy of an unknown pure quantum state using multiple noisy copies of the state. This basic task has applications to quantum communication over noisy channels and quantum computation with imperfect devices, but has only been studied previously for the case of qubits. We derive an efficient purification procedure based on the swap test for qudits of any dimension, starting with any initial error parameter. Treating the initial error parameter and the dimension as constants, we show that our procedure has sample complexity asymptotically optimal in the final error parameter. Our protocol has a simple recursive structure that can be applied when the states are provided one at a time in a streaming fashion, requiring only a small quantum memory to implement.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Stochastic Gradient Optimization Techniques
