Score:2

Regev's proof of quantumly approximating $\sum_{x \in L}\sqrt{{\rho_{r}(x)}}|x\rangle$

gf flag

In Regev's paper(the right link now) in Lemma 3.12, can someone explain to me how we get from Eq. (15) to the next one?

(1) We can only have a superposition of finitely many states, how can we manage to store $x\mod\mathcal{P}(L)$? Isn't this set uncountably large?

(2) Afterwards we measure that register and get a $y \in \mathcal{P}(L)$. Also, after the measurement we obtain $$\sum_{x \in L+y}^{}{\rho_{\sqrt{2}r}(x)|x\rangle}$$ which understand, but I don't see how we can get there from

$$\sum_{x \in \mathbb{Z}^n}^{}{\rho_{\sqrt{2}r}(x)|x\rangle} \ \ \ \ \ \text{(15)}$$ because $L+y$ is not contained in $\mathbb{Z}^n$

Daniel S avatar
ru flag
I think that you've linked the wrong paper. The link goes to a set of lecture notes by de Wolf
kerf avatar
gf flag
@DanielS You are right.. the names of their pdfs are so similar.
Score:3
us flag

(1) I think saying $x\mod\mathcal{P}(L)$ isn't quite right, we should probably say $x\mod L$. Since $L$ is an additive subgroup of $\mathbb{R}^n$, we can take the quotient group $\mathbb{R}^n/L$, and this quotient is basically $\mathcal{P}(L)$ (with some extra structure). So you're right that this has uncountably many points; however, $x\mod \mathcal{P}(L)$ (or really, $x\mod L$) is just a single point in $\mathcal{P}(L)$, so we don't need a superposition over the full set $\mathcal{P}(L)$.

Instead, given some fixed $y\in\mathcal{P}(L)$, we want a superposition over all $x\in \mathbb{Z}^n$ such that $x\equiv y\mod L$. This set is countable (in fact, it's equal to $L+y$), which is still infinite but, as Regev argues, we can get close enough to this superposition since everything is weighted by the discrete Gaussian $\rho_{\sqrt{2}r}$.

(2) Consider that we can take any vector $x$ and compute two vectors $v\in L$ and $y\in \mathcal{P}(L)$ such that $v+y=x$. This is an easy task if we do not care about the length of $y$; one way is to just find a set of coefficients to express $x$ as a linear combination of some basis of $L$, then just round the coefficients to the nearest integer. That linear combination gives $v$, the difference gives $y$. No matter how we do this we know that $x\equiv y\mod L$, since $v\in L$.

This can be done out-of-place, so suppose that we let $x\mod L$ be the vector in $\mathcal{P}(L)$ that we obtain from such a procedure called on $x$. Then we map

$$ \sum_{x\in\mathbb{Z}^n}\rho_{\sqrt{2}r}(x)\vert x\rangle\mapsto \sum_{x\in\mathbb{Z}^n}\rho_{\sqrt{2}r}(x)\vert x\rangle\vert x\mod L\rangle$$

If we measure the second register, we get some value $y\in\mathcal{P}(L)$, and we collapse the state onto only those $x$ such that $x\equiv y\mod L$. However, as argued above, that's precisely equal to the set $L+y$. Hence, the remaining state is

$$ \sum_{x\in\mathbb{Z}^n:x\equiv y\mod L}\rho_{\sqrt{2}r}(x)\vert x\rangle = \sum_{x\in L+y}\rho_{\sqrt{2}r}(x)\vert x\rangle$$

Notice that there are only certain values in $\mathcal{P}(L)$ that we could measure, since we will only measure $y$ such that $y\equiv x\mod L$ for some $x$ in our original superposition. Since $x\in\mathbb{Z}^n$ for all states in the original superposition, we know that $y+L\subseteq \mathbb{Z}^n$, since those are the only values of $y$ we could possibly measure.

Don Freecs avatar
sz flag
you are right, $\mathcal{P}(L)$ is a set of representatives of the quotient $\mathbb{R}^n /L$ and the modulo is indeed $L$.
kerf avatar
gf flag
I see my mistake now. Thank you, that was very clear :)
kerf avatar
gf flag
Can I ask you a second thing? Because the latter part of the proof seems to me some problems as well. I'm wondering what this l2-distance of the two quantum states exactly is. The proof doesn't add up to me, but maybe I have an wrong metric in mind for the distance of the register
Sam Jaques avatar
us flag
Probably best to create another question (that's the usual recommendation, and also I'm not sure what you're asking)
mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.