3. Concrete Costs

Problem 3.1.
[Greg Kuperberg] Given: $x_0,\dots, x_{2^n1} \in \{0,1\}$. What is the realworld cost of $$  i_1, \dots, i_{n1}, a \rangle \mapsto  i_1, \dots, i_{n1}, a\oplus x_i \rangle $$ where $i = i_0 + 2i_1 + \dots + 2^{n1}i_{n1}$.
Can error correction be done efficiently for this problem? 
Problem 3.5.
[Shi Bai] What are the concrete costs of quantum sieving and quantum enumeration within BKZ? Go beyond asymptotics.
Cite this as: AimPL: Quantum algorithms for analysis of publickey crypto, available at http://aimpl.org/quantumalg.