Write
262
edits
Verification of NP-complete problems: Difference between revisions
→Pseudo Code
| Line 47: | Line 47: | ||
* It has been theorized that N needs to be at least about 500 in order to have the advantage over the best classical protocol. | * It has been theorized that N needs to be at least about 500 in order to have the advantage over the best classical protocol. | ||
== | ==Pseudocode== | ||
<u>'''Stage 1'''</u> State Preparation | <u>'''Stage 1'''</u> State Preparation | ||
# Merlin prepares <math>K=O(\sqrt{N})</math> copies of the state <math>|\psi_x\rangle_k=\frac{1}{\sqrt{N}}\sum_{i=1}^N(-1)^{x_i}|i\rangle</math>. | # Merlin prepares <math>K=O(\sqrt{N})</math> copies of the state <math>|\psi_x\rangle_k=\frac{1}{\sqrt{N}}\sum_{i=1}^N(-1)^{x_i}|i\rangle</math>. | ||