[
  {
    "id": "lmvp13-quantum-minimal-list-space",
    "categoryId": "svp-quantum-minimal-list-space",
    "paperId": "paper-1873724e57d1",
    "date": "2013-01-25",
    "year": 2013,
    "time": {
      "coefficient": 0.312,
      "expression": "2^{0.312 n + o(n)}"
    },
    "space": {
      "coefficient": 0.208,
      "expression": "2^{0.208 n + o(n)}"
    },
    "tags": [
      "quantum",
      "heuristic",
      "Nguyen–Vidick",
      "bounded memory"
    ],
    "review": {
      "status": "source-checked"
    },
    "certificate": {
      "status": "not-provided",
      "lean": null
    },
    "notes": "Baseline quantum pair sieve; .208 is displayed rounding.",
    "extra": {
      "model": "Sequential quantum Nguyen–Vidick sieve",
      "qram": "Quantum-addressable classical lists",
      "qubits": "O(n) ordinary qubits"
    },
    "evidence": {
      "url": "https://arxiv.org/pdf/1301.6176v1",
      "locator": "Theorem 1, p. 7; Section 1.3",
      "sourceVersion": "arXiv:1301.6176v1, 25 January 2013"
    }
  },
  {
    "id": "laarhoven-thesis-angular-minimal-space",
    "categoryId": "svp-quantum-minimal-list-space",
    "paperId": "laarhoven-thesis-2016",
    "date": "2016-02-16",
    "year": 2016,
    "time": {
      "coefficient": 0.286,
      "expression": "2^{0.286 n + o(n)}"
    },
    "space": {
      "coefficient": 0.20751874963942188,
      "expression": "(4/3)^{n/2+o(n)}"
    },
    "tags": [
      "quantum",
      "heuristic",
      "bounded memory",
      "Nguyen–Vidick"
    ],
    "review": {
      "status": "source-checked"
    },
    "certificate": {
      "status": "not-provided",
      "lean": null
    },
    "notes": "Angular-LSH time with baseline list space.",
    "extra": {
      "model": "Nguyen–Vidick; sequential processing of hash tables",
      "qram": "RAM-like quantumly addressable classical memory",
      "qubits": "Quantum search workspace; see Section 14.1"
    },
    "evidence": {
      "url": "https://pure.tue.nl/ws/files/14673128/20160216_Laarhoven.pdf",
      "locator": "Table 14.1; Figure 14.1 caption; Section 14.2.7",
      "sourceVersion": "TU/e thesis public catalogue date 16 February 2016"
    }
  },
  {
    "id": "laarhoven-thesis-hypercone-minimal-space",
    "categoryId": "svp-quantum-minimal-list-space",
    "paperId": "laarhoven-thesis-2016",
    "date": "2016-02-16",
    "year": 2016,
    "time": {
      "coefficient": 0.2671,
      "expression": "2^{0.2671 n + o(n)}"
    },
    "space": {
      "coefficient": 0.20751874963942188,
      "expression": "(4/3)^{n/2+o(n)}"
    },
    "tags": [
      "quantum",
      "heuristic",
      "bounded memory",
      "Nguyen–Vidick"
    ],
    "review": {
      "status": "source-checked"
    },
    "certificate": {
      "status": "not-provided",
      "lean": null
    },
    "notes": "Hypercone-LSH coefficient refined in the thesis; same family as the journal .268 bound.",
    "extra": {
      "model": "Nguyen–Vidick; sequential processing of hash tables",
      "qram": "RAM-like quantumly addressable classical memory",
      "qubits": "Quantum search workspace; see Section 14.1"
    },
    "evidence": {
      "url": "https://pure.tue.nl/ws/files/14673128/20160216_Laarhoven.pdf",
      "locator": "Table 14.1; Figure 14.1 caption; Section 14.2.8",
      "sourceVersion": "TU/e thesis public catalogue date 16 February 2016"
    }
  },
  {
    "id": "laarhoven-thesis-lsf-minimal-space",
    "categoryId": "svp-quantum-minimal-list-space",
    "paperId": "laarhoven-thesis-2016",
    "date": "2016-02-16",
    "year": 2016,
    "time": {
      "coefficient": 0.2652573583493899,
      "expression": "(13/9)^{n/2+o(n)}"
    },
    "space": {
      "coefficient": 0.20751874963942188,
      "expression": "(4/3)^{n/2+o(n)}"
    },
    "tags": [
      "quantum",
      "heuristic",
      "bounded memory",
      "Nguyen–Vidick"
    ],
    "review": {
      "status": "source-checked"
    },
    "certificate": {
      "status": "not-provided",
      "lean": null
    },
    "notes": "Batch variant; the GaussSieve variant has different memory costs.",
    "extra": {
      "model": "Nguyen–Vidick; sequential processing of filter structures",
      "qram": "RAM-like quantumly addressable classical memory",
      "qubits": "Quantum search workspace; see Section 14.1"
    },
    "evidence": {
      "url": "https://pure.tue.nl/ws/files/14673128/20160216_Laarhoven.pdf",
      "locator": "Table 14.1; Figure 14.1 caption; Section 14.2.10",
      "sourceVersion": "TU/e thesis public catalogue date 16 February 2016"
    }
  },
  {
    "id": "laarhoven-thesis-gauss-lsf-bounded-space",
    "categoryId": "svp-quantum-minimal-list-space",
    "paperId": "laarhoven-thesis-2016",
    "date": "2016-02-16",
    "year": 2016,
    "time": {
      "coefficient": 0.2974540118882888,
      "expression": "2^{0.297454 n + o(n)}"
    },
    "space": {
      "coefficient": 0.20751874963942188,
      "expression": "(4/3)^{n/2+o(n)}"
    },
    "tags": [
      "quantum",
      "heuristic",
      "bounded memory",
      "GaussSieve"
    ],
    "review": {
      "status": "source-checked"
    },
    "certificate": {
      "status": "not-provided",
      "lean": null
    },
    "notes": "GaussSieve alternative at unchanged list space.",
    "extra": {
      "model": "GaussSieve; bounded-memory filter parameters",
      "qram": "RAM-like quantumly addressable classical memory",
      "qubits": "Quantum search workspace; see Section 14.1"
    },
    "evidence": {
      "url": "https://pure.tue.nl/ws/files/14673128/20160216_Laarhoven.pdf",
      "locator": "Section 14.2.10, pp. 186–187",
      "sourceVersion": "TU/e thesis public catalogue date 16 February 2016"
    }
  }
]