Thanks for detailing. I was explaining in laymen terms, using less technical details, with some reservations ("roughly" and "given some restrictions"). > Orche

Thanks for detailing. I was explaining in laymen terms, using less technical details, with some reservations ("roughly" and "given some restrictions"). > Orchestrate the right kind of interference, and for some problems, you have an algorithm that outputs a solution to that problem with (relatively high probability) in time that, depending on the problem, may be exponentially faster. Exactly. Given some restrictions, it's possible to implement algorithms that are equivalent to performing an exponentially large amount of classical operations per "cycle". > Examples of those problems include prime factorization/discrete logarithms (Shor's algorithm) Indeed. I provide an implementation of the Deutsch–Jozsa algorithm [1][2] based in my own quantum computing simulator that I linked in my blog post (in the original comment) to address this. [1] https://en.wikipedia.org/wiki/Deutsch%E2%80%93Jozsa_algorithm https://en.wikipedia.org/wiki/Deutsch%E2%80%93Jozsa_algorith... [2] https://github.com/TCGV/QuantumSim/blob/master/Tcgv.QuantumSim.UnitTest/Algorithms/DeutschAlgorithmTests.cs https://github.com/TCGV/QuantumSim/blob/master/Tcgv.QuantumS...