In the framework of non-relativistic quantum mechanics we present a proposal for a gedunken experimental setup of a quantum system allowing information exchange. We discuss the compatibility of the procedure with a few no-go theorems.
It is well known that (non-orthogonal) pure states cannot be cloned so one may ask: how much or what kind of additional (quantum) information is needed to supplement one copy of a quantum state in order to be able to produce two copies of that state by a physical operation? For classical information, no supplementary information is required. However for pure quantum (non-orthogonal) states, we show that the supplementary information must always be as large as it can possibly be i.e. the clone must be able to be generated from the additional information alone, independently of the first (given) copy.
In this article I raise a new problem for quantum mechanics, which I call the control problem. Like the measurement problem, the control problem places a fundamental constraint on quantum theories. The characteristic feature of the problem is its focus on state preparation. In particular, whereas the measurement problem turns on a premise about the completeness of the quantum state (‘no hidden variables’), the control problem turns on a premise about our ability to prepare or control quantum states. After raising the problem, I discuss some applications. I suggest that it provides a useful new lens through which to view existing theories or interpretations, in part because it draws attention to aspects of those theories that the measurement problem does not (such as the role of conditional and relative states). I suggest that it also helps clarify the physical significance of the well-known no-go result—the no-cloning theorem—on which it is based.
Two of the fundamental no-go theorems of quantum information are the no-cloning theorem (that it is impossible to make copies of general quantum states) and the no-teleportation theorem (the prohibition on telegraphing, or sending quantum states over classical channels without pre-shared entanglement). They are known to be equivalent, in the sense that a collection of quantum states is telegraphable if and only if it is clonable. Our main result suggests that this is not the case when computational efficiency is considered. We give a collection of quantum states and quantum oracles relative to which these states are efficiently clonable but not efficiently telegraphable. Given that the opposite scenario is impossible (states that can be telegraphed can always trivially be cloned), this gives the most complete quantum oracle separation possible between these two important no-go properties. We additionally study the complexity class clonableQMA, a subset of QMA whose witnesses are efficiently clonable. As a consequence of our main result, we give a quantum oracle separation between clonableQMA and the class QCMA, whose witnesses are restricted to classical strings. We also propose a candidate oracle-free promise problem separating these classes. We finally demonstrate an application of clonable-but-not-telegraphable states to cryptography, by showing how such states can be used to protect against key exfiltration.