Quantum Computing

                    Theory of quantum computation first stated by a famous scientist Feynmann. In his opinion to describe the quantum methodology, classical computer is not sufficient and efficient. Classical computers do calculation in the order of polynomial time. Where as quantum algorithms can reduce this into exponential orders.
                    Quantum computing  is a subject focusing on developing computer technology based on quantum mechanics principles such as superposition, entanglement etc...

Montecarlo Techniques

                     These are the techniques that uses random numbers to describe the physical or mathematical systems. These techniques follows some algorithms.
                      Montecarlo techniques are useful when the system has highest degrees of freedom. In a raw statement one can define that any technique that uses random numbers is known as montecarlo techniques. We have to use suitable computational algorithms to solve these type of problems.

Quantum Dots

A Quantum dot is a quasi - zero dimensional nano - material, which contains a few atoms. Typical dimensions of Quantum Dots are of the order of a few nano meters. Generally speaking a quantum dot is below 100 nm in every dimension. It looks like a very tiny dot and therefore it is called a zero - dimensional system. The motion of electrons is consequently restricted in all three dimensions in a QD and this leads to what are called quantum confinement effects. Quantum Dots have discrete energy levels like in an atom. For this reason a QD is also called as an artificial atom. To understand the properties of Qd, quantum mechanics must be applied.