{
  "benchmark_version": "0.1",
  "schema_version": "v0.2",
  "description": "Hand-curated benchmark for the Quantum Advantage Aiwiki bill classifier. Each case maps a (real or representative) proposal text to its expected bills, escape gates, and meta-costs. Drawn from the 650-paper batch 1+2 corpus.",
  "cases": [
    {
      "id": "B1_pan_zhang_tn_rcs",
      "proposal": "We present an improved tensor network contraction strategy that closes the random circuit sampling advantage window of the Sycamore experiment by raising the achievable bond dimension on a single H100 GPU.",
      "expected_bills": [1],
      "expected_gates": [],
      "expected_meta_costs": []
    },
    {
      "id": "B1_tindall_peps",
      "proposal": "Belief-propagation-aided PEPS simulation of 2D quantum dynamics matching IBM Heron utility-scale experiments, closing the advantage claim via tensor-network simulation at moderate bond dimension.",
      "expected_bills": [1],
      "expected_gates": [],
      "expected_meta_costs": []
    },
    {
      "id": "B2_bravyi_gosset_stabilizer",
      "proposal": "Improved upper bound on stabilizer rank for Clifford+T circuits with low T-count, demonstrating classically efficient simulation up to T-count threshold.",
      "expected_bills": [2],
      "expected_gates": [],
      "expected_meta_costs": []
    },
    {
      "id": "B2_begusic_pauli_propagation",
      "proposal": "Pauli propagation library demonstrates classically simulable dynamics for sparse-Pauli regime, matching utility-scale Trotter simulations on superconducting hardware.",
      "expected_bills": [2],
      "expected_gates": [],
      "expected_meta_costs": []
    },
    {
      "id": "B3_aharonov_bouland_approx_sampling",
      "proposal": "Total-variation tractability for low-depth random circuits in the approximate-sampling regime: classical algorithms achieve TV-distance epsilon in polynomial time below depth threshold.",
      "expected_bills": [3],
      "expected_gates": [],
      "expected_meta_costs": []
    },
    {
      "id": "B4_boixo_kalachev_xeb_spoof",
      "proposal": "Linear-XEB scoring is spoofable for shallow random circuits: a classical attack achieves XEB fidelity matching device output without simulating the full distribution.",
      "expected_bills": [4],
      "expected_gates": [],
      "expected_meta_costs": []
    },
    {
      "id": "B4_random_circuit_sampling_close",
      "proposal": "Closing the random circuit sampling advantage via cross-entropy benchmark spoofing techniques applied to Sycamore-class circuits.",
      "expected_bills": [4],
      "expected_gates": [],
      "expected_meta_costs": []
    },
    {
      "id": "B5_aaronson_certified_randomness",
      "proposal": "Certified randomness from quantum supremacy via XEB: a verifiable advantage protocol conditional on classical hardness of XEB sampling.",
      "expected_bills": [5],
      "expected_gates": [],
      "expected_meta_costs": ["M4"]
    },
    {
      "id": "B5_mahadev_proof_of_quantumness",
      "proposal": "Interactive proof-of-quantumness protocol with classical verifier, sound under LWE hardness assumption.",
      "expected_bills": [5],
      "expected_gates": [],
      "expected_meta_costs": ["M4"]
    },
    {
      "id": "B6_willow_below_threshold",
      "proposal": "Below-threshold logical-qubit demonstration: surface-code at distance d=7 achieves Lambda~2.14 logical error suppression on a single logical qubit running idle memory. Logical-vs-physical accounting per code distance.",
      "expected_bills": [6],
      "expected_gates": [],
      "expected_meta_costs": []
    },
    {
      "id": "B6_qLDPC_d12",
      "proposal": "qLDPC code at distance 12 achieves 100+ logical-qubit overhead with magic-state distillation level-1 fidelity 99.99%, demonstrating logical-qubit accounting at fault-tolerant scale.",
      "expected_bills": [6],
      "expected_gates": [],
      "expected_meta_costs": []
    },
    {
      "id": "B7_zne_overhead",
      "proposal": "Zero-noise extrapolation error mitigation overhead scales exponentially with circuit depth: per-depth bill paid by sample complexity.",
      "expected_bills": [7],
      "expected_gates": [],
      "expected_meta_costs": []
    },
    {
      "id": "B7_pec_scaling",
      "proposal": "Probabilistic error cancellation (PEC) sample complexity diverges in the deep-circuit regime — quantum error mitigation does not scale to utility-grade depths.",
      "expected_bills": [7],
      "expected_gates": [],
      "expected_meta_costs": []
    },
    {
      "id": "B8_yilei_chen_lwe_retracted",
      "proposal": "Polynomial-time quantum algorithm for the Learning With Errors problem at NIST-relevant lattice dimensions, attacking Kyber and Falcon. Retracted within 11 days due to a Step-9 Gaussian state preparation bug.",
      "expected_bills": [8],
      "expected_gates": [],
      "expected_meta_costs": []
    },
    {
      "id": "B8_regev_factoring_resource",
      "proposal": "Resource estimate for Regev's improved asymptotic factoring algorithm: requires ~30M logical qubits for RSA-2048, vs Shor's ~20M. Asymptotic improvement does not yield concrete cryptanalytic advantage.",
      "expected_bills": [8],
      "expected_gates": [],
      "expected_meta_costs": ["M3", "M5"]
    },
    {
      "id": "B8_grover_aes",
      "proposal": "Quantum circuit for Grover search applied to AES-256 key recovery, with concrete Toffoli/T-depth/qubit count estimates assuming ideal qubits and unbounded coherence.",
      "expected_bills": [8],
      "expected_gates": [],
      "expected_meta_costs": ["M5"]
    },
    {
      "id": "B8_doriguello_sieving",
      "proposal": "Practical quantum sieving for SVP-400 requires ~10^13 physical qubits and ~10^31 years even under optimistic assumptions: no quantum speedup at NIST-relevant lattice dimensions.",
      "expected_bills": [8],
      "expected_gates": [],
      "expected_meta_costs": ["M5"]
    },
    {
      "id": "B9_qaoa_portfolio",
      "proposal": "Quantum approximate optimization algorithm (QAOA) for portfolio optimization on IBM Heron-156, claiming heuristic quantum advantage over simulated annealing baseline.",
      "expected_bills": [9, 13],
      "expected_gates": [],
      "expected_meta_costs": []
    },
    {
      "id": "B9_qnn_classification",
      "proposal": "Variational quantum neural network achieves classification advantage on classical-data benchmark, outperforming linear baseline on small datasets.",
      "expected_bills": [9],
      "expected_gates": [],
      "expected_meta_costs": []
    },
    {
      "id": "B9_tang_dequant",
      "proposal": "Tang-style classical dequantization of quantum recommendation systems: classical algorithm matches quantum complexity for low-rank matrix recommendation tasks.",
      "expected_bills": [9],
      "expected_gates": [],
      "expected_meta_costs": []
    },
    {
      "id": "B9_cerezo_barren_plateau_simulable",
      "proposal": "Barren-plateau-free variational quantum algorithms are classically simulable: trainability and expressibility together imply classical surrogate exists.",
      "expected_bills": [9],
      "expected_gates": [],
      "expected_meta_costs": []
    },
    {
      "id": "B10_useful_task_gap",
      "proposal": "Critique of quantum advantage demonstrations: advantage is shown only on hardware-designed tasks (RCS, GBS), with no practical-application useful-task gap closed.",
      "expected_bills": [10],
      "expected_gates": [],
      "expected_meta_costs": []
    },
    {
      "id": "B11_quesada_arrazola_gbs_spoof",
      "proposal": "Classical sampler matches Gaussian boson sampling verifier scores without simulating the photonic device, closing the GBS supremacy claim under realistic squeezing and loss.",
      "expected_bills": [11],
      "expected_gates": [],
      "expected_meta_costs": []
    },
    {
      "id": "B11_oh_lim_jiuzhang",
      "proposal": "Spoofing attack on Jiuzhang boson sampling: classical photonic-network sampler achieves same total-variation distance to ideal output without device simulation.",
      "expected_bills": [11],
      "expected_gates": [],
      "expected_meta_costs": []
    },
    {
      "id": "B12_zhao_zlokapa_qml_oracle",
      "proposal": "Exponential quantum advantage on classical-data classification using fewer than 60 logical qubits, with simulated qubits and an unphysical quantum oracle sketching primitive. The construction relies on resource-unbounded oracle access.",
      "expected_bills": [12],
      "expected_gates": [],
      "expected_meta_costs": ["M5"]
    },
    {
      "id": "B13_dwave_supremacy",
      "proposal": "D-Wave annealing supremacy claim on a 1280-qubit lattice problem, with weak classical baseline (simulated annealing without problem-structure-aware heuristic).",
      "expected_bills": [13],
      "expected_gates": [],
      "expected_meta_costs": ["M6"]
    },
    {
      "id": "B13_qaoa_protein_folding_weak_baseline",
      "proposal": "Heuristic quantum advantage on protein folding via QAOA on neutral-atom hardware. Classical baseline is generic Monte Carlo; AlphaFold-class methods absent.",
      "expected_bills": [13],
      "expected_gates": [],
      "expected_meta_costs": []
    },
    {
      "id": "B14_angrisani_observable_estimation",
      "proposal": "Polynomial-precision observable estimation is classically tractable for many circuits where sampling is hard: a Pauli-path-based classical algorithm reframes the question from sampling-hard to estimation-tractable.",
      "expected_bills": [14],
      "expected_gates": [],
      "expected_meta_costs": []
    },
    {
      "id": "B14_pauli_path_heron",
      "proposal": "Pauli propagation classical simulation of IBM Heron utility-scale Trotter dynamics: observable estimation matches the quantum experiment for local low-weight observables.",
      "expected_bills": [14],
      "expected_gates": [],
      "expected_meta_costs": []
    },
    {
      "id": "B14_huang_chen_cotler_preskill",
      "proposal": "Pauli-path simulation in the depolarizing-noise + bounded-depth regime: classical simulation of observable estimation tractable above the noise threshold.",
      "expected_bills": [14],
      "expected_gates": [],
      "expected_meta_costs": []
    },
    {
      "id": "B14_garcia_martin_lie_dequant",
      "proposal": "Lie-algebraic dequantization of variational quantum algorithms: dynamical Lie algebra dimension bounds classical simulation cost, closing observable-estimation territory.",
      "expected_bills": [14],
      "expected_gates": [],
      "expected_meta_costs": []
    },
    {
      "id": "G1_classical_simulation_rebuttal",
      "proposal": "This is a classical-simulation rebuttal of the Sycamore RCS supremacy claim, closing the advantage window via improved tensor network contraction.",
      "expected_bills": [1],
      "expected_gates": ["G1"],
      "expected_meta_costs": []
    },
    {
      "id": "G2_hardware_capability_paper",
      "proposal": "Hardware capability paper: 1180-physical-qubit neutral-atom array with 99.5% gate fidelity. Roadmap to 50 logical qubits by 2026. No advantage claim.",
      "expected_bills": [],
      "expected_gates": ["G2"],
      "expected_meta_costs": []
    },
    {
      "id": "G3_oracle_separation",
      "proposal": "Oracle separation result: BQP/qpoly is strictly larger than BQP/poly under a relativized oracle, with no implementation claim. Query-complexity-only.",
      "expected_bills": [],
      "expected_gates": ["G3"],
      "expected_meta_costs": []
    },
    {
      "id": "M1_rcs_hardware_only",
      "proposal": "Random circuit sampling on a designed-for-hardware Hamiltonian, with no externally-motivated task definition.",
      "expected_bills": [4],
      "expected_gates": [],
      "expected_meta_costs": ["M1"]
    },
    {
      "id": "M2_trust_device",
      "proposal": "Sampling experiment whose output cannot be verified classically; advantage holds only if you trust the device's claim about the output distribution.",
      "expected_bills": [],
      "expected_gates": [],
      "expected_meta_costs": ["M2"]
    },
    {
      "id": "M3_asymptotic_only",
      "proposal": "Asymptotic-only quantum speedup with no concrete crossover point; the speedup is in O() notation in some asymptotic regime.",
      "expected_bills": [],
      "expected_gates": [],
      "expected_meta_costs": ["M3"]
    },
    {
      "id": "M4_lwe_conditional",
      "proposal": "Quantum advantage conditional on LWE hardness assumption: speedup holds under hypothesis-conditional cryptographic assumption.",
      "expected_bills": [],
      "expected_gates": [],
      "expected_meta_costs": ["M4"]
    },
    {
      "id": "M5_resource_unbounded",
      "proposal": "Theoretical quantum advantage assuming ideal qubits with unlimited coherence and unlimited gate fidelity, with no engineering path to realization.",
      "expected_bills": [],
      "expected_gates": [],
      "expected_meta_costs": ["M5"]
    },
    {
      "id": "M6_adiabatic_variant",
      "proposal": "Adiabatic quantum computing advantage on stoquastic Hamiltonian, using a variant model with no obvious extension to gate-model fault-tolerant settings.",
      "expected_bills": [13],
      "expected_gates": [],
      "expected_meta_costs": ["M6"]
    },
    {
      "id": "M7_ibm_quantum_utility",
      "proposal": "IBM quantum utility demonstration on Eagle-127: utility-toward-advantage framing, does not claim advantage. Classical baselines explicitly acknowledged.",
      "expected_bills": [],
      "expected_gates": [],
      "expected_meta_costs": ["M7"]
    },
    {
      "id": "M7_disclaimer",
      "proposal": "Experimental workflows for combinatorial optimization toward quantum advantage. Authors disclaim any advantage claim and frame this as a baseline-establishing utility demonstration.",
      "expected_bills": [],
      "expected_gates": [],
      "expected_meta_costs": ["M7"]
    },
    {
      "id": "dual_dwave_tn_heuristic",
      "proposal": "D-Wave annealing supremacy claim on a 1280-qubit problem rebutted by belief-propagation tensor-network classical simulation. Annealing supremacy + tensor-network closure.",
      "expected_bills": [1, 13],
      "expected_gates": [],
      "expected_meta_costs": ["M6"]
    },
    {
      "id": "dual_qaoa_variational_heuristic",
      "proposal": "QAOA on portfolio optimization claims heuristic advantage with weak Monte Carlo classical baseline; engages variational competitor parity bill simultaneously.",
      "expected_bills": [9, 13],
      "expected_gates": [],
      "expected_meta_costs": []
    },
    {
      "id": "B5_certified_randomness_no_meta",
      "proposal": "Verifiable interactive proof of quantumness: classical verifier confirms quantumness via a cryptographic challenge-response protocol.",
      "expected_bills": [5],
      "expected_gates": [],
      "expected_meta_costs": []
    },
    {
      "id": "B14_schmidhuber_iqp",
      "proposal": "Pauli-path classical simulation of IQP advantage windows, closing observable-estimation territory in the noise-free + structured-low-weight regime.",
      "expected_bills": [14],
      "expected_gates": [],
      "expected_meta_costs": []
    },
    {
      "id": "B8_grover_keccak",
      "proposal": "Resource estimate for Grover search applied to Keccak-256 preimage: requires resource-unbounded quantum hardware to achieve nominal speedup.",
      "expected_bills": [8],
      "expected_gates": [],
      "expected_meta_costs": ["M5"]
    },
    {
      "id": "B11_xanadu_aurora_photonic",
      "proposal": "Xanadu Aurora photonic quantum computer: continuous-variable photonic quantum advantage on Gaussian boson sampling, closed by Drummond CV-photonic rebuttal under realistic squeezing and loss.",
      "expected_bills": [11],
      "expected_gates": [],
      "expected_meta_costs": ["M6"]
    },
    {
      "id": "B6_atom_phoenix_50_logical",
      "proposal": "Atom Computing Phoenix demonstrates 50 logical qubits at 1180 atoms with logical-vs-physical accounting honestly reported. No useful task run on the logical qubits.",
      "expected_bills": [6],
      "expected_gates": [],
      "expected_meta_costs": []
    },
    {
      "id": "B12_atom_phoenix_useful_task",
      "proposal": "Atom Computing Phoenix demonstrates 100 logical qubits running a verifiable molecular ground-state computation, beating density-matrix renormalization-group classical baseline on Fugaku-class hardware.",
      "expected_bills": [12],
      "expected_gates": [],
      "expected_meta_costs": []
    },
    {
      "id": "G1_pauli_path_rebuttal_to_heron",
      "proposal": "This is a classical-simulation rebuttal: Pauli propagation closes the advantage claim of the IBM Heron 156 utility experiment. Observable estimation in the depolarizing-noise regime.",
      "expected_bills": [14],
      "expected_gates": ["G1"],
      "expected_meta_costs": []
    },
    {
      "id": "B8_q1_query_model",
      "proposal": "Quantum query-complexity speedup for symmetric cipher cryptanalysis assuming oracle access in the Q1 quantum-query model with superposition queries.",
      "expected_bills": [8],
      "expected_gates": [],
      "expected_meta_costs": ["M6"]
    },
    {
      "id": "B6_iso_logical_milestone",
      "proposal": "Quantinuum Helios 50-logical-qubit roadmap: logical-vs-physical accounting at the gate-level fidelity threshold, no advantage claim.",
      "expected_bills": [6],
      "expected_gates": ["G2"],
      "expected_meta_costs": []
    }
  ]
}