-
Notifications
You must be signed in to change notification settings - Fork 181
/
sudoku_2x2.cpp
76 lines (63 loc) · 2.35 KB
/
sudoku_2x2.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
/*******************************************************************************
* Copyright (c) 2022 - 2024 NVIDIA Corporation & Affiliates. *
* All rights reserved. *
* *
* This source code and the accompanying materials are made available under *
* the terms of the Apache License 2.0 which accompanies this distribution. *
******************************************************************************/
// REQUIRES: c++20
// clang-format off
// RUN: nvq++ --target anyon --emulate %s -o %t && %t | FileCheck %s
// RUN: nvq++ --target ionq --emulate %s -o %t && %t | FileCheck %s
// RUN: nvq++ --target iqm --iqm-machine Apollo --emulate %s -o %t && %t | FileCheck %s
// RUN: nvq++ --target oqc --emulate %s -o %t && %t | FileCheck %s
// RUN: nvq++ --target quantinuum --emulate %s -o %t && %t | FileCheck %s
// clang-format on
#include <cudaq.h>
#include <algorithm>
#include <iostream>
#include <unordered_set>
__qpu__ void reflect_uniform(cudaq::qvector<> &qubits) {
h(qubits);
x(qubits);
z<cudaq::ctrl>(qubits[0], qubits[1], qubits[2], qubits[3]);
x(qubits);
h(qubits);
}
__qpu__ void oracle(cudaq::qvector<> &cs, cudaq::qubit &target) {
x<cudaq::ctrl>(cs[0], !cs[1], !cs[2], cs[3], target);
x<cudaq::ctrl>(!cs[0], cs[1], cs[2], !cs[3], target);
}
__qpu__ void grover() {
cudaq::qvector qubits(4);
cudaq::qubit ancilla;
// Initialization
x(ancilla);
h(ancilla);
h(qubits); // uniform initialization
oracle(qubits, ancilla);
reflect_uniform(qubits);
oracle(qubits, ancilla);
reflect_uniform(qubits);
mz(qubits);
};
int main() {
auto result = cudaq::sample(1000, grover);
#ifndef SYNTAX_CHECK
std::vector<std::string> strings;
for (auto &&[bits, count] : result) {
strings.push_back(bits);
}
std::sort(strings.begin(), strings.end(), [&](auto& a, auto& b) {
return result.count(a) > result.count(b);
});
std::cout << strings[0] << '\n';
std::cout << strings[1] << '\n';
std::unordered_set<std::string> most_probable{strings[0], strings[1]};
assert(most_probable.count("1001") == 1);
assert(most_probable.count("0110") == 1);
#endif
return 0;
}
// CHECK-DAG: 1001
// CHECK-DAG: 0110