update QCGAN, new QuGAN

Author: GiggleLiu

Project.toml

@@ -8,6 +8,7 @@ FFTW = "7a1cc6ca-52ef-59f5-83cd-3a7055c09341"
 LinearAlgebra = "37e2e46d-f89d-539d-b4ee-838fcccc9c8e"
 LuxurySparse = "d05aeea4-b7d4-55ac-b691-9e7fabb07ba2"
 SparseArrays = "2f01184e-e22b-5df5-ae63-d93ebab69eaf"
+StatsBase = "2913bbd2-ae8a-5f71-8c99-4fb6c76f3a91"
 Yao = "5a1af4f6-c801-11e8-08ea-1bad16a356b2"
 
 [extras]

docs/make.jl

@@ -42,6 +42,9 @@ makedocs(
     pages = [
         "Home" => "index.md",
         "Tutorial" => TUTORIALS,
+        "Manual" => Any[
+            "man/zoo.md",
+        ],
     ],
     html_prettyurls = !("local" in ARGS),
     html_canonical = "https://quantumbfs.github.io/QuAlgorithmZoo.jl/latest/",

docs/src/index.md

@@ -5,3 +5,21 @@ CurrentModule = QuAlgorithmZoo
 # Quantum Algorithm Zoo
 
 A curated implementation of quantum algorithms with [Yao.jl](https://github.com/QuantumBFS/Yao.jl)
+
+## Tutorial
+```@contents
+Pages = [
+    "tutorial/Grover.md",
+    "tutorial/QCBM.md",
+    "tutorial/QuGAN.md",
+]
+Depth = 1
+```
+
+## Manual
+```@contents
+Pages = [
+    "man/zoo.md",
+]
+Depth = 1
+```

docs/src/man/zoo.md

@@ -0,0 +1,6 @@
+# QuAlgorithmZoo
+
+```@autodocs
+Modules = [QuAlgorithmZoo]
+Order   = [:module, :constant, :type, :macro, :function]
+```

examples/Grover.jl

@@ -1,29 +1,34 @@
+# # Grover Search
 using Yao
-using QuAlgorithmZoo: groveriter!, inference_oracle, prob_match_oracle
+using LinearAlgebra
+using QuAlgorithmZoo: groveriter, inference_oracle, prob_match_oracle
 
+# ## Target Space and Evidense
 num_bit = 12
-oracle(reg::DefaultRegister) = (reg.state[100:101,:]*=-1; reg)
-target_state = zeros(1<<num_bit); target_state[100:101] = sqrt(0.5)
+oracle = matrixgate(Diagonal((v = ones(1<<num_bit); v[100:101]*=-1; v)))
+target_state = zeros(1<<num_bit); target_state[100:101] .= sqrt(0.5)
 
+# now we want to search the subspace with [1,3,5,8,9,11,12] fixed to 1 and [4,6] fixed to 0.
+evidense = [1, 3, -4, 5, -6, 8, 9, 11, 12]
+
+# ## Search
 # then solve the above problem
-it = groveriter!(uniform_state(num_bit), oracle)
+it = groveriter(uniform_state(num_bit), oracle)
 for (i, psi) in enumerate(it)
     overlap = abs(statevec(psi)'*target_state)
     println("step $(i-1), overlap = $overlap")
 end
 
+# ## Inference Example
 # we have a state psi0, we know how to prepair it
 psi = rand_state(num_bit)
 
-# now we want to search the subspace with [1,3,5,8,9,11,12] fixed to 1 and [4,6] fixed to 0.
-evidense = [1, 3, -4, 5, -6, 8, 9, 11, 12]
-
 """
 Doing Inference, psi is the initial state, we want to search target space with specific evidense.
 e.g. evidense [1, -3, 6] means the [1, 3, 6]-th bits take value [1, 0, 1].
 """
 oracle_infer = inference_oracle(evidense)(nqubits(psi))
-it = groveriter!(psi, oracle_infer)
+it = groveriter(psi, oracle_infer)
 for (i, psi) in enumerate(it)
     p_target = prob_match_oracle(psi, oracle_infer)
     println("step $(i-1), overlap^2 = $p_target")