Skip to content

Commit

Permalink
Merge pull request #75 from aws-samples/markdown-fixes-11-25
Browse files Browse the repository at this point in the history
Typo fixes
  • Loading branch information
christianbmadsen authored Nov 25, 2022
2 parents 9afedde + f9949f5 commit 4d4b6bf
Show file tree
Hide file tree
Showing 2 changed files with 2 additions and 2 deletions.
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
Grover's algorithm is arguably one of the canonical quantum algorithms that kick-started the field of quantum computing. In the future, it could possibly serve as a hallmark application of quantum computing. Grover's algorithm allows us to find a particular register in an unordered database with Nentries in just O(sqrt(N)) steps, compared to the best classical algorithm taking on average N/2 steps, thereby providing a quadratic speedup. For large databases (with a large number of entries, N), a quadratic speedup can provide a significant advantage. For a database with one million entries, a quantum computer running Grover's algorithm would need about 1000 runs, while a classical computer would need, on average, 500,000 runs.
Grover's algorithm is arguably one of the canonical quantum algorithms that kick-started the field of quantum computing. In the future, it could possibly serve as a hallmark application of quantum computing. Grover's algorithm allows us to find a particular register in an unordered database with N entries in just O(sqrt(N)) steps, compared to the best classical algorithm taking on average N/2 steps, thereby providing a quadratic speedup. For large databases (with a large number of entries, N), a quadratic speedup can provide a significant advantage. For a database with one million entries, a quantum computer running Grover's algorithm would need about 1000 runs, while a classical computer would need, on average, 500,000 runs.

<!--
[metadata-name]: Grover's Search
Expand Down
2 changes: 1 addition & 1 deletion src/braket/experimental/algorithms/shors/shors.md
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
Shor's algorithm is used to find prime factors of an integer. On a quantum computer, Shor's algorithm runs in polynomial time and is almost exponentially faster than the most efficient known classical factoring algorithm.

<!--
[metadata-name]: Shors's Algorithm
[metadata-name]: Shor's Algorithm
[metadata-tags]: Textbook
[metadata-url]: https://github.com/aws-samples/amazon-braket-algorithm-library/blob/main/src/braket/experimental/algorithms/shors
-->

0 comments on commit 4d4b6bf

Please sign in to comment.