Fabrizio Riguzzi
Fabrizio Riguzzi
@tcNickolas the complexity of quantum counting is O(sqrt(N)), see the Nilsson Cheung book. Thanks for the comments to the pull request, I will implement them
Hi @tcNickolas, I've written this code ``` // Copyright (c) Microsoft Corporation. All rights reserved. // Licensed under the MIT license. ////////////////////////////////////////////////////////////////////// // This file contains reference solutions to all...
I found the problem.
Hi @tcNickolas I've prepared a draft, it's commit d5d5daf87a3e0e83b62cf33bd9c27dccc37e6415 Unfortunately I get values far from the correct answer, can you have a look?
The problem is the number of solutions found is 2^N-n_sol instead of n_sol
Hi, the kata now works but I had to add a global phase ``` R(PauliI, 2.0 * PI(), register[0]); ``` to `GroverIteration`. The kata has now 3 tests with 7...
You can use ProbLog syntax in cplint http://cplint.eu It's a pack http://www.swi-prolog.org/pack/list?p=cplint See http://friguzzi.github.io/cplint/doc/help-cplint.html#problog-syntax
You can use ProbLog syntax, see http://cplint.eu/p/path_problog.pl There is no difference in expressiveness. There are differences in how solutions are found, see the about section of the site for links...
You're right, on another machine it works.
I'm totally confused: if I run ls web/icons before make min, it succeeds the first time. This happens on a single virtual machine, on other virtual machine it doesn't. Maybe...