Quantum information theory is a wide area of investigation, which includes two main subjects: quantum computation and quantum communication. The success of quantum computation theory is due to a positive result: Shor's algorithm. The algorithm provides factorization of integers in a much more efficient way with respect to what is achieved not only by present-day computers, but even by the most powerful conceivable computers based on classical physics. On the other hand, the success of quantum communication is due to the intrinsic security of ideal quantum cryptographic protocols, and thus relies on a negative result, that is the impossibility of reading quantum information without scrambling it in an unrecoverable way. The no information without disturbance property spawns other no-go theorems, which represent some of the most famous and classic results in quantum information theory. Among these results one can certainly list the no-cloning theorem, stating the impossibility of copying quantum information. This impossibility is clearly a consequence of the impossibility of extracting information without disturbing it. Indeed, if we could copy exactly the state of a system, reproducing it on another system of the same type, then we would also be able to iterate this process, and produce as many copies as we want. We could then extract all the information we are interested in from the copies, keeping the original intact. This argument is so simple, but hides a very deep point about quantum information, and more generally about any type of information that can be purified. Suppose indeed that there exists a measurement allowing us to determine the state of a system, with absolute precision. We could then use such a measurement on the system, and once we know its exact state, we can in principle re-prepare the same state as many times as we want. If copying the state is forbidden within a theory, we must then conclude that, in that theory, measuring the state is forbidden, too! This is exactly the case in theories with purification, and in particular in quantum theory. In quantum theory, determining the state of a system is impossible. We can only have some information about what state our system is prepared in. The information may be accurate, but it will never be certain. This could be practically the case in classical theory, too.
Quantum information theory is a wide area of investigation, which includes two main subjects: quantum computation and quantum communication. The success of quantum computation theory is due to a positive result: Shor's algorithm. The algorithm provides factorization of integers in a much more efficient way with respect to what is achieved not only by present-day computers, but even by the most powerful conceivable computers based on classical physics. On the other hand, the success of quantum communication is due to the intrinsic security of ideal quantum cryptographic protocols, and thus relies on a negative result, that is the impossibility of reading quantum information without scrambling it in an unrecoverable way. The no information without disturbance property spawns other no-go theorems, which represent some of the most famous and classic results in quantum information theory. Among these results one can certainly list the no-cloning theorem, stating the impossibility of copying quantum information. This impossibility is clearly a consequence of the impossibility of extracting information without disturbing it. Indeed, if we could copy exactly the state of a system, reproducing it on another system of the same type, then we would also be able to iterate this process, and produce as many copies as we want. We could then extract all the information we are interested in from the copies, keeping the original intact. This argument is so simple, but hides a very deep point about quantum information, and more generally about any type of information that can be purified. Suppose indeed that there exists a measurement allowing us to determine the state of a system, with absolute precision. We could then use such a measurement on the system, and once we know its exact state, we can in principle re-prepare the same state as many times as we want. If copying the state is forbidden within a theory, we must then conclude that, in that theory, measuring the state is forbidden, too! This is exactly the case in theories with purification, and in particular in quantum theory. In quantum theory, determining the state of a system is impossible. We can only have some information about what state our system is prepared in. The information may be accurate, but it will never be certain. This could be practically the case in classical theory, too.
The ability to transfer information securely is essential in the modern world we live in. While the field of cryptography has long researched ways to do this, events over the last couple of years have brought the issues of secure information transfer squarely into the public eye. As a consequence, security and cryptography have quickly become issues of social and political importance, sparking debates about the values of privacy and the role of government. An essential ingredient of modern cryptography is the generation of randomness: cryptographic techniques are built on the premise that one has access to random bits. It is well known, however, that computers cannot produce algorithmically random sequences – that is, sequences with maximal algorithmic information content – but are doomed to produce ‘pseudorandomness’. This lack of randomness can be, and has been, exploited to compromise security, see [4]. The active field of quantum information theory has proposed approaches to provide supposedly ‘unbreakable’ security by exploiting various quantum phenomena. This security unfortunately relies on assumptions about the nature of quantum measurements and their ability to generate random bits. Anton Zeilinger summarises this by postulating that the simplest quantum systems, qubit, can hold only one bit of classical information [6]. This foundational principle is in line with a wider paradigm shift to view quantum information as an extension of classical information, but it is nonetheless unsatisfying to simply postulate this principle, given its importance in determining the practical advantages of quantum information theory. In order to understand better how quantum mechanics can help generate meaningful information, we instead look to relate the outcomes of quantum measurements to formal properties of the system based on more fundamental assumptions. Indeed, we have shown that a) some of the postulated properties of quantum information follow from the formal structure of the theory and b) a purely formal notion of information within a quantum world can generate, via measurement, meaningful and useful information in the macroscopic world (for example, in cryptography). The indeterminism of quantum measurements can be formalised via the notion of value indefiniteness. To explain this concept, let us consider an arbitrary quantum system and ask whether the outcome of a measurement of any observable quantity A (such as the energy of the system, its angular momentum (spin), etc.) is determined prior to the measurement. If this is the case, then we say the observable is value definite with value v(A); otherwise, the observable is value indefinite and v(A) is undefined. Mathematically, one can reduce all observable quantities to so-called projection observables, which can only take the values 0 or 1. Thus, the question of whether the outcome of several measurements can be simultaneously determined in advance can be rephrased in terms of the information ‘carried’ by a particular system in a definite quantum state. Classically, one expects that all quantities are determined in advance, and hence all observables are value definite. Quantum mechanically, however, the belief is that this is not the case, and the information content of quantum systems is limited. Formulating carefully the notion of value indefiniteness allows us to formalise the notion of (quantum) indeterminism; however, this doesn’t help clarify whether quantum systems are indeed value indefinite or not. Staying in this formal framework, the Kochen-Specker theorem [5] provides a first positive result, showing that at least some observables must be value indefinite if one makes the assumption known as non-contextuality, which states that any definite values that exist must be independent of other compatible measurements that may or may not be performed on the system. Under the same assumption, this theorem can be strengthened to show that only one single observable can have the definite value 1 (see [2]). Furthermore, only observables that can be measured simultaneously with this single one can have the definite value 0; the rest must all be value indefinite. Since the preparation of a system involves precisely ensuring that, usually via measurement, the system is in a definite state with respect to some desired observable, this result shows that no other incompatible observable can be value definite. That is, preparing a system in a definite state by making the ‘preparation’ observable value definite specifies completely the information content of the quantum system. This is an example of syntactical quantum information acquiring meaning at the level of the quantum itself. Can the syntactical information at the level of the quantum generate meaning outside the quantum, that is, at the macroscopic level? The results cited above hold in the Hilbert-space framework of quantum mechanics and are formulated only in terms of a syntactical notion of information. Their real importance becomes evident when one interprets them in the context of quantum measurements. Specifically, if we prepare a quantum system in a known state, they allow us to ‘locate’ observables which we can measure, but which are value indefinite; that is, observables whose measurement results are not specified by any pre-existing property of the quantum system. Furthermore, with respect to a mathematical model of unpredictability which we developed in [3], the results of these measurements can be shown to be absolutely unpredictable. In this way we get a mathematical explanation and justification of the largely accepted intuition that quantum mechanics is inherently unpredictable, and that this unpredictability arises from the phenomenon of indefiniteness within the quantum world. Furthermore, if one considers a hypothetical infinite sequence generated by the repeated measurement of a quantum value indefinite observable, one can prove that these sequences must be strongly incomputable, technically ‘bi-immune’ [1]. Such sequences cannot be generated by any Turing machine or classical computer, showing that value indefiniteness leads to a clear classical/quantum split in a purely algorithmic context. Importantly, bi-immunity is a property of observed, macroscopic quantities, quite separate from the quantum framework in which the value indefiniteness is formalised. This form of macroscopic meaning created from the lack of syntactic information is precisely the scenario that quantum random number generators try to create, and which is essential for the development and certification of quantum cryptographic systems. The fact that the macroscopic information created goes beyond anything classically obtainable serves as a valuable practical resource, outside of and removed from the quantum formalism. To conclude, quantum information creates meaning within the quantum and via measure- ment, the lack of information within the quantum, creates meaning and valuable information at the macroscopic level. Acknowledgments The second author thanks Prof. S. Marcus for useful conversations on quantum information theory. This work was supported in part by Marie Curie FP7-PEOPLE-2010-IRSES Grant RANPHYS. References and Notes Abbott, A.A.; Calude, C.S.; Svozil, K. Strong Kochen-Specker theorem and incomputability of quantum randomness. Physical Review A 2012, 86, 062109. Abbott, A.A.; Calude, C.S.; Svozil, K. Value-indefinite observables are almost everywhere. Physical Review A 2013, 89, 032109. Abbott, A.A.; Calude, C.S.; Svozil, K. On the unpredictability of individual quantum measurement outcomes. CDMTCS Research Report 2014, 458. Calude, C.S. Quantum randomness & cryptology. CyberTalk 2013, 3, 42–43. Kochen, S.; Specker, E. The problem of hidden variables in quantum mechanics. Journal of Mathematics and Mechanics 1967, 17, 59–87. Zeilinger, A. A foundational principle for quantum mechanics. Foundations of Physics 1999, 29(4),631–643.
Abstract In modern quantum information science, the no-cloning theorem constitutes a fundamental principle stating that it is impossible to create an exact copy of an arbitrary unknown quantum state. This intrinsic limitation forms the basis of quantum security mechanisms and gives rise to unique phenomena such as quantum teleportation and superdense coding, which enable the transmission of quantum information without physically transferring the quantum state itself. Within the broader framework of quantum computation, algorithms such as Grover's algorithm provide quadratic speedup for unstructured search problems, though they do not always achieve optimal query complexity for certain classes of tasks. In such scenarios, quantum random walks offer an alternative paradigm capable of further reducing query complexity and enhancing search efficiency. This study examines the theoretical foundations and practical implications of the no-cloning theorem, quantum teleportation, superdense coding, and quantum random walks in the context of information security. Special attention is given to their role in designing countermeasure systems against information theft, destruction, and modification. Practical demonstrations are conducted using Qiskit on IBM quantum hardware, highlighting the applied significance and future potential of these quantum security mechanisms.
Information is a physical. Physical systems register and process information. These facts generated enormus interest in the development of novel quantum tecnologies, especially because the construction of smaller electronic devices ultimately leads to a consideration of quantum mechanical effects in electronic and computer desingns. The notion of the classical bit of information theory was formally pushed into the realm of the quanta with the introduction of the quantum bit or qubit, in the seminal works of Deutsch (Deutsch, 1985) and Shor (Shor, 1994). They demostrated that, indeed, controlled multipartite qubit interference effects could provide the means for a radical new way of computing, allowing the computation of many intractable computational problems, such as the factoring of large number or exact simulation of large quantum systems. The field of experimental and theoretical research in quantum information and computation has emerged as very important player in the understanding of quantum phenomena the both the basic and technological levels. This has attracted the attention of numerous researchers with backgrounds ranging from computer science, mathematics and engineerin, to the physical sciences, and we now have an interdisciplinary field where great efforts are being made in order to build devices that allow the progressing of information at a quantum level. A concise introduction to the field of quantum information and quantum computation is presented. This stars with the bassic definitions of bits, quantum registers, through to the universal gate-set for building the universal quantum computer, from a quantum network model of computation. The work shows how two-qubit gates suffice for quantum computation, emphasing the power of the quantum circuit representation for entagling and disentagling quantum states. This leads to the “no-cloning theorem”, which leads us to many interesting applications, such as quantum cryptography. Two alternative approaches or performing quantum computation are also described i) the one-way or measurement based quantum computer method, and ii) holonomic or geometric quantum computation. Following this, quantum entaglement quantification is highlighted, particulary its usefulness as a communication resource, in order to describe some of its most celebrated practical applications to date: quantum teleportation, cryptography, dens coding, and data compression. Deutsch’s concept of quantum parallelism is enphasized in order to gain insight into the potential for efficiently solving certain classically intratable algorithms. A subject central to the field of QIP- quantum decoherence- is then introduced.. Possible ways to overcome it, in particular quantum error correction, are discussed. A descriptios of some of the currently available hardware of the practical implementation of quantum computation is provided with a discussion of the main physical quantum bits that are currently employed (or proposed) for a such a purpose.
Abstract No-broadcasting theorem is one of the most fundamental results in quantum information theory; it guarantees that the simplest attacks on any quantum protocol, based on eavesdropping and copying of quantum information, are impossible. Due to the fundamental importance of the no-broadcasting theorem, it is essential to understand the exact boundaries of this limitation. We generalize the standard definition of broadcasting by restricting the set of states which we want to broadcast and restricting the sets of measurements which we use to test the broadcasting. We show that in some of the investigated cases broadcasting is equivalent to commutativity, while in other cases commutativity is not necessary.
Introduction Any technology that functions at the quantum level must face the issues of measurement and control. We have good reasons to believe that quantum physics enables communication and computation tasks that are either impossible or intractable in a classical world [NC00]. The security of widely used classical cryptographic systems relies upon the difficulty of certain computational tasks, such as breaking large semi-prime numbers into their two prime factors in the case of RSA encryption. By contrast, quantum cryptography can be absolutely secure, and is already a commercial reality. At the same time, the prospect of a quantum computer vastly faster than any classical computer at certain tasks is driving an international research programme to implement quantum information processing. Shor's factoring algorithm would enable a quantum computer to find factors exponentially faster than any known algorithm for classical computers, making classical encryption insecure. In this chapter, we investigate how issues of measurement and control arise in this most challenging quantum technology of all, quantum computation. The subjects of information theory and computational theory at first sight appear to belong to mathematics rather than physics. For example, communication was thought to have been captured by Shannon's abstract theory of information [SW49, Sha49]. However, physics must impact on such fundamental concepts once we acknowledge the fact that information requires a physical medium to support it.
Information and computation theory have undergone a spurt of new growth, and a renewal of their historic connection to basic physics, as they have expanded to treat the intact transmission and processing of quantum states, and the interaction of such 'quantum information' with traditional forms of information. We may wonder why this did not happen earlier, as quantum principles have long been accepted as fundamental to all of physics. Perhaps the founders of information and computation theory, such as Shannon, Turing and von Neumann, were too accustomed to thinking of information processing in macroscopic terms, not yet having before them the powerful examples of the genetic code and ever-shrinking microelectronics. Be that as it may, information until recently has largely been thought of in classical terms, with quantum mechanics playing a supporting role in the design of the equipment to process it, and setting limits on the rate at which it could be sent through certain channels. Now we know that a fully quantum theory of information and information processing offers, among other benefits, a brand of cryptography whose security rests on fundamental physics, and a reasonable hope of constructing quan- tum computers that could dramatically speed up the solution of certain mathematical problems. These benefits depend on distinc- tively quantum properties such as uncertainty, interference and entanglement. At a more fundamental level, it has become clear that an information theory based on quantum principles extends and completes classical information theory, just as complex numbers extend and complete the reals. Besides quantum generalizations of classical notions such as sources, channels and codes, the new theory includes two complementary, quantifiable kinds of information— classical information and quantum entanglement. Classical infor- mation can be copied at will, but can only be transmitted forward in time, to a receiver in the sender's forward light cone. Entanglement in contrast, cannot be copied, but can connect any two points in space-time. Conventional data processing operations destroy entanglement, but quantum operations can create it and use it for various purposes, such as speeding up certain classical computa- tions and assisting in the transmission of classical information or intact quantum states. Part of the new quantum information theory is the qualitative and quantitative study of entanglement, and its interactions with classical information. Any means, such as an optical fibre, of delivering quantum systems more or less intact from one place to another, may be viewed as a quantum channel. Unlike classical channels, which are well characterized by a single capacity, quantum channels have several distinct capacities, depending on what one is trying to use them for, and what auxiliary resources are brought into play. New effects involving quantum information continue to be discovered, not only in the traditional areas of computation, channel capacity, and cryptography, but in areas such as commu- nication complexity and game theory.