This research consists of three topics in quantum information science. First is an examination of the advantages that quantum information gives over classical information in very small instances of the fingerprinting problem. The second topic presents the properties of quantum Fourier transforms (QFTs) with respect to finite abelian groups, extends these ideas to finite unitary rings, and demonstrates how these properties characterize QFTs. The final topic applies some of the properties of the QFT to solve an oracle problem defined in terms of scrambled or "hidden" polynomial functions. Understanding quantum information often requires a major change in perspective, and thus has a reputation of being very difficult. Muddled and vague "popular presentations" contribute to the problem. In reaction to these issues, an introduction is presented here which relies on mathematics and supplementary commentary to present the ideas of quantum information, suitable for any reader with basic knowledge of linear algebra.
This research consists of three topics in quantum information science. First is an examination of the advantages that quantum information gives over classical information in very small instances of the fingerprinting problem. The second topic presents the properties of quantum Fourier transforms (QFTs) with respect to finite abelian groups, extends these ideas to finite unitary rings, and demonstrates how these properties characterize QFTs. The final topic applies some of the properties of the QFT to solve an oracle problem defined in terms of scrambled or "hidden" polynomial functions. Understanding quantum information often requires a major change in perspective, and thus has a reputation of being very difficult. Muddled and vague "popular presentations" contribute to the problem. In reaction to these issues, an introduction is presented here which relies on mathematics and supplementary commentary to present the ideas of quantum information, suitable for any reader with basic knowledge of linear algebra.
I study two topics in quantum information theory from the perspective of algebra and geometry. The first relates to exploring the geometry of unitary operators for small quantum systems, specifically three-level systems. Such an understanding of the space over which quantum systems evolve is central to understanding the detailed dynamics of quantum systems and to understand the correlation properties of subsystems that compose a given quantum system. The geometry of unitary operators also allows for the calculation of path-dependent phases called geometric phases. These geometric phases are central to understanding a variety of experiments. I present a general technique, called unitary integration to handle operator equations and employ it to study various physical systems in quantum optics and quantum information. Unitary integration employs an inductive program to solve for the time-evolution of a system in terms of a unitary integration solution of smaller systems. The solution to the smallest system involving just a phase is easily solved, hence truncating the program and providing a solution to the initial problem. Unitary integration is developed in chapters 2 and 3 and this technique is applied to three-level systems in chapter 4. The second topic involves quantum systems involving many subsystems. Understanding the correlation properties of the subsystems that compose such systems has been of interest in the recent past. A useful tool in furthering this understanding has been parametrized families of states. Such states depend on a smaller set of parameters than a general state in the system and hence are easier to study and manipulate. I will present an iterative procedure to define such a parametric family of states called X states. I discuss the algebraic characterization for such states and develop a geometric picture for the algebra of such states. This geometric picture involves generalizations of triangles called ``simplexes'. X states are developed along with their algebraic characterization and connections to geometry in chapters 5 and 6. The central theme that is common to both topics is the use of algebraic and geometric concepts to solve for various specific problems in quantum information iteratively. While the first topic deals with the iterative decomposition of operator equations, the second topic deals with the iterative definition of parametrized familes of quantum states.
This largely self-contained book on the theory of quantum information focuses on precise mathematical formulations and proofs of fundamental facts that form the foundation of the subject. It is intended for graduate students and researchers in mathematics, computer science, and theoretical physics seeking to develop a thorough understanding of key results, proof techniques, and methodologies that are relevant to a wide range of research topics within the theory of quantum information and computation. The book is accessible to readers with an understanding of basic mathematics, including linear algebra, mathematical analysis, and probability theory. An introductory chapter summarizes these necessary mathematical prerequisites, and starting from this foundation, the book includes clear and complete proofs of all results it presents. Each subsequent chapter includes challenging exercises intended to help readers to develop their own skills for discovering proofs concerning the theory of quantum information.
Abstract This comprehensive and self-consistent textbook presents quantum information science, a rapidly evolving interdisciplinary scientific field that will change modern computer science. The book is divided into four parts. The first part starts with a gentle introduction to some important mathematical concepts, followed by a discussion of computational models, linear algebra, and quantum mechanics. The second part explains more advanced topics of quantum mechanics, which are necessary to describe the decoherence of quantum states. The third part includes a presentation of entanglement, early quantum algorithms and quantum simulation, focussing on computational problems that quantum computers can solve faster than classical machines. The last part presents superconducting devices, a promising architecture for the implementation of quantum computers. With more than 200 figures and 100 exercises (with solutions), this book is ideal for a master’s course on quantum information processing. Readers starting a master’s program or a graduate course in physics, computer science, mathematics or quantum engineering will develop a good understanding of the fundamental concepts of the field.
Quantum computing and quantum information are two of the fastest-growing and most exciting research areas in physics. The possibilities of using non-local behaviour of quantum mechanics to factorize integers in random polynomial time have added to this new interest. This invaluable book provides a collection of problems in quantum computing and quantum information together with detailed solutions. It consists of two parts: in the first part finite-dimensional systems are considered, while the second part deals with finite-dimensional systems. All the important concepts and topics are included, such as quantum gates and quantum circuits, entanglement, teleportation, Bell states, Bell inequality, Schmidt decomposition, quantum Fourier transform, magic gates, von Neumann entropy quantum cryptography, quantum error correction, coherent states, squeezed states, POVM measurement, beam splitter and Kerr-Hamilton operator. The topics range in difficulty from elementary o advanced. Almost all of the problems are solved in detail and most of them are self-contained. All relevant definitions are given. Students can learn from this book important principles and strategies required for problem solving. Teachers will find it useful as a supplement, since important concepts and techniques are developed through the problems. It can also be used as a text or a supplement for linear and multilinear algebra or matrix theory.
This book introduces quantum computing and quantum communications at the undergraduate level for students in the physical sciences, engineering, and mathematics, assuming no prior knowledge of quantum mechanics. It is a self-contained guide assuming only that the reader is familiar with physics at the college level, calculus (up to and including ordinary differential equations), and some matrix algebra and complex numbers. The book brings the reader up to speed with fundamental concepts in quantum information processing and builds a working knowledge of basic quantum algorithms, quantum error correction, and quantum communication protocols. It covers various models of quantum computation and some of the most common physical realizations of qubits. There is a good number of practice problems and exercises that rely on computer programming with the Qiskit language. The book can be used to prepare students of physics, mathematics, electrical and computer engineering, computer science, optics and photonics, and mathematics for internships and research experiences in quantum information processing, both during and after their undergraduate studies. It also helps those who plan to apply to graduate school and do research in this area. Key Features: Self-contained coverage of quantum computing and quantum communications, from the motivations to the fundamentals and applications, including key concepts and contemporary topics. Contains practice problems and exercises, including some that require programming in Qiskit (the python-based, high-level language for programming quantum computers, adopted by nearly all quantum hardware providers and completely open source). Very light background knowledge assumed, making this book accessible to a variety of majors in the natural sciences, engineering, and mathematics.
The quantum Fourier transform (QFT) has emerged as the primary tool in quantum algorithms which achieve exponential advantage over classical computation and lies at the heart of the solution to the abelian hidden subgroup problem, of which Shor's celebrated factoring and discrete log algorithms are a special case. We begin by addressing various computational issues surrounding the QFT and give improved parallel circuits for both the QFT over a power of 2 and the QFT over an arbitrary cyclic group. These circuits are based on new insight into the relationship between the discrete Fourier transform over different cyclic groups. We then exploit this insight to extend the class of hidden subgroup problems with efficient quantum solutions. First we relax the condition that the underlying hidden subgroup function be distinct on distinct cosets of the subgroup in question and show that this relaxation can be solved whenever G is a finitely-generated abelian group. We then extend this reasoning to the hidden cyclic subgroup problem over the reals, showing how to efficiently generate the bits of the period of any sufficiently piecewise-continuous function on R. Finally, we show that this problem of period-finding over R, viewed as an oracle promise problem, is strictly harder than its integral counterpart. In particular, period-finding over R lies outside the complexity class MA, a class which contains period-finding over the integers.