Quantum Computing Asked by ikiga1 on October 27, 2020
Assuming I have a state
$$|xrangle = frac{1}{sqrt{n}}sum_n |x_nrangle$$
where $|x_nrangle$ are quantum state vectors
$$|x_nrangle = frac{1}{|x_n|}sum_i x_{in}|irangle$$
and that I have a unitary $U:|x_nrangle mapsto e^{2pi itheta_n}|x_nrangle$ such that I can use the phase estimation procedure to get the state
$$|xrangle = frac{1}{sqrt{n}}sum_n |x_nrangle|theta_nrangle$$
Question:
I am wondering whether there is a way to compute the state
$$|xrangle = frac{1}{sqrt{n}}sum_n |x_nrangle|nrangle$$
I was thinking to modify the Phase Estimation Algorithm, but I still find it difficult to understand if I can prepare a unitary $U = sum_n e^{2pi in}|x_nranglelangle x_n|$ for instance.
I am not insterested in ordering the vectors $|x_nrangle$ in any way, I just wonder if there is a way to index them easily.
I don’t know if this problem has been raised before in literature and I don’t know where to look at. I’d be glad if someone had some insights.
The root of the issue here is how do you map between the values $theta_n$ and $n$. A priori there is no way of doing this because the values $n$ are a completely abstract labelling. It wouldn't make any difference if I rearranged all the labels $n$.
So, you have defined the $n$s to be a particular order that you want. Presumably as part of that, you know how to identify, given a $theta_n$, what the value of $n$ is. Whatever mental process that you go through to identify it, you need to translate that into a circuit which you would apply on the ancilla register.
Incidentally, are the coefficients $x_{in}$ known? If so, you should be able to construct a transformation directly rather than having to use phase estimation.
Answered by DaftWullie on October 27, 2020
Get help from others!
Recent Questions
Recent Answers
© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP