2020/10/31 by Seok Hyung Lie, Hyunseok Jeong
Computer Science · Physics and Astronomy · #Dimension (graph theory) #Process (computing) #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum capacity #Quantum information #Quantum operation #Quantum process #Randomness #quant-ph
paper · pdf · doi:10.1103/physrevresearch.3.013218
published as Phys. Rev. Research 3, 013218 (2021) · 9 pages, 3 figures; close to the version accepted in Physical Review Research
openalex publication_date 2021/03/08 · arxiv created 2021/03/11 · arxiv updated 2021/03/12 · openalex created_date 2021/03/15 · openalex updated_date 2026/08/05
Randomness can help one to implement quantum maps that cannot be realized in a deterministic fashion. Recently, it was discovered that explicitly treating a randomness source as a quantum system could double the efficiency as a catalyst for some tasks. In this work, we first show that every quantum channel that can be implemented with a randomness source without leaking information to it must be a catalysis. For that purpose, we prove a new no-go theorem that generalizes the no-hiding theorem, the no-secret theorem that states no quantum information can be shared with other systems as a secret without leaking some information. Second, we show that nondegenerate catalysts should be used classically when no extra dimension is allowed, which leads to the fact that the quantum advantage of a catalytic process strictly comes from the uniformness of the randomness source. Finally, we discuss a method to circumvent the previous result that achieves quantum advantage with nondegenerate catalyst uniformized by employing extra work space.