Quantum Algorithms and Implementations
{"Image DocumentName": "Quantum Algorithms and Implementations", "Image ImageDescription": "In 1992, David Deutsch and Richard Jozsa coauthored Rapid solution of problems by quantum computation . They presented an algorithm that determines whether a function f is constant over all inputs or balanced. The Deutsch-Jozsa algorithm was the first quantum algorithm to run faster than its classical counterparts. L. Chuang et al. detailed how they used bulk nuclear magnetic resonance techniques to implement a simplifed version of the Deutsch-Jozsa algorithm. In Quantum complexity theory , Bernstein and Vazirani were the first to identify a problem that can be solved in polynomial time by a quantum algorithm but requires superpolynomial time classically. Daniel R. Simon introduced a problem that a quantum algorithm can solve exponentially faster than any known classical algorithm. Richard Jozsa. Meysam Madani - An Introduction to Quantum Computing Cryptography and Information.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}