-
Notifications
You must be signed in to change notification settings - Fork 53
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
refactored ising model and SHA-1 algorithms for easier width flattening
- Loading branch information
Showing
8 changed files
with
427 additions
and
220 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,88 @@ | ||
| const int N = 10; | ||
| const double Bx = 2; | ||
|
|
||
| const double total_T = 3.0; // total duration of adiabatic evolution | ||
| const int M = 5; // number of Trotter steps | ||
|
|
||
| // elements of Bz and J are randomly generated from uniform(-2, 2) | ||
| const double Bz[] = {.3, -.9, -1.2, 1.1, 1.5, .6, -1.6, .3, -1.3, 1.9}; | ||
| const double J[] = {-1.5, 1.3, -1.8, -1.3, -.6, 1.9, 1.1, -1.3, .4}; | ||
|
|
||
| module CZ(qbit q1, qbit q2, double phi) { | ||
| // printf("performing Controlled -2phi Z rotation\n"); | ||
| Rz(q2, -2.0*phi); | ||
| CNOT(q1, q2); | ||
| Rz(q2, phi); | ||
| CNOT(q1, q2); | ||
| } | ||
|
|
||
| module ZcrossZ(qbit q1, qbit q2, double phi) { | ||
| // printf("performing sigma_z cross sigma_z Hamiltonian\n"); | ||
| Rz(q1, phi); | ||
| Rz(q2, -phi); | ||
| CZ(q1, q2, -2.0*phi); | ||
| } | ||
|
|
||
| module initialize(qbit reg[N]) { | ||
| int n; | ||
| for(n=0; n < N; n++) { | ||
| PrepZ(reg[n], 0); | ||
| H(reg[n]); | ||
| } | ||
| } | ||
|
|
||
| module red_hamiltonian(qbit reg[N], int m) { | ||
| int n; | ||
| for (n = 0; n < N-1; n += 2) { // red pairs | ||
| double phi = J[n] * (2.0*m - 1) / M; | ||
| ZcrossZ(reg[n], reg[n + 1], phi); | ||
| } | ||
| } | ||
|
|
||
| module black_hamiltonian(qbit reg[N], int m) { | ||
| int n; | ||
| for (n = 1; n < N-1; n += 2) { // black pairs | ||
| double phi = J[n] * (2.0*m - 1) / M; | ||
| ZcrossZ(reg[n], reg[n + 1], phi); | ||
| } | ||
| } | ||
|
|
||
| module Bz_hamiltonian(qbit reg[N], int m) { | ||
| int n; | ||
| for (n = 0; n < N; n++) { | ||
| double theta1 = (1.0 - (2.0*m-1)/M) * -2 * Bx * total_T / M; | ||
| double theta2 = (1.0 - (2.0*m-1)/M) * -2 * Bz[n] * total_T / M; | ||
| H(reg[n]); | ||
| Rz(reg[n], theta1); | ||
| H(reg[n]); | ||
| Rz(reg[n], theta2); | ||
| } | ||
| } | ||
|
|
||
| module measure(qbit reg[N]) { | ||
| int n; | ||
| for (n = 0; n < N; n++) { | ||
| MeasZ(reg[0]); | ||
| } | ||
| } | ||
|
|
||
| int main() { | ||
| qbit reg[N]; | ||
|
|
||
| // Initialize all qubits to |+> state | ||
| initialize(reg); | ||
|
|
||
| int m; | ||
| for (m=1; m <= M; m++) { | ||
| // Z-Z Hamiltonian, executed in parallel across qbits | ||
| red_hamiltonian(reg, m); | ||
| black_hamiltonian(reg, m); | ||
| // Bz Hamiltonian, executed in parallel across qbits | ||
| Bz_hamiltonian(reg, m); | ||
| } | ||
|
|
||
| // Measure all qubits in Z basis | ||
| measure(reg); | ||
|
|
||
| return 0; | ||
| } |
Large diffs are not rendered by default.
Oops, something went wrong.
Large diffs are not rendered by default.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.
871865bThere was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
871865bThere was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Hi @ajavadia I have interested that how human beings write 20K+ lines Boolean_Formula manually :)