Explorations in quantum computing. Incl. 1 CD-ROM
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94)
Quantum computing is an exciting, new field that revolutionizes the way in which we think about performing computations. The book by Colin P. Williams and Scott. H. Clearwater gives a summary of results obtained so far in the field of quantum computing. It consists of 11 Chapters in which it touches all aspects of quantum computing without going too much into detail, such as: basic complexity theory (Chapter 2), basic concepts in quantum mechanics (Chapter 3), basic quantum computing models (Chapters 2 and 3) and how to simulate a simple model (Chapter 4), the effect of imperfections on quantum computations (Chapter 5) and how to correct errors (Chapter 10), quantum cryptography (Chapters 6 and 8), quantum teleportation (Chapter 9), and the realization of quantum gates and quantum computers (Chapter 11). The book further contains a CD-ROM with software (written in the Mathematica programming language) that allows users to perform their own quantum computations. This enables a non-specialist in this field to understand what quantum computing is about and how realistic it is. The only drawback of the book is that it is not completely self-contained. Chapter 3 partly requires the reader to have some basic knowledge in quantum physics. Otherwise some aspects might be difficult to understand. ``Explorations in quantum computing is the first book on quantum computing. A short survey of quantum computing can also be found, for instance, in [\textit{A. Berthiaume}, ``Quantum computation, in: L. A. Hemaspaandra et al. (eds.), Complexity theory retrospective II. Proceedings of the 10th annual IEEE conference on Structure in complexity theory. Minneapolis, MN, USA. June 19--22, 1995. New York, NY: Springer. 23--51 (1997; Zbl 0880.68034)].
- On the correlations between quantum entanglement and \(q\)-information measures
- Quantum analog computing
- Entanglement, mixedness, and \(q\)-entropies
- On the entanglement properties of two-rebits systems
- Cyclic groups and quantum logic gates
- Efficient quantum algorithm for the parity problem of a certain function
- On the distribution of entanglement changes produced by unitary operations
- Expressing the operations of quantum computing in multiparticle geometric algebra.
- Uncertainty inequality for the entanglement of both two-rebits and two-qubits states
- Global versus local quantum correlations in the Grover search algorithm
- scientific article; zbMATH DE number 1669134 (Why is no real title available?)
- Quantum correlations in two coupled superconducting charge qubits
- Selected topics in quantum programming theory
- Nonlocality in pure and mixed n-qubit X states
- Revival of Bell nonlocality across a quantum spin chain
- Do multipartite correlations speed up adiabatic quantum computation or quantum annealing?
- Computing the maximum violation of a Bell inequality is an NP-problem
- Quantum Differential Evolution Algorithm for Variable Ordering Problem of Binary Decision Diagram
- Ultimate zero and one. Computing at the quantum frontier
- An FPGA-based quantum circuit emulation framework using heisenberg representation
- Understanding quantum computing. Foundations -- applications -- perspectives
- Locality and classicality: role of entropic inequalities
- Quantum entanglement: spooky action at a distance
- Simplified Quantum Computing with Applications
- How I saw, and how I see fuzzy sets
- Nonlocality dynamics for an eight-qubit model in cavity QEDs
- Entanglement playing a dominating role in quantum games
- Entanglement-based communications
- Quantum computing
- QDENSITY -- a Mathematica quantum computer simulation
- Werner states and the two-spinors Heisenberg anti-ferromagnet
- On the inference of entangled states: a maximum-entropy-minimum-norm approach
This page was built for publication: Explorations in quantum computing. Incl. 1 CD-ROM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4380350)
