{
  "id": "lmvp13-quantum-provable-original",
  "categoryId": "svp-quantum-provable",
  "paperId": "paper-1873724e57d1",
  "date": "2013-01-25",
  "year": 2013,
  "time": {
    "coefficient": 1.799,
    "expression": "2^{1.799 n + o(n)}"
  },
  "space": {
    "coefficient": 1.286,
    "expression": "2^{1.286 n + o(n)}"
  },
  "tags": [
    "quantum",
    "provable",
    "QCRAM"
  ],
  "review": {
    "status": "source-checked"
  },
  "certificate": {
    "status": "not-provided",
    "lean": null
  },
  "notes": "Original public bound predates the 2015 journal version.",
  "extra": {
    "norm": "Euclidean ℓ₂",
    "success": "Probability exponentially close to 1",
    "model": "Sequential quantum search",
    "qram": "Quantum-addressable classical lists; O(n) ordinary qubits"
  },
  "evidence": {
    "url": "https://arxiv.org/pdf/1301.6176v1",
    "locator": "Theorem 2, p. 10; Section 1.3 memory model",
    "sourceVersion": "arXiv:1301.6176v1, 25 January 2013"
  }
}