Hidden linear function problem

From HandWiki

The hidden linear function problem, is a search problem that generalizes the Bernstein–Vazirani problem.[1] 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.[2] 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 QNC0 and NC0 (QNC0NC0).[1]

2D HLF problem statement

Given A𝔽2n×n(an upper-triangular binary matrix of size n×n) and b𝔽2n (a binary vector of length n),

define a function q:𝔽2n4:

q(x)=(2xTAx+bTx)mod4=(2i,jAi,jxixj+ibixi)mod4,

and

q={x𝔽2n:q(xy)=(q(x)+q(y))mod4y𝔽2n}.

There exists a z𝔽2n such that

q(x)=2zTxxq.

Find z.[1]

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 Uq=1<i<j<nCZijAijj=1nSjbj from the first two registers to the third.

This problem can be solved by a quantum circuit, HnUqHn0n, 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)=|z|HnUqHn|0n|2, p(z)>0 iff z is a solution.[1]

References

  1. 1.0 1.1 1.2 1.3 "Quantum advantage with shallow circuits". Science 362 (6412): 308–311. 2018-10-19. doi:10.1126/science.aar3106. PMID 30337404. Bibcode2018Sci...362..308B. 
  2. "Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits". Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. 362. Association for Computing Machinery. June 2019. pp. 515–526. doi:10.1145/3313276.3316404. ISBN 9781450367059.