{"query": "Quantum computing", "count": 20, "results": [{"id": "card_instr_quantum_computing", "title": "Quantum computing", "shelf": "codex", "surface": "secular", "snippet": "The Quantum computing verifier (src/concordance/verifiers/quantum_computing.py). Builds on: The Planck scale (ħ). Found from the code's own imports, never invented; the module keeps the logic, this ca", "authority_tier": "engine_derived", "source": "verifier: quantum_computing", "readable": false, "generated": false}, {"id": "card_theory_celestial_mechanics_ephemeris_prediction", "title": "Celestial mechanics / ephemeris prediction", "shelf": "theories", "surface": "secular", "snippet": "Celestial mechanics / ephemeris prediction — an engine domain that can touch it: ephemeris. Calibration: seals — a deterministic verifier can CONFIRM or BREAK checkable claims drawn from it. Computing", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_theory_landauer", "title": "Landauer's principle (erasing information costs heat)", "shelf": "theories", "surface": "secular", "snippet": "Landauer's principle (erasing information costs heat) — an engine domain that can touch it: information_theory. Calibration: seals — the energy bound computes exactly. ERASING one bit must dissipate a", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_theory_dynamical_systems___deterministic_chaos", "title": "Dynamical systems & deterministic chaos", "shelf": "theories", "surface": "secular", "snippet": "Dynamical systems & deterministic chaos — an engine domain that can touch it: mathematics. Calibration: map-only — sensitivity is qualitative; specific trajectories compute. Deterministic rules whose ", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_theory_topological_quantum_computation", "title": "Topological quantum computation (non-Abelian / Fibonacci anyons)", "shelf": "theories", "surface": "secular", "snippet": "Topological quantum computation (non-Abelian / Fibonacci anyons) — an engine domain that can touch it: quantum_computing. Calibration: partial — specific relations verify; the theory as a whole is not", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (lone-domain seeding)", "readable": false, "generated": false}, {"id": "card_theory_quantum_error_correction", "title": "Quantum error correction & the threshold theorem", "shelf": "theories", "surface": "secular", "snippet": "Quantum error correction & the threshold theorem — an engine domain that can touch it: quantum_computing. Calibration: partial — specific relations verify; the theory as a whole is not a sealable comp", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (lone-domain seeding)", "readable": false, "generated": false}, {"id": "card_bridge_master_modular_exponentiation", "title": "Master equation: c = a^k mod n", "shelf": "bridges", "surface": "secular", "snippet": "the one-way power at the root of the discrete world: raising to a power modulo n is cheap, but inverting it — recovering the exponent, or factoring n — is hard on a classical machine and easy on a qua", "authority_tier": "reference", "source": "The Bridges — cross-domain isomorphisms", "readable": false, "generated": false}, {"id": "signpost_daniel_9_seventy_weeks", "title": "Daniel 9:24-27 -- the seventy weeks: the messianic-timeframe prophecy whose ARITHMETIC is sealed (490; 483) and whose date-setting is flagged as speculation", "shelf": "signposts", "surface": "secular", "snippet": "ARITHMETIC (SEALED, HOLDS -- cite 868822b1): 'Seventy weeks (shabua, sevens) are decreed' (Dan 9:24) = 70*7 = 490; 'from the going forth of the word ... unto Messiah the Prince (mashiach nagid, Dan 9:", "authority_tier": "reference", "source": "Signposts among the nations — parts of the story, and the hole Christ filled (Genesis 11; Hebrews 1:1-2; Acts 17)", "readable": false, "generated": false}, {"id": "card_alm_connection_reality_is_mappable", "title": "Almanac: Reality is mappable: the same verified structure recurs across every domain", "shelf": "almanac", "surface": "secular", "snippet": "SITUATION\n  Across this whole moat -- physics, computer science, music, genetics -- the engine kept finding the SAME structures wearing different clothes, and this grand capstone confirms it by drawin", "authority_tier": "reference", "source": "The Almanac — verified-only practical wisdom (sealed)", "readable": false, "generated": false}, {"id": "card_domchk_quantum_computing_claimed_normalized", "title": "Quantum Computing: normalized", "shelf": "quantum_computing", "surface": "secular", "snippet": "A worked check in quantum computing: normalized.\n\nGIVEN\n  amplitudes = [0.6, 0.8]\n  density_eigenvalues = [0.5, 0.5]\n  inner_product = 0.707\n  n_items = 64\n  qber = 0.09\n  qber_threshold = 0.11\n  shor", "authority_tier": "reference", "source": "The verifier's own documented relation, and a run this engine performed against it (deterministic; re-runnable with tools/domain_goldens.py)", "readable": false, "generated": false}, {"id": "card_src_mill_silverman_1988", "title": "J. H. Silverman 1988 — Computing heights on elliptic curves", "shelf": "millennium", "surface": "secular", "snippet": "J. H. Silverman (1988). Computing heights on elliptic curves. Math. Comp. 51 (1988) 339–358. DOI 10.1090/S0025-5718-1988-0942161-4. Canonical: https://doi.org/10.1090/S0025-5718-1988-0942161-4. Free c", "authority_tier": "reference", "source": "J. H. Silverman (1988), Math. Comp. 51 (1988) 339–358", "readable": false, "generated": false}, {"id": "card_bridge_form_logarithmic", "title": "Bridge: the logarithmic form across 18 domains", "shelf": "bridges", "surface": "secular", "snippet": "The canonical form logarithmic (y = k * log(x / x0)) is the SAME computation in 18 different domains — acoustics, astronomy, chemistry, computer_science, cybersecurity, ecology, economics, electrochem", "authority_tier": "reference", "source": "The Bridges — cross-domain isomorphisms", "readable": false, "generated": false}, {"id": "card_works_grover", "title": "How many steps Grover's search needs", "shelf": "the-works", "surface": "secular", "snippet": "To find one item among four with a quantum computer, Grover's algorithm needs just one iteration — ⌊π√N/4⌋ — where a classical search averages 2.5 look-ups.  Worked & sealed by the engine — T = ⌊π√4 /", "authority_tier": "verified", "source": "The Works — worked & sealed", "readable": false, "generated": false}, {"id": "card_spine_domain_quantum_computing", "title": "Quantum Computing — what this engine can check", "shelf": "quantum_computing", "surface": "secular", "snippet": "The quantum computing shelf of the keeping. This engine holds a deterministic verifier for quantum computing: hand it a claim in the QCOMP_VERIFY shape and it returns a verdict, the worked trail, and ", "authority_tier": "reference", "source": "The verifier's own documented relation, and a run this engine performed against it (deterministic; re-runnable with tools/domain_goldens.py)", "readable": false, "generated": false}, {"id": "card_calc_v_quantum_computing_quantum_fidelity", "title": "Quantum fidelity", "shelf": "calculations", "surface": "secular", "snippet": "Quantum fidelity — quantum_computing. Formula: F = |<psi|phi>|^2. Canonical FORM: probability_ratio (P(A|B) = P(A,B)/P(B)) — engine verifier quantum_computing.quantum_fidelity — the deterministic chec", "authority_tier": "reference", "source": "The Calculation Map — every calculation, mapped by form", "readable": false, "generated": false}, {"id": "card_v_c9ef9c121131", "title": "T = ⌊π√4 / 4⌋ = 1 iteration", "shelf": "quantum_computing", "surface": "secular", "snippet": "Verdict: HOLDS.\n• quantum_computing.grover_iterations: N=4 → T = floor(π×2.0000/4) = 1 (matches claim)\nSealed and independently re-checkable: https://narrowhighway.com/s/73aa02ea086929ab1a9610918651ee", "authority_tier": "engine", "source": "Verified by the engine — quantum_computing", "readable": false, "generated": false}, {"id": "card_calc_v_quantum_computing_shor_period", "title": "Shor period", "shelf": "calculations", "surface": "secular", "snippet": "Shor period — quantum_computing. Formula: a^r = 1 (mod N). Canonical FORM: number_theoretic (a^x = 1 (mod m)) — engine verifier quantum_computing.shor_period — the deterministic check the concordance ", "authority_tier": "reference", "source": "The Calculation Map — every calculation, mapped by form", "readable": false, "generated": false}, {"id": "card_calc_v_quantum_computing_grover_iterations", "title": "Grover iterations", "shelf": "calculations", "surface": "secular", "snippet": "Grover iterations — quantum_computing. Formula: T = floor(pi sqrt(N)/4). Canonical FORM: power_law (y = a * x^k) — engine verifier quantum_computing.grover_iterations — the deterministic check the con", "authority_tier": "reference", "source": "The Calculation Map — every calculation, mapped by form", "readable": false, "generated": false}, {"id": "card_calc_v_quantum_computing_qubit_normalization", "title": "Qubit normalization", "shelf": "calculations", "surface": "secular", "snippet": "Qubit normalization — quantum_computing. Formula: sum |amp|^2 = 1. Canonical FORM: conservation (in = out + change_in_store) — engine verifier quantum_computing.qubit_normalization — the deterministic", "authority_tier": "reference", "source": "The Calculation Map — every calculation, mapped by form", "readable": false, "generated": false}, {"id": "card_calc_v_quantum_computing_von_neumann_entropy", "title": "Von neumann entropy", "shelf": "calculations", "surface": "secular", "snippet": "Von neumann entropy — quantum_computing. Formula: S = -sum lambda log2 lambda. Canonical FORM: logarithmic (y = k * log(x / x0)) — engine verifier quantum_computing.von_neumann_entropy — the determini", "authority_tier": "reference", "source": "The Calculation Map — every calculation, mapped by form", "readable": false, "generated": false}], "house": {"door": "FIND", "kind": "cards", "trail": "results", "seal": null, "next_step": {"do": "open the top card", "door": "FIND", "tool": "card_get", "params": {"id": "card_instr_quantum_computing"}}, "ends": "a verdict or a card · the trail · a seal · one next step"}}