• Corpus ID: 14475834

Introduction to Quantum Computation

@article{Chatterjee2003IntroductionTQ,
  title={Introduction to Quantum Computation},
  author={Ashok Chatterjee},
  journal={arXiv: Quantum Physics},
  year={2003}
}
  • A. Chatterjee
  • Published 12 December 2003
  • Physics
  • arXiv: Quantum Physics
This is an introductory review on the basic principles of quantum computation. Various important quantum logic gates and algorithms based on them are introduced. Quantum teleportation and decoherence are discussed briefly. Some problems, without solutions, are included. 
A Study of Quantum Information and Quantum Computers
In this article we will proceed to check of quantum computers structure i.e.qubits in different states by quantum theory principles and then we will express the qubits representation in different
Measurement-only topological quantum computation.
TLDR
By using an anyonic analog of quantum state teleportation, it is shown how the braiding transformations used to generate computational gates may be produced through a series of topological charge measurements.
Semiconductor-Based Quantum Logic Gates
In this chapter we shall review a few potential implementation strategies for the concrete realization of quantum information processing using specifically designed semiconductor nanostructures,
Presentation Entanglemen States and its Application in Quantum Computation
In this article we will consider the entanglement states and we will formulate the density matrix and the expectation value of entanglement state to mathematics and also we will explain the
The structure of qubit and quantum gates in quantum computers
In regard to the important of qubits role and quantum gate in quantum computers, in this article we will consider to the qubit structure and quantum gate on the basis of theory and quantum principles
Effective fault-tolerant quantum computation with slow measurements.
TLDR
It is argued that measurement times as long as even 1000 gate times or more have a very minimal effect on the quantum accuracy threshold, showing that slow measurement poses no essential obstacle to scalability.
On quantum algorithms
TLDR
It is shown how most known quantum algorithms, including quantum algorithms for factorising and counting, may be cast in this manner.
Quantum Artificial Intelligence
This report introduces researchers in AI to some of the concepts in quantum heurisitics and quantum AI.
Fault-tolerant quantum computation for local non-Markovian noise
We derive a threshold result for fault-tolerant quantum computation for local non-Markovian noise models. The role of error amplitude in our analysis is played by the product of the elementary gate
Algorithms for Quantum Computers
This paper surveys the field of quantum computer algorithms. It gives a taste of both the breadth and the depth of the known algorithms for quantum computers, focusing on some of the more recent
...
...

References

SHOWING 1-4 OF 4 REFERENCES
Delightful adventure into the theory of computation and information. Contains Feynman's vision of Quantum Computers
  • Feynman Lectures on Computation
  • 1999
Lectures on Quantum Computation: N. D. Mermin
  • Lectures on Quantum Computation: N. D. Mermin
Lectures on Quantum Computation: John Preskill
  • Lectures on Quantum Computation: John Preskill
Quantum Computation and Quantum Information Comprehensive and readable textbook covering all aspects of Quantum Computation and Quantum Information
  • Quantum Computation and Quantum Information Comprehensive and readable textbook covering all aspects of Quantum Computation and Quantum Information
  • 2000