Hidden linear function problem

The hidden linear function problem, is a search problem that generalizes the Bernstein–Vazirani problem. In the Bernstein–Vazirani problem, the hidden function is implicitly specified in an oracle; while in the 2D hidden linear function problem (2D HLF), the hidden function is explicitly specified by a matrix and a binary vector. 2D HLF can be solved exactly by a constant-depth quantum circuit restricted to a 2-dimensional grid of qubits using bounded fan-in gates but can't be solved by any sub-exponential size, constant-depth classical circuit using unbounded fan-in AND, OR, and NOT gates.

While Bernstein–Vazirani's problem was designed to prove an oracle separation between complexity classes BQP and BPP, 2D HLF was designed to prove an explicit separation between the circuit classes $QNC^{0}$ and $NC^{0}$ ( $QNC^{0} \nsubseteq NC^{0}$ ).

2D HLF problem statement

Given $A \in \mathbb{F}_2^{n \times n}$ (an upper- triangular binary matrix of size $n \times n$ ) and $b \in \mathbb{F}_2^n$ (a binary vector of length $n$ ),

define a function $q : \mathbb{F}_2^n \to \mathbb{Z}_4$ :

: $q(x) = (2 x^T A x + b^T x) \bmod 4 = \left(2 \sum_{i,j}A_{i,j} x_i x_j + \sum_i b_i x_i \right) \bmod 4 ,$

and

: $\mathcal{L}_q = \Big\{x \in \mathbb{F}_2^n : q(x \oplus y) = (q(x) + q(y)) \bmod 4 ~~ \forall y \in \mathbb{F}_2^n \Big\}.$

There exists a $z \in \mathbb{F}_2^n$ such that

: $q(x) = 2 z^T x ~~\forall x \in \mathcal{L}_q.$

Find $z$ .

2D HLF algorithm

With 3 registers; the first holding $A$ , the second containing $b$ and the third carrying an $n$ -qubit state, the circuit has controlled gates which implement

$U_q = \prod_{1 < i < j < n} CZ_{ij}^{A_{ij}} \cdot \bigotimes_{j=1}^n S_j^{b_j}$ from the first two registers to the third.

This problem can be solved by a quantum circuit, $H^{\otimes n} U_q H^{\otimes n} \mid 0^n \rangle$ , where H is the Hadamard gate, S is the S gate and CZ is CZ gate. It is solved by this circuit because with $p(z) = \left| \langle z | H^{\otimes n} U_q H ^ {\otimes n} | 0^n \rangle \right|^2$ , $p(z)>0$ iff $z$ is a solution.

References

{{reflist|refs=

{{cite journal |author-last1=Bravyi |author-first1=Sergey |author-last2=Gosset |author-first2=David |author-last3=Robert |author-first3=König |title=Quantum advantage with shallow circuits |arxiv=1704.00690 |journal=Science |volume=362 |issue=6412 |pages=308–311 |date=2018-10-19 |doi=10.1126/science.aar3106|pmid=30337404 |bibcode=2018Sci...362..308B |s2cid=16308940 }}

{{cite book |author-last1=Watts |author-first1=Adam Bene |author-last2=Kothari |author-first2=Robin |author-last3=Schaeffer |author-first3=Luke |author-last4=Tal |author-first4=Avishay |title=Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing |chapter=Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits |arxiv=1906.08890 |publisher=Association for Computing Machinery |volume=362 |pages=515–526 |date=June 2019 |doi=10.1145/3313276.3316404|isbn=9781450367059 |s2cid=195259496 }}

}}

External links

[https://github.com/quantumlib/Cirq/blob/main/docs/experiments/hidden_linear_function.ipynb Implementation of the hidden linear function problem]

Category:Quantum algorithms

Quantum complexity theory

Category:Computational complexity theory