Quantum lower bounds for the set equality problems
| dc.creator | Midrijanis, Gatis | |
| dc.date | 2003-09-08 | |
| dc.date | 2004-05-22 | |
| dc.date.accessioned | 2026-07-07T06:32:15Z | |
| dc.date.available | 2026-07-07T06:32:15Z | |
| dc.description | The set equality problem is to decide whether two sets $A$ and $B$ are equal or disjoint, under the promise that one of these is the case. Some other problems, like the Graph Isomorphism problem, is solvable by reduction to the set quality problem. It was an open problem to find any $w(1)$ query lower bound when sets $A$ and $B$ are given by quantum oracles with functions $a$ and $b$. We will prove $Ω(\frac{n^{1/3}}{\log^{1/3} n})$ lower bound for the set equality problem when the set of the preimages are very small for every element in $A$ and $B$. | |
| dc.description | 7 pages, improved presentation | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0309068 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0309068 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/98844 | |
| dc.subject | Quantum Physics | |
| dc.title | Quantum lower bounds for the set equality problems | |
| dc.type | text |