Randomness in Quantum Computation

Juan Pablo Paz · Science · 2003

In ordinary computers, it is sometimes useful to flip a coin. Non?deterministic algorithms (those programs that involve making such random choices at some steps) can be far more efficient in finding solutions to a variety of problems

Read the paper · More papers on PaperTik