The Pros And Cons Of Quantum Computing

Classical computing has been operating using a binary system measured in bits. These bits can have only two states, zero and one. These states are used to represent, store and process data. The binary architecture has been used in computers since Konrad Zues built the first programmable computer in 1941(CITATION). As computers have become more advanced so has the complexity and magnitude of the problems that they can solve. With the current rate of advancement defined by Moore's law transistors will be as small as an atom. In order to keep up with the technological demands of processing information a new system of computing would need to be developed. In 1981 a physicist working in the field of quantum mechanics realized that classical computing could not efficiently simulate quantum mechanical systems. The scientist was Richard Feynmen and he proposed the
Because of the limitations of quantum algorithm, quantum computing would need to use a universal classical language in order to interpret the individual instructions for a quantum computer (orange). This means that a quantum program would not be run on a quantum computer alone. It would be ran on a probabilistic classical computer that controlled the quantum computer. The classical computer would hold the program state where the quantum computer would act as an oracle, reporting the results to the classical computer. The quantum computer would work independently of the control logic so that “its computational state can therefore be fully described by the common quantum state ¥ of its qubits”, producing the machine state (orange). The classical computer then process the results given by the quantum computer. The quantum program uses classical inputs and produces classical outputs. For this to be possible the program will have to utilize algorithms that have pre- and post-processing