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.