CARVE-Q: Quantum-Proposed, Classically Certified Interactive Driving Repair
Quick Answer
CARVE-Q introduces a quantum-AI search layer for certified interactive driving repairs, significantly reducing query complexity from Θ(M) to O(√M).
Quick Take
CARVE-Q introduces a quantum-AI search layer for certified interactive driving repairs, significantly reducing query complexity from Θ(M) to O(√M). This system ensures lawful maneuver corrections with 100% right-of-way respect and zero priority false positives, enhancing trust in autonomous driving systems.
Key Points
- CARVE constructs a finite repair lattice for vetoed driving maneuvers.
- Quantum minimum finding reduces query complexity for repairs significantly.
- Achieved 100% right-of-way respect and blame consistency in tests.
- Verifier-shielded certificate ensures soundness and responsibility in repairs.
- Demonstrated state-vector minimum finding on up to 65,536 assignments.
Article Content
From source RSS / original summaryarXiv:2606. 06531v1 Announce Type: new Abstract: 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 $\Theta(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.
Reader Mode unavailable (could not extract clean content).
Want this in your inbox every morning?
Daily brief at your local 8am — bilingual EN/中文, free.
More from arXiv cs.AI
See more →The Sim-to-Real Gap of Foundation Model Agents: A Unified MDP Perspective
This paper addresses the sim-to-real gap for foundation model agents by framing it within a Markov Decision Process (MDP) structure. It advocates for established solutions like domain randomization to enhance agent robustness, aiming to create standardized benchmarks for reliable real-world applications.
