Skip to content

Commit

Permalink
Fixed link to Deutsch's algorithm implementation.
Browse files Browse the repository at this point in the history
  • Loading branch information
ntwalibas committed Nov 13, 2018
1 parent 56a1416 commit a552177
Showing 1 changed file with 1 addition and 1 deletion.
2 changes: 1 addition & 1 deletion source/algorithms/deutsch.rst
Original file line number Diff line number Diff line change
Expand Up @@ -88,7 +88,7 @@ the problem. Two calls to the oracle are necessary (we can't make a decision wit
and sufficient (we learn nothing new by a third call).

Here is the classical code that solves Deutsch's problem.
You can find it in the ``algorithms`` sections of the language repository at `Classical and quantum algorithms in Avalon <https://github.com/avalon-lang/algorithms/>`.
You can find it in the ``deutsch`` folder in the algorithm repository at `Classical and quantum algorithms in Avalon <https://github.com/avalon-lang/algorithms/tree/master/deutsch/>`_.

.. code::
Expand Down

0 comments on commit a552177

Please sign in to comment.