|
Moving back to the subject, quantum computing is not a solution to all computing problems. QC is only practical to a particular type of computing problem where numerous possibilities (permutations) exist simultaneously during the computing process. Breaking encryption is a possible example of where QC can be so productive. QC works by storing and manipulating a large amount of data with few particles. But when the computation is done, only one answer can be read. For example, any problem with two or more valid answers cannot be solved efficiently. Problems that don't work well in quantum computing include trying to optimize the packing of odd sized boxes in a trunk or finding a solution to visting every island connected by bridges only once. These problems are called "nondeterministic polynomial time".
Quantum computers are not a magic solution to all computing as so many assume. QC is a solution to limited problems that involve permutations.
|