用量子搜索加速自动驾驶避让动作的合规修复，确保每一步都可验证。
CARVE-Q: Quantum-Proposed, Classically Certified Interactive Driving Repair
- 构建修复候选集合的层级结构，生成包含责任与规则的可验证证书。
- 在65,536种组合下实现100%右路优先权遵守和零误判。
- 量子算法负责搜索最优修复，经典系统确保安全与责任边界清晰。
在自动驾驶动作被否决后，关键问题不仅是判断其不安全，更在于是否存在合法、可审计且责任可控的修复方案。现有预测与博弈规划虽能提出合作可能，但无法提供修复符合硬性规则、路权分配、成本分摊及主车回退机制的证明。本文提出CARVE（Certified Affordable Repair of Vetoed maneuvers via Envelopes）——一种无需预测的交互式修复证书架构。给定被否决动作，CARVE 构建有限修复格，生成结构化证书，记录绑定规则、联合修复方案、基于路权的协作包络、责任加权成本分配及主车独力回退策略。该证书揭示算法瓶颈：多主体修复导致乘积格 $M = igprod_j |\/mathcal{A}_j|$。为此引入CARVE-Q，一个验证器保护的量子-AI搜索层，仅对这一黑箱格使用量子最小值查找，同时保持所有安全控制权在经典系统。在保守验证器-预言机模型中，经典精确最小值查找需 $Θ(M)$ 查询，而Durr-Hoyer/Grover算法以高概率仅需 $O(\sqrt{M})$ 次查询。本文证明了验证器保护下的证书保真性、优先级不诱导、黑箱查询分离性及有限精度可逆预言机构造性。在车道图基准的INTERACTION回放中，成功实现状态矢量最小值查找至65,536种赋值，并验证了证书保全：100%路权尊重、100%责任一致、零优先级误报。最终形成可信量子-AI模式：量子提方案，CARVE做认证。
原文摘要 · Abstract (English)
The critical question after a correct driving veto is not only whether a maneuver is unsafe, but whether the blocked interaction admits a lawful, auditable, and responsibility-bounded repair. Prediction and game-theoretic planners can suggest plausible cooperation, yet they do not return a proof that the repair respects hard rules, right-of-way, cost allocation, and ego fallback. We introduce CARVE, Certified Affordable Repair of Vetoed maneuvers via Envelopes, a certificate architecture for prediction-free interactive repair. Given a vetoed maneuver, CARVE constructs a finite repair lattice and emits a structured certificate recording the binding rule, selected joint repair, right-of-way-scaled cooperation envelope, responsibility-weighted cost split, and ego-only fallback. This certificate view reveals the algorithmic bottleneck: multi-owner repair induces a product lattice $M = \prod_j |\mathcal{A}_j|$. We therefore introduce CARVE-Q, a verifier-shielded quantum-AI search layer that applies quantum minimum finding only to this black-box lattice while leaving all safety authority classical. In the conservative verifier-oracle model, exact classical minimum finding requires $Θ(M)$ queries in the worst case, whereas Durr-Hoyer/Grover minimum finding uses $O(\sqrt{M})$ oracle queries with high probability. We prove verifier-shielded certificate soundness, priority non-elicitation, black-box query separation, and finite-precision reversible-oracle constructibility. We then demonstrate state-vector minimum finding on CARVE repair oracles up to 65,536 assignments and validate certificate preservation on Lanelet2-grounded INTERACTION replay with 100% right-of-way respect, 100% blame consistency, and zero priority false positives. The result is a trust-bounded quantum-AI pattern for certified autonomy: quantum proposes; CARVE certifies.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。