Sealing information means making it publicly available, but with the possibility of knowing if it has been read. Commenting on [1], we will show that perfect quantum sealing is not possible for perfectly retrievable information, due to the possibility of performing a perfect measurement without disturbance, even on unknown states. The measurement is a collective one, and this makes the protocol of quantum sealing very interesting as the only example of the power of collective measurements in breaking security.
Blind quantum computing protocols enable a client, who can generate or measure single-qubit states, to delegate quantum computing to a remote quantum server protecting the client's privacy (i.e., input, output, and program). With current technologies, generations or measurements of single-qubit states are not too much burden for the client. In other words, secure delegated quantum computing is possible for "almost classical" clients. However, is it possible for a "completely classical" client? Here we consider a one-round perfectly-secure delegated quantum computing, and show that the protocol…
We discuss the possibility of engineering a Hamiltonian that can perfectly mirror a state of many excitations stored on a square lattice. In comparison to the well-studied case of a chain, there is potential for a speed-up of information transfer. However, we prove that in a large class of cases, perfect state mirroring on a square lattice is impossible.
Impossibility via W states and feasibility via W-like states for perfect quantum teleportation
Graduate School of Science and Engineering, Chiba University（千叶大学理工学研究科）；Department of Physics, Graduate School of Science, Chiba University（千叶大学理学研究科物理系）；Research and Education Center for Natural Sciences, Keio University（庆应义塾大学自然科学与教育研究中心）
Impossibility of Perfectly Complete Many-Round Key Agreement in the QROM
University of Cambridge（剑桥大学）；Shenzhen Research Institute of Big Data（深圳大数据研究院）；Tsinghua University（清华大学）；University of California San Diego（加州大学圣迭戈分校）
Impossibility of perfect cheating for single-qubit position verification
National Institute of Standards and Technology（美国国家标准与技术研究院）；Joint Center for Quantum Information and Computer Science (QuICS), University of Maryland（马里兰大学量子信息与计算联合中心）；Department of Computing, Arabian Gulf University（阿拉伯海湾大学计算系）
In this work, we reveal a new type of impossibility discovered in our recent research which forbids comparing the closeness of multiple unknown quantum states with any non-trivial threshold in a perfect or an unambiguous way. This impossibility is distinct from the existing impossibilities in that it is a "collective" impossibility on multiple quantum states while most other "no-go" theorems concern with only one single state each time, i.e., it is an impossibility on a non-local quantum operation. This novel impossibility may provide a new insight into the nature of quantum mechanics and it i…
Is there any point of principle that prohibits us from doing one or more forms of quantum information processing? It is now well known that an unknown quantum state can neither be copied nor deleted perfectly. Given a set of states which are not necessarily orthogonal, is it possible to compare any two states from the set, given some reasonable ordering of such states? Is it possible to sort them in some specific order? In the context of quantum computation, it is shown here that there is no quantum circuit implementing a unitary transformation, for comparing and sorting an unrestricted set of…
In this work we initiate the question of whether quantum devices can provide us with an almost perfect source of classical randomness, and more generally, suffice for classical cryptographic tasks, such as encryption. Indeed, it is well known that classical computers are insufficient for either one of these tasks when all they have access to is a realistic imperfect source of randomness. On the other hand, quantum physics is inherently probabilistic which suggests that perhaps quantum computers can provide a reasonable way to overcome the above mentioned impossibility results. However, we show…
A photon in an arbitrary polarization state cannot be cloned perfectly. But suppose that at our disposal we have several copies of an unknown photon. Is it possible to delete the information content of one or more of these photons by a physical process? Specifically, if two photons are in the same initial polarization state is there a mechanism that produces one photon in the same initial state and the other in some standard polarization state. If this can be done, then one would create a standard blank state onto which one could copy an unknown state approximately, by deterministic cloning or…
It is well known that it is impossible to clone an arbitrary quantum state. However, this inability does not lead directly to no-cloning of quantum coherence. Here, we show that it is impossible to clone the coherence of an arbitrary quantum state which is a stronger statement than the 'no-cloning of quantum state'. In particular, with ancillary system as machine state, we show that it is impossible to clone the coherence of states whose coherence is greater than the coherence of the known states on which the transformations are defined. Also, we characterize the class of states for which cohe…
The famous Shannon impossibility result says that any encryption scheme with perfect secrecy requires a secret key at least as long as the message. In this paper we provide its quantum analogue with imperfect secrecy and imperfect correctness. We also give a systematic study of information-theoretically secure quantum encryption with two secrecy definitions. We show that the weaker one implies the stronger but with a security loss in $d$, where $d$ is the dimension of the encrypted quantum system. This is good enough if the target secrecy error is of $o(d^{-1})$.
We discuss proofs of nonlocality based on a generalization by Erwin Schrödinger of the argument of Einstein, Podolsky and Rosen. These proofs do not appeal in any way to Bell's inequalities. Indeed, one striking feature of the proofs is that they can be used to establish nonlocality solely on the basis of suitably robust perfect correlations. First we explain that Schrödinger's argument shows that locality and the perfect correlations between measurements of observables on spatially separated systems implies the existence of a non-contextual value-map for quantum observables; non-contextual me…
Perfect transfer of a quantum state through a one-dimensional chain is now well understood, allowing one not only to decide whether a fixed Hamiltonian achieves perfect transfer, but to design a suitable one. We are particularly interested in being able to design, or understand the limitations imposed upon, Hamiltonians subject to various naturally arising constraints such as a limited coupling topology with low connectivity (specified by a graph) and type of interaction. In this paper, we characterise the necessary and sufficient conditions for transfer through a network, and describe some na…
We study mechanisms that allow one to synchronize the quantum phase of two qubits relative to a fixed basis. Starting from one qubit in a fixed reference state and the other in an unknown state, we find that contrary to the impossibility of perfect quantum cloning, the quantum-phase can be synchronized perfectly through a joined unitary operation. When both qubits are initially in a pure unknown state, perfect quantum-phase synchronization through unitary operations becomes impossible. In this situation we determine the maximum average quantum-phase synchronization fidelity, the distribution o…
This paper addresses the controversy between Mayers, Lo and Chau on one side, and Yuen on the opposite side, on whether there exist or not unconditionally secure protocols. For such purpose, a complete classification of all possible bit commitment protocols is given, including all possible cheating attacks. For the simplest class of protocols (non-aborting and with complete and perfect verification), it is shown how naturally a game-theoretical situation arises. For these protocols, bounds for the cheating probabilities are derived, which turn out to be different from those given in the imposs…
The impossibility of perfect cloning and state estimation are two fundamental results in Quantum Mechanics. It has been conjectured that quantum cloning becomes equivalent to state estimation in the asymptotic regime where the number of clones tends to infinity. We prove this conjecture using two known results of Quantum Information Theory: the monogamy of quantum correlations and the properties of entanglement breaking channels.
Secure function evaluation is a two-party cryptographic primitive where Bob computes a function of Alice's and his respective inputs, and both hope to keep their inputs private from the other party. It has been proven that perfect (or near perfect) security is impossible, even for quantum protocols. We generalize this no-go result by exhibiting a constant lower bound on the cheating probabilities for any quantum protocol for secure function evaluation, and present many applications from oblivious transfer to the millionaire's problem. Constant lower bounds are of practical interest since they …
Mayers, Lo and Chau argued that all quantum bit commitment protocols are insecure, because there is no way to prevent an Einstein-Podolsky-Rosen (EPR) cheating attack. However, Yuen presented some protocols which challenged the previous impossibility argument. Up to now, it is still debated whether there exist or not unconditionally secure protocols. In this paper the above controversy is addressed. For such purpose, a complete classification of all possible bit commitment protocols is given, including all possible cheating attacks. Focusing on the simplest class of protocols (non-aborting and…
The celebrated quantum no-cloning theorem establishes the impossibility of making a perfect copy of an unknown quantum state. The discovery of this important theorem for the field of quantum information is currently dated 1982. I show here that an article published in 1970 [J. L. Park, Foundations of Physics, 1, 23-33 (1970)] contained an explicit mathematical proof of the impossibility of cloning quantum states. I analyze Park's demonstration in the light of published explanations concerning the genesis of the better-known papers on no-cloning.
The Wigner-Araki-Yanase (WAY) theorem can be understood as a result in the resource theory of asymmetry asserting the impossibility of perfectly simulating, via symmetric processing, the measurement of an asymmetric observable unless one has access to a state that is perfectly asymmetric, that is, one whose orbit under the group action is a set of orthogonal states. The simulation problem can be characterized information-theoretically by considering how well both the target observable and the resource state can provide an encoding of an element of the symmetry group. Leveraging this informatio…
In this paper the failure of Hardy's nonlocality proof for the class of maximally entangled states is considered. A detailed analysis shows that the incompatibility of the Hardy equations for this class of states physically originates from the fact that the existence of quantum perfect correlations for the three pairs of two-valued observables (D_11,D_21), (D_11,D_22) and (D_12,D_21) [in the sense of having with certainty equal (different) readings for a joint measurement of any one of the pairs (D_11,D_21), (D_11,D_22), and (D_12,D_21)], necessarily entails perfect correlation for the pair of…
Voting is a game with a no-go theorem. New proofs of Arrow's impossibility theorem are given based on quantum information theory. We show that the Arrowian dictator is equivalent to the perfect cloning circuit. We present \textit{Gedankenexperiment} of voting and Bell-like inequalities of voting. We provide the thermodynamic interpretation of voting with Landauer's principle.
The impossibility to clone an unknown quantum state is a powerful principle to understand the nature of quantum mechanics, especially within the context of quantum computing and quantum information. This principle has been generalized to quantitative statements as to what extent imperfect cloning is possible. We delineate an aspect of the border between the possible and the impossible concerning quantum cloning, by putting forward an entanglement-assisted scheme for simulating perfect cloning in the context of weak measurements. This phenomenon we call weak cloning of an unknown quantum state.
The indistinguishability of non-orthogonal pure states lies at the heart of quantum information processing. Although the indistinguishability reflects the impossibility of measuring complementary physical quantities by a single measurement, we demonstrate that the distinguishability can be perfectly retrieved simply with the help of posterior classical partial information. We demonstrate this by showing an ensemble of non-orthogonal pure states such that a state randomly sampled from the ensemble can be perfectly identified by a single measurement with help of the post-processing of the measur…
The impossibility of perfectly copying (or cloning) an arbitrary quantum state is one of the basic rules governing the physics of quantum systems. The processes that perform the optimal approximate cloning have been found in many cases. These "quantum cloning machines" are important tools for studying a wide variety of tasks, e.g. state estimation and eavesdropping on quantum cryptography. This paper provides a comprehensive review of quantum cloning machines (both for discrete-dimensional and for continuous-variable quantum systems); in addition, it presents the role of cloning in quantum cry…
The impossibility of perfectly discriminating non orthogonal quantum states imposes far-reaching consequences both on quantum and classical communication schemes. We propose and numerically analyze an optimized quantum receiver for the discrimination of phase encoded signals. Our scheme outperforms the standard quantum limit and approaches the Helstrom bound for any signal power. The discrimination is performed via an optimized, feedback-mediated displacement prior to a photon counting detector. We provide a detailed analysis of the influence of excess noise and technical imperfections on the …
University of Cambridge（剑桥大学）；Shenzhen International Center For Industrial And Applied Mathematics, Shenzhen Research Institute of Big Data（深圳国际应用数学中心，深圳大数据研究院）；Tsinghua University（清华大学）；University of California San Diego（加州大学圣地亚哥分校）
One of the most fascinating aspects of quantum mechanics is the principle impossibility of deterministic errorless discrimination of nonorthogonal signals, such as coherent states. On the one hand, it prevents perfect cloning of quantum states and enables secure communication. On the other hand, it makes a grand challenge to reach the ultimate measurement precision. Although the minimum possible error rate (the Helstrom bound) has been known for almost five decades, there is no practical way to achieve it. Developing the realistic optimal measurement strategies to attain the Helstrom bound is …
Quantum sorter has gained a lot of attention during the last years due to its wide application in quantum information processing and quantum technologies. A challenging task is the construction of a quantum sorter, which collect many high-dimensional quantum systems, which are simultaneously incident on different input ports of the device. In this paper we give the definition of the general quantum sorter of multi-level quantum systems. We prove the impossibility of the construction of the perfect quantum sorter, which works for many particles incident on any input port, while keeping their st…
Any measurement is intended to provide information on a system, namely knowledge about its state. However, we learn from quantum theory that it is generally impossible to extract information without disturbing the state of the system or its correlations with other systems. In this paper we address the issue of the interplay between information and disturbance for a general operational probabilistic theory. The traditional notion of disturbance considers the fate of the system state after the measurement. However, the fact that the system state is left untouched ensures that also correlations a…
The impossibility of deterministic and error-free discrimination among nonorthogonal quantum states lies at the core of quantum theory and constitutes a primitive for secure quantum communication. Demanding determinism leads to errors, while demanding certainty leads to some inconclusiveness. One of the most fundamental strategies developed for this task is the optimal unambiguous measurement. It encompasses conclusive results, which allow for error-free state retrodictions with the maximum success probability, and inconclusive results, which are discarded for not allowing perfect identificati…
This PHD thesis is concerned with uncertainty relations in quantum probability theory, state estimation in quantum stochastics, and natural bundles in differential geometry. After some comments on the nature and necessity of decoherence in open systems and its absence in closed ones, we prove sharp, state-independent inequalities reflecting the Heisenberg principle, the necessity of decoherence and the impossibility of perfect joint measurement. These bounds are used to judge how far a particular measurement is removed from the optimal one. We do this for a qubit interacting with the quantized…
