Difference between revisions of "JQ Manual"
(→2nd text input - qubit signature) |
|||
| Line 5: | Line 5: | ||
= Quick Overview = | = Quick Overview = | ||
| − | For quick start, please note 3 | + | For quick start, please note 3 inputs. We we will name the 1st, 2nd and 3rd -- from left to right. |
Please also note 2 buttons: Run and Load. | Please also note 2 buttons: Run and Load. | ||
| − | === 1st | + | === 1st input - init state === |
[[File:1st.png]] | [[File:1st.png]] | ||
You enter init state of qubits here. Decimal integer is required here. Its binary representation defines start states of qubits. **Qubit 0 is on the top**. | You enter init state of qubits here. Decimal integer is required here. Its binary representation defines start states of qubits. **Qubit 0 is on the top**. | ||
| − | === 2nd | + | === 2nd input - qubit signature === |
[[File:2nd.png]] | [[File:2nd.png]] | ||
You enter list of integers here in the following format: [qubit1, qubit2, ..., qubitn]. This bit signature is used for displaying probabilities. | You enter list of integers here in the following format: [qubit1, qubit2, ..., qubitn]. This bit signature is used for displaying probabilities. | ||
| Line 26: | Line 26: | ||
Formally, this is a list of integers with given probability. The n-th bit of chosen integer (from right) represents the state of n-th quibit in qubit signature (from left) after hypothetical measurment. Note that you have these integer in binary and in decimal in (). | Formally, this is a list of integers with given probability. The n-th bit of chosen integer (from right) represents the state of n-th quibit in qubit signature (from left) after hypothetical measurment. Note that you have these integer in binary and in decimal in (). | ||
| + | |||
| + | ===3rd input - quantum circuit=== | ||
| + | [[File:3rd.png]] | ||
| + | |||
| + | You enter a list of quantum gates here in the following format [gate1, gate2, ..., gaten]. You can also add measurments to this list, they are represented by M(.). | ||
Revision as of 13:49, 20 May 2013
Contents |
Quick Overview
For quick start, please note 3 inputs. We we will name the 1st, 2nd and 3rd -- from left to right. Please also note 2 buttons: Run and Load.
1st input - init state
You enter init state of qubits here. Decimal integer is required here. Its binary representation defines start states of qubits. **Qubit 0 is on the top**.
2nd input - qubit signature
You enter list of integers here in the following format: [qubit1, qubit2, ..., qubitn]. This bit signature is used for displaying probabilities.
Assume you entered there [3,4] and assume that list of probabilies is like the following:
01 : 0.3 (1) 10 : 0.7 (2)
It simply means that a lot of hypothetical measurements would show that Prob(qubit 4 is in state 0 AND qubit 3 is in state 1) = 0.3 and Prob(qubit 4 is in state 1 AND qubit 3 is in state 0) = 0.7.
Formally, this is a list of integers with given probability. The n-th bit of chosen integer (from right) represents the state of n-th quibit in qubit signature (from left) after hypothetical measurment. Note that you have these integer in binary and in decimal in ().
3rd input - quantum circuit
You enter a list of quantum gates here in the following format [gate1, gate2, ..., gaten]. You can also add measurments to this list, they are represented by M(.).
