metadata.json

{
  "id": "quantum-counting",
  "name": "Quantum Counting",
  "category": "simulation",
  "description": "Count the number of solutions to a 2-qubit oracle (marks |11\u27e9) using QPE applied to Grover's operator.",
  "long_description": "Quantum counting combines Grover's algorithm with QPE to count M solutions in a search space of N items. The Grover operator has eigenphases \u00b12arcsin(\u221a(M/N)), which QPE reads off. For 1 solution in 4 items: phase \u2248 \u03c0/3, count \u2248 1. This circuit uses 3 counting qubits and applies the oracle for |11\u27e9 as a simplified controlled-Grover demonstration.",
  "difficulty": "advanced",
  "qubit_count": 6,
  "clbit_count": 3,
  "gate_count": 18,
  "depth": 12,
  "tags": [
    "counting",
    "grover",
    "qpe",
    "amplitude-estimation"
  ],
  "circuit_formats": [
    "qasm2"
  ],
  "source_file": "circuit.qasm",
  "expected_output": "Counting register encodes phase ~1/6 \u2248 |001\u27e9 (1 solution in 4-item space)",
  "references": [
    {
      "title": "Brassard, H\u00f8yer, Tapp (1998). Quantum Counting. ICALP 1998. LNCS 1443",
      "url": "https://doi.org/10.1007/BFb0055105"
    }
  ],
  "author": "OpenQC Community",
  "license": "MIT",
  "version": "1.0.0"
}