Quantum computation and quantum information

@inproceedings{Nielsen2000QuantumCA,
  title={Quantum computation and quantum information},
  author={Michael A. Nielsen and Isaac L. Chuang},
  year={2000}
}
Preface Acknowledgement Nomenclature and notation Part I. Fundamental Concepts: 1. Introduction and overview 2. Introduction to quantum mechanics 3. Introduction to computer science Part II. Quantum Computation: 4. Quantum circuits 5. The quantum Fourier transform and its applications 6. Quantum search algorithms 7. Quantum computers: physical realisation Part III. Quantum Information: 8. Quantum noise, open quantum systems, and quantum operations 9. Distance measurement for quantum information… 
Introduction to Quantum Information, Quantum Computation, and Its Application to Cryptography
  • D. Guan
  • Physics, Computer Science
  • 2008
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
Quantum Information Theory and Quantum Information Processing Fundamentals
  • I. Djordjevic
  • Physics
    Physical-Layer Security and Quantum Key Distribution
  • 2019
In this chapter, we provide the basic concepts of quantum information processing, quantum information theory, and quantum error correction. The following topics from quantum information processing
A Rosetta Stone for Quantum Mechanics with an Introduction to Quantum Computation
The purpose of these lecture notes is to provide readers, who have some mathematical background but little or no exposure to quantum mechanics and quantum computation, with enough material to begin
Cryptography from quantum uncertainty in the presence of quantum side information
TLDR
A new four-round protocol for message authentication from a weak key that is secure in two security models simultaneously is proposed and a new entropic uncertainty relation is presented and furthermore the task of password-based identification is considered.
Classical and Quantum Information Theory: An Introduction for the Telecom Scientist
TLDR
This paper presents a meta-anatomy of quantum information theory, focusing on the role of entropy in the development of knowledge theory and its applications in medicine, science and engineering.
A Very Brief Introduction to Quantum Computing and Quantum Information Theory for Mathematicians
TLDR
This is a very brief introduction to quantum computing and quantum information theory, primarily aimed at geometers, especially connections with asymptotic representation theory.
Quantum computation and a universal quantum computer.
TLDR
The core and primary focus of this thesis is the theoretical construction of a machine that can compute every computable function, that is, a universal (i.e.programmable) quantum computer.
Digital-analog quantum algorithm for the quantum Fourier transform
TLDR
It is shown that, under reasonable assumptions about noise models, the fidelity of the quantum Fourier transformation improves considerably using this approach, suggesting that, in the Noisy Intermediate-Scale Quantum (NISQ) era, hybrid protocols combining digital and analog quantum computing could be a sensible approach to reach useful quantum supremacy.
Foundations of quantum theory and quantum information applications
This thesis establishes a number of connections between foundational issues in quantum theory, and some quantum information applications. It starts with a review of quantum contextuality and
...
...

References

SHOWING 1-10 OF 326 REFERENCES
Quantum computations: algorithms and error correction
TLDR
This book discusses classical models of computations, quantum formalism, symplecto-classical cases, and error correction in the computation process: general principles.
Classical computing, quantum computing, and Shor's factoring algorithm
TLDR
This is an expository talk written for the Bourbaki Seminar on the structure of the classical deterministic computations and relates Kolmogorov's complexity to the spectral properties of computable function.
Quantum algorithms: entanglement–enhanced information processing
  • A. Ekert, R. Jozsa
  • Computer Science, Physics
    Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
  • 1998
TLDR
The fundamental role of entanglement as the essential nonclassical feature providing the computational speedup in the known quantum algorithms is discussed and the use of the Fourier transform in extracting periodicities is outlined, which underlies its utility in theknown quantum algorithms.
Implementation of a Quantum Algorithm to Solve Deutsch ’ s Problem on a Nuclear Magnetic Resonance Quantum Computer
TLDR
This work demonstrates the use of an NMR quantum computer based on the pyrimidine base cytosine, and the implementation of a quantum algorithm to solve Deutsch’s problem (distinguishing between constant and balanced functions).
Experimental realization of a quantum algorithm
Quantum computers can in principle exploit quantum-mechanical effects to perform computations (such as factoring large numbers or searching an unsorted database) more rapidly than classical
Quantum Information Theory
In this thesis I present a short review of ideas in quantum information theory. The first chapter contains introductory material, sketching the central ideas of probability and information theory.
Quantum complexity theory
TLDR
This dissertation proves that relative to an oracle chosen uniformly at random, the class NP cannot be solved on a quantum Turing machine in time $o(2\sp{n/2}).$ and gives evidence suggesting that quantum Turing Machines cannot efficiently solve all of NP.
Two-bit gates are universal for quantum computation.
  • DiVincenzo
  • Physics
    Physical review. A, Atomic, molecular, and optical physics
  • 1995
A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are sufficient to construct a general quantum circuit. The
Quantum Computability
TLDR
It is shown that when quantum Turing machines are restricted to have transition amplitudes which are algebraic numbers, BQP, EQP, and nondeterministic quantum polynomial time (NQP) are all contained in PP, hence in P and PSPACE.
Reversible arithmetic coding for quantum data compression
TLDR
A simple-to-implement quantum algorithm for projecting, with high probability, the block quantum state onto the typical subspace spanned by the lending eigenstates of its density matrix is presented.
...
...