The discussion revolves around the process of selecting a relevant solution during quantum computation, particularly in the context of algorithms like Shor's for factorizing large numbers. Participants explore how superposition and measurement play roles in this selection process.
Participants express differing views on the clarity and simplicity of the selection process in quantum computing, with some agreeing on the role of measurement while others seek further clarification on practical implementation.
There are unresolved questions regarding the practical implementation of measurement in quantum algorithms and the conditions under which the correct result is verified.
Individuals interested in quantum computing, particularly those exploring the mechanics of quantum algorithms and the implications of superposition and measurement.
The quantum computer doesn't select the desired result. In the final stage of the algorithm, there is a measurement performed, and that measurement has a high probability of giving the correct answer, but the result has to be checked to make sure the right one was obtained.jeremyfiennes said:I looked at it, but could not find an answer. As I understand it: when factorizing a large number, for instance, a normal computer takes pairs of numbers, multiplies them, and if the result is not the desired one, tries another pair. And so on, working sequentially.
Whereas a quantum computer generates simultaneously a superposition state of all possible products of all possible numbers, and then selects the desired one. My question is: how is this done in practice?