A well-known feature of quantum information is that it cannot, in general, be cloned. Recently, a number of quantum-enabled information-processing tasks have demonstrated various forms of uncloneability; among these forms, piracy is an adversarial model that gives maximal power to the adversary, in controlling both a cloning-type attack, as well as the evaluation/verification stage. Here, we initiate the study of anti-piracy proof systems, which are proof systems that inherently prevent piracy attacks. We define anti-piracy proof systems, demonstrate such a proof system for an oracle problem, and also describe a candidate anti-piracy proof system for NP. We also study quantum proof systems that are cloneable and settle the famous QMA vs. QMA(2) debate in this setting. Lastly, we discuss how one can approach the QMA vs. QCMA question, by studying its cloneable variants.

翻译：量子信息的一个众所周知特性是，在一般情况下无法被克隆。最近，多项基于量子的信息处理任务展示了不同形式的不可克隆性；在这些形式中，盗版是一种对抗模型，它赋予对手最大限度的控制权，既控制克隆型攻击，也控制评估/验证阶段。在此，我们开创性地研究反盗版证明系统，即本质上能防止盗版攻击的证明系统。我们定义了反盗版证明系统，针对一个预言机问题展示了此类证明系统，并描述了一个针对NP问题的候选反盗版证明系统。我们还研究了可克隆的量子证明系统，并在此背景下解决了著名的QMA与QMA(2)的争议。最后，我们探讨了如何通过研究其可克隆变体来逼近QMA与QCMA的问题。