An introduction to quantum computing
From MaRDI portal
Abstract: Quantum Computing is a new and exciting field at the intersection of mathematics, computer science and physics. It concerns a utilization of quantum mechanics to improve the efficiency of computation. Here we present a gentle introduction to some of the ideas in quantum computing. The paper begins by motivating the central ideas of quantum mechanics and quantum computation with simple toy models. From there we move on to a formal presentation of the small fraction of (finite dimensional) quantum mechanics that we will need for basic quantum computation. Central notions of quantum architecture (qubits and quantum gates) are described. The paper ends with a presentation of one of the simplest quantum algorithms: Deutsch's algorithm. Our presentation demands neither advanced mathematics nor advanced physics.
Recommendations
Cited in
(20)- Quantum mechanics for quantum computing
- A short survey of quantum computing
- scientific article; zbMATH DE number 5076264 (Why is no real title available?)
- Quantum computing without magic. Devices.
- scientific article; zbMATH DE number 1236366 (Why is no real title available?)
- Introduction to Special Section on Quantum Computation
- scientific article; zbMATH DE number 1975210 (Why is no real title available?)
- From reversible logic gates to universal quantum bases
- Quantum computation: a tutorial
- A First Introduction to Quantum Computing and Information
- scientific article; zbMATH DE number 2115029 (Why is no real title available?)
- An introduction to quantum computing, without the physics
- Concise Guide to Quantum Computing
- scientific article; zbMATH DE number 7150615 (Why is no real title available?)
- An Introduction to Quantum Algorithms: A Physicist’s Perspective
- Mathematical Foundations of Computer Science 2003
- Mathematical etudes on quantum computation
- A Review of Choice Topics in Quantum Computing and Some Connections with Machine Learning
- Direct proof of one-hook scaling property for Alexander polynomial from Reshetikhin-Turaev formalism
- An introduction to many worlds in quantum computation
This page was built for publication: An introduction to quantum computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5246114)