The idea to assimilate classical information theory with quantum mechanics resulted in the creation of a new field in physics known as quantum information. One of the first papers in this new field occurred in the early 1970's when Stephen Wiesner wrote the seminal manuscript titled: Conjugate Coding. However, its importance wasn't imme- diately recognized and wasn't published until 1983. The 1980's and 1990's saw a number of important papers published in quantum information leading to the subfields of quantum cryptography, quantum teleportation, quantum entanglement, distinguishability of quantum states, and quantum cloning. It was also during the 1980's, that a new model of computing, known as quantum computation, was beginning to emerge. It offered the possibility of solving certain problems faster than a classical computer by exploiting various properties of quantum mechanics. Research in this field was undoubtedly stimulated by a well known talk given by Richard Feynman in 1981 at MIT on quantum simulations. Both quantum information and quantum computation were initially developed with quantum discrete variables in mind. However, over the course of the last decade, there has been a significant increase in using quantum continuous variables. This thesis will focus on the topic of quantum information and quantum computation using continuous variables. Specifically, we will theoretically consider the cloning of continuous-variable entanglement, the distinguishability of Gaussian states, new continuous-variable quantum cryptography protocols and finally, the universality of quantum computation using continuous-variable cluster states.
The idea to assimilate classical information theory with quantum mechanics resulted in the creation of a new field in physics known as quantum information. One of the first papers in this new field occurred in the early 1970's when Stephen Wiesner wrote the seminal manuscript titled: Conjugate Coding. However, its importance wasn't imme- diately recognized and wasn't published until 1983. The 1980's and 1990's saw a number of important papers published in quantum information leading to the subfields of quantum cryptography, quantum teleportation, quantum entanglement, distinguishability of quantum states, and quantum cloning. It was also during the 1980's, that a new model of computing, known as quantum computation, was beginning to emerge. It offered the possibility of solving certain problems faster than a classical computer by exploiting various properties of quantum mechanics. Research in this field was undoubtedly stimulated by a well known talk given by Richard Feynman in 1981 at MIT on quantum simulations. Both quantum information and quantum computation were initially developed with quantum discrete variables in mind. However, over the course of the last decade, there has been a significant increase in using quantum continuous variables. This thesis will focus on the topic of quantum information and quantum computation using continuous variables. Specifically, we will theoretically consider the cloning of continuous-variable entanglement, the distinguishability of Gaussian states, new continuous-variable quantum cryptography protocols and finally, the universality of quantum computation using continuous-variable cluster states.
The science of quantum information has arisen over the last two decades centered on the manipulation of individual quanta of information, known as quantum bits or qubits. Quantum computers, quantum cryptography, and quantum teleportation are among the most celebrated ideas that have emerged from this new field. It was realized later on that using continuous-variable quantum information carriers, instead of qubits, constitutes an extremely powerful alternative approach to quantum information processing. This review focuses on continuous-variable quantum information processes that rely on any combination of Gaussian states, Gaussian operations, and Gaussian measurements. Interestingly, such a restriction to the Gaussian realm comes with various benefits, since on the theoretical side, simple analytical tools are available and, on the experimental side, optical components effecting Gaussian processes are readily available in the laboratory. Yet, Gaussian quantum information processing opens the way to a wide variety of tasks and applications, including quantum communication, quantum cryptography, quantum computation, quantum teleportation, and quantum state and channel discrimination. This review reports on the state of the art in this field, ranging from the basic theoretical tools and landmark experimental realizations to the most recent successful developments.
This thesis deals with the study of quantum communication protocols with Continuous Variable (CV) systems. Continuous Variable systems are those described by canonical conjugated coordinates x and p endowed with infinite dimensional Hilbert spaces, thus involving a complex mathematical structure. A special class of CV states, are the so-called Gaussian states. With them, it has been possible to implement certain quantum tasks as quantum teleportation, quantum cryptography and quantum computation with fantastic experimental success. The importance of Gaussian states is two-fold; firstly, its structural mathematical description makes them much more amenable than any other CV system. Secondly, its production, manipulation and detection with current optical technology can be done with a very high degree of accuracy and control. Nevertheless, it is known that in spite of their exceptional role within the space of all Continuous Variable states, in fact, Gaussian states are not always the best candidates to perform quantum information tasks. Thus non-Gaussian states emerge as potentially good candidates for communication and computation purposes.
The fates of SIGACT News and Quantum Cryptography are inseparably entangled. The exact date of Stephen Wiesner's invention of "conjugate coding" is unknown but it cannot be far from April 1969, when the premier issue of SIGACT News ---or rather SICACT News as it was known at the time---came out. Much later, it was in SIGACT News that Wiesner's paper finally appeared [74] in the wake of the first author's early collaboration with Charles H. Bennett [7]. It was also in SIGACT News that the original experimental demonstration for quantum key distribution was announced for the first time [6] and that a thorough bibliography was published [19]. Finally, it was in SIGACT News that Doug Wiedemann chose to publish his discovery when he reinvented quantum key distribution in 1987, unaware of all previous work but Wiesner's [73, 5].Most of the first decade of the history of quantum cryptography consisted of this lone unpublished paper by Wiesner. Fortunately, Bennett was among the few initiates who knew of Wiesner's ideas directly from the horse's mouth. His meeting with the first author of this column in 1979 was the beginning of a most fruitful lifelong collaboration. It took us five more years to invent quantum key distribution [4], which is still today the best-known application of quantum mechanics to cryptography. The second author joined in slightly later, followed by a few others. But until the early 1990's, no more than a handful of people were involved in quantum cryptographic research. Since then, the field has taken off with a vengeance, starting with Artur K. Ekert's proposal to use quantum nonlocality for cryptographic purposes [33].The golden age started in earnest when Ekert organized the first international workshop on quantum cryptography in Broadway, England, in 1993. Since then, many conferences have been devoted at least partly to quantum cryptography, which has become a major international topic. The purpose of the aforementioned 1993 bibliography in SIGACT News was to cite as much as possible all papers ever written on the subject, including unpublished manuscripts: there were 57 entries in total. Today, such an undertaking would be nearly impossible owing to the explosion of new research in the field.The purpose of this column is to give an overview of the current research in quantum cryptography. It is not our intention to be exhaustive and we apologize in advance to any researcher whose work we may have omitted. Note that we do not necessarily agree with the claims in every paper mentioned here: this column should not be construed as a seal of approval!
The subject of quantum computing brings together ideas from classical information theory, computer science, and quantum physics. This review aims to summarize not just quantum computing, but the whole subject of quantum information theory. Information can be identified as the most general thing which must propagate from a cause to an effect. It therefore has a fundamentally important role in the science of physics. However, the mathematical treatment of information, especially information processing, is quite recent, dating from the mid-20th century. This has meant that the full significance of information as a basic concept in physics is only now being discovered. This is especially true in quantum mechanics. The theory of quantum information and computing puts this significance on a firm footing, and has led to some profound and exciting new insights into the natural world. Among these are the use of quantum states to permit the secure transmission of classical information (quantum cryptography), the use of quantum entanglement to permit reliable transmission of quantum states (teleportation), the possibility of preserving quantum coherence in the presence of irreversible noise processes (quantum error correction), and the use of controlled quantum evolution for efficient computation (quantum computation). The common theme of all these insights is the use of quantum entanglement as a computational resource. It turns out that information theory and quantum mechanics fit together very well. In order to explain their relationship, this review begins with an introduction to classical information theory and computer science, including Shannon's theorem, error correcting codes, Turing machines and computational complexity. The principles of quantum mechanics are then outlined, and the Einstein, Podolsky and Rosen (EPR) experiment described. The EPR-Bell correlations, and quantum entanglement in general, form the essential new ingredient which distinguishes quantum from classical information theory and, arguably, quantum from classical physics. Basic quantum information ideas are next outlined, including qubits and data compression, quantum gates, the `no cloning' property and teleportation. Quantum cryptography is briefly sketched. The universal quantum computer (QC) is described, based on the Church-Turing principle and a network model of computation. Algorithms for such a computer are discussed, especially those for finding the period of a function, and searching a random list. Such algorithms prove that a QC of sufficiently precise construction is not only fundamentally different from any computer which can only manipulate classical information, but can compute a small class of functions with greater efficiency. This implies that some important computational tasks are impossible for any device apart from a QC. To build a universal QC is well beyond the abilities of current technology. However, the principles of quantum information physics can be tested on smaller devices. The current experimental situation is reviewed, with emphasis on the linear ion trap, high- Q optical cavities, and nuclear magnetic resonance methods. These allow coherent control in a Hilbert space of eight dimensions (three qubits) and should be extendable up to a thousand or more dimensions (10 qubits). Among other things, these systems will allow the feasibility of quantum computing to be assessed. In fact such experiments are so difficult that it seemed likely until recently that a practically useful QC (requiring, say, 1000 qubits) was actually ruled out by considerations of experimental imprecision and the unavoidable coupling between any system and its environment. However, a further fundamental part of quantum information physics provides a solution to this impasse. This is quantum error correction (QEC). An introduction to QEC is provided. The evolution of the QC is restricted to a carefully chosen subspace of its Hilbert space. Errors are almost certain to cause a departure from this subspace. QEC provides a means to detect and undo such departures without upsetting the quantum computation. This achieves the apparently impossible, since the computation preserves quantum coherence even though during its course all the qubits in the computer will have relaxed spontaneously many times. The review concludes with an outline of the main features of quantum information physics and avenues for future research.
Summary form only given. Traditionally quantum information research has centred on discrete quantum variables, particularly binary variables (qubits). However, recently much attention has focused on quantum information manipulations with continuous variables such as the amplitude and phase of the electromagnetic field. As well as offering the possibility of high data rates, continuous variables also exhibit greater versatility in realizing certain operations. For example teleportation, in which quantum information is passed intact through a classical channel with the assistance of shared entanglement, can be achieved more efficiently using continuous variable techniques. I review recent work on the characterization of teleportation and entanglement swapping and present new work on interferometric tests of teleportation. These interferometric tests are important because they allow the efficacy of teleportation to be checked without knowledge of the input quantum state. They can be applied equally to the cases of discrete and continuous variable inputs and in so doing highlight unexpected similarities. I contrast the various classical limits which emerge from the different ways of assessing teleportation. An obvious omission from the list of continuous variable quantum information manipulations is any proposal for direct analogues of 2 photon interference effects, especially those that lead to Bell inequality type tests of local realism. Bell-type correlations are the defining feature of discrete variable entanglement experimentally. I discuss new work that shows how entanglement of the Bell-type can be observed in continuous variable, homodyne measurement schemes.
The development of quantum algorithms and quantum information theory, as well as the design and construction of experimental quantum computers, are the most exciting events in the scientific community in the last two decades. In this talk, I will briefly introduce quantum computation and quantum information. I will also discuss the influences of these developments on information security and our recent research results on the design of cryptographic protocol by using quantum information. Quantum Computers In 1982 Richard Feynman observed that certain quantum mechanical effects cannot be simulated efficiently on a traditional computer. It is speculated that computations may be done more efficiently by using these quantum effects.