Skip to content

Model/ori roth classiq/update qmods #858

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
OriRothClassiq wants to merge 2 commits into from
Closed

Model/ori roth classiq/update qmods #858

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
4c5c096
Update Qmod files
OriRothClassiq Mar 6, 2025
dca1239
Remove symbolic recursion
OriRothClassiq Mar 10, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
16 changes: 6 additions & 10 deletions algorithms/dqi/dqi_max_xorsat.ipynb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -305,21 +305,17 @@
" )\n",
"\n",
"\n",
"@qfunc\n",
"@qfunc(generative=True)\n",
"def prepare_dick_state_unary_input(max_k: CInt, qvar: QArray[QBit]):\n",
" \"\"\"\n",
" assumes the input is encoded in qvar in unary encoding. should work for every value\n",
" smaller than max_k\n",
" \"\"\"\n",
" if_(\n",
" qvar.len > 1,\n",
" lambda: [\n",
" _dicke_split_cycle_shift(max_k, qvar),\n",
" prepare_dick_state_unary_input(\n",
" qmin(max_k, qvar.len - 2), qvar[1 : qvar.len]\n",
" ),\n",
" ],\n",
" )\n",
" if qvar.len > 1:\n",
" _dicke_split_cycle_shift(max_k, qvar)\n",
" prepare_dick_state_unary_input(\n",
" qmin(max_k, qvar.len - 2), qvar[1 : qvar.len]\n",
" )\n",
"\n",
"\n",
"@qfunc\n",
Expand Down
34 changes: 7 additions & 27 deletions algorithms/qml/qsvm_pauli_feature_map/qsvm_pauli_feature_map.qmod
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,47 +1,27 @@
qfunc pauli_kernel_expanded___0(qba: qbit[2]) {
qfunc pauli_kernel_expanded___0(data: real[2], qba: qbit[2]) {
power (2) {
hadamard_transform(qba);
suzuki_trotter([
PauliTerm {
pauli=[3, 0],
coefficient=data1_param_0
coefficient=data[0]
},
PauliTerm {
pauli=[0, 3],
coefficient=data1_param_1
coefficient=data[1]
},
PauliTerm {
pauli=[3, 3],
coefficient=(data1_param_0 - 3.1416) * (data1_param_1 - 3.1416)
coefficient=(data[0] - 3.1416) * (data[1] - 3.1416)
}
], -1, 1, 1, qba);
}
}

qfunc pauli_kernel_expanded___1(qba: qbit[2]) {
power (2) {
hadamard_transform(qba);
suzuki_trotter([
PauliTerm {
pauli=[3, 0],
coefficient=data2_param_0
},
PauliTerm {
pauli=[0, 3],
coefficient=data2_param_1
},
PauliTerm {
pauli=[3, 3],
coefficient=(data2_param_0 - 3.1416) * (data2_param_1 - 3.1416)
}
], -1, 1, 1, qba);
}
}

qfunc main(output qba: qnum<2, False, 0>) {
qfunc main(data1: real[2], data2: real[2], output qba: qnum<2, False, 0>) {
allocate(2, qba);
pauli_kernel_expanded___0(qba);
pauli_kernel_expanded___0(data1, qba);
invert {
pauli_kernel_expanded___1(qba);
pauli_kernel_expanded___0(data2, qba);
}
}
52 changes: 10 additions & 42 deletions applications/finance/credit_card_fraud/credit_card_fraud.qmod
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,71 +1,39 @@
qfunc pauli_kernel_expanded___0(qba: qbit[3]) {
qfunc pauli_kernel_expanded___0(data: real[3], qba: qbit[3]) {
power (2) {
hadamard_transform(qba);
suzuki_trotter([
PauliTerm {
pauli=[3, 0, 0],
coefficient=data1_param_0
coefficient=data[0]
},
PauliTerm {
pauli=[0, 3, 0],
coefficient=data1_param_1
coefficient=data[1]
},
PauliTerm {
pauli=[0, 0, 3],
coefficient=data1_param_2
coefficient=data[2]
},
PauliTerm {
pauli=[3, 3, 0],
coefficient=(data1_param_0 - 3.1416) * (data1_param_1 - 3.1416)
coefficient=(data[0] - 3.1416) * (data[1] - 3.1416)
},
PauliTerm {
pauli=[3, 0, 3],
coefficient=(data1_param_0 - 3.1416) * (data1_param_2 - 3.1416)
coefficient=(data[0] - 3.1416) * (data[2] - 3.1416)
},
PauliTerm {
pauli=[0, 3, 3],
coefficient=(data1_param_1 - 3.1416) * (data1_param_2 - 3.1416)
coefficient=(data[1] - 3.1416) * (data[2] - 3.1416)
}
], -1, 1, 1, qba);
}
}

qfunc pauli_kernel_expanded___1(qba: qbit[3]) {
power (2) {
hadamard_transform(qba);
suzuki_trotter([
PauliTerm {
pauli=[3, 0, 0],
coefficient=data2_param_0
},
PauliTerm {
pauli=[0, 3, 0],
coefficient=data2_param_1
},
PauliTerm {
pauli=[0, 0, 3],
coefficient=data2_param_2
},
PauliTerm {
pauli=[3, 3, 0],
coefficient=(data2_param_0 - 3.1416) * (data2_param_1 - 3.1416)
},
PauliTerm {
pauli=[3, 0, 3],
coefficient=(data2_param_0 - 3.1416) * (data2_param_2 - 3.1416)
},
PauliTerm {
pauli=[0, 3, 3],
coefficient=(data2_param_1 - 3.1416) * (data2_param_2 - 3.1416)
}
], -1, 1, 1, qba);
}
}

qfunc main(output qba: qnum<3, False, 0>) {
qfunc main(data1: real[3], data2: real[3], output qba: qnum<3, False, 0>) {
allocate(3, qba);
pauli_kernel_expanded___0(qba);
pauli_kernel_expanded___0(data1, qba);
invert {
pauli_kernel_expanded___1(qba);
pauli_kernel_expanded___0(data2, qba);
}
}