Hidden linear function problem

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 biased threshold gates.[2][3] While Bernstein–Vazirani's problem was designed to prove an oracle separation between complexity classesBQP and BPP, 2D HLF was designed to prove an explicit separation between the circuit classes QNC0{\displaystyle QNC^{0}} and NC0{\displaystyle NC^{0}} (QNC0NC0{\displaystyle QNC^{0}\nsubseteq NC^{0}}).[1]

2D HLF problem statement

Given AF2n×n{\displaystyle A\in \mathbb {F} _{2}^{n\times n}}(an upper- triangularbinary matrix of size n×n{\displaystyle n\times n}) and bF2n{\displaystyle b\in \mathbb {F} _{2}^{n}} (a binary vector of length n{\displaystyle n}),

define a function q:F2nZ4{\displaystyle q:\mathbb {F} _{2}^{n}\to \mathbb {Z} _{4}}:

q(x)=(2xTAx+bTx)mod4=(2i,jAi,jxixj+ibixi)mod4,{\displaystyle q(x)=(2x^{T}Ax+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

Lq={xF2n:q(xy)=(q(x)+q(y))mod4  yF2n}.{\displaystyle {\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 zF2n{\displaystyle z\in \mathbb {F} _{2}^{n}} such that

q(x)=2zTx  xLq.{\displaystyle q(x)=2z^{T}x~~\forall x\in {\mathcal {L}}_{q}.}

Find z{\displaystyle z}.[1]

2D HLF algorithm

With 3 registers; the first holding A{\displaystyle A}, the second containing b{\displaystyle b} and the third carrying an n{\displaystyle n}-qubit state, the circuit has controlled gates which implement Uq=1<i<j<nCZijAijj=1nSjbj{\displaystyle 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, HnUqHn0n{\displaystyle 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)=|z|HnUqHn|0n|2{\displaystyle p(z)=\left|\langle z|H^{\otimes n}U_{q}H^{\otimes n}|0^{n}\rangle \right|^{2}}, p(z)>0{\displaystyle p(z)>0} iff z{\displaystyle z} is a solution.[1]

References

  1. 1234Bravyi, Sergey; Gosset, David; Robert, König (2018-10-19). "Quantum advantage with shallow circuits". Science. 362 (6412): 308–311. arXiv:1704.00690. Bibcode:2018Sci...362..308B. doi:10.1126/science.aar3106. PMID 30337404. S2CID 16308940.
  2. واتس، آدم بيني؛ كوثاري، روبن؛ شيفر، لوك؛ تال، أفيشاي (23-06-2019). "الفصل الأسي بين الدوائر الكمومية الضحلة والدوائر الكلاسيكية الضحلة ذات عدد المدخلات غير المحدود" . ACM: 515–526 . arXiv : 1906.08890 . doi : 10.1145/3313276.3316404 . ISBN 978-1-4503-6705-9.{{cite journal}}يتطلب الاستشهاد بالمجلة ( مساعدة )|journal=
  3. دي أوليفيرا، مايكل؛ سوبرامانيان، ساتياواجسوار؛ مينديز، لياندرو؛ هسيه، مين-هسيو (15 أبريل 2025). "ميزة مطلقة لدوائر الكم ذات الـ qudit الضوضائية على دوائر العتبة المتحيزة في عمق ثابت" . نيتشر كوميونيكيشنز . 16 (1): 3559. doi : 10.1038/ s41467-025-58545-4 . ISSN 2041-1723 . PMC 12000609. PMID 40234377 .