CARVE-Q: Quantum-Proposed, Classically Certified Interactive Driving Repair

• URL: http://arxiv.org/abs/2606.06531v1
• Date: Wed, 03 Jun 2026 17:38:23 GMT
• Title: CARVE-Q: Quantum-Proposed, Classically Certified Interactive Driving Repair
• Abstract summary: CARVE, Certified Affordable Repair of Vetoed maneuvers via Envelopes, is a certificate architecture for prediction-free interactive repair.<n>We introduce CARVE-Q, a verifier-shielded quantum-AI search layer that applies quantum minimum finding only to this black-box lattice.<n>We prove verifier-shielded certificate soundness, priority non-elicitation, black-box query separation, and finite-precision-oracle constructibility.
• Score: 6.016090674751934
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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 $Θ(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.

Related papers

• RecurSE: Bounded Recursive Self-Evaluation for LLM Rubric Judges [48.831446371402414]
  RecurSE pairs a trainable judge with a synchronized policy-copy checker that audits the judge's reasoning against meta-rubrics to supply a scalar process reward.<n>We show that RecurSE achieves consistent generalization gains across held-out medical, pairwise, summarization, and professional benchmarks.
  arXiv  Detail & Related papers  (2026-08-25T08:35:04Z)
• Repair Before Veto, When Repair Is Hidden: Quantum-Accessible Features for Repair-Augmented Constraint Learning [6.016090674751934]
  We introduce Q-RACL (Quantum Repair-Augmented Constraint Learning), a repair-before-veto framework.<n>It accepts a candidate when a sequential repair plan restores feasibility and preference; otherwise it returns structured rejection credit.<n>Across six primes and ten seeds, bounded raw-input classical policies and a wrong raw-Fourier encoding remain near chance.<n>Q-DLP policy keeps false-veto rate below 1.1%, wins all paired seeds, and yields QNI_cond = 0.9777 to 0.9972.
  arXiv  Detail & Related papers  (2026-06-06T07:17:38Z)
• What Can Verifiable Decapsulation Tests Certify? Pass Bounds and Fault-Recognition Limits for FO-Based KEMs [0.0]
  Black-box tests for Fujisaki-Okamoto decapsulation observe the sampled execution seen by the harness.<n>We study confirmation-code-augmented KEM variants under an honest-reference harness.
  arXiv  Detail & Related papers  (2026-06-03T04:46:17Z)
• Repair Before Veto: Repair-Augmented Constraint Learning for Contextual Decisions [6.016090674751934]
  We introduce Repair-Augmented Constraint Learning (RACL), a contextual decision framework that lifts known repair operators into the semantics.<n>A candidate is accepted when an affordable repair makes it feasible and preferred enough; otherwise the system returns a structured rejection credit and, when applicable, a repair plan.<n>Across controlled and DB1B-derived benchmarks, RACL recovers the intended credit and repair structure.
  arXiv  Detail & Related papers  (2026-06-01T14:38:04Z)
• CARVE: Certified Affordable Repair of Vetoed Maneuvers via Envelopes for Interactive Driving [6.016090674751934]
  Interactive driving exposes a failure mode that is easy to miss in rule-aware autonomous-driving stacks.<n>We introduce CARVE, a prediction-free certificate layer over a finite lattice of ego-owned and agent-owned tactical operators.<n>We prove certificate soundness, structural right-of-way respect, exact finite-lattice minimality, fallback contingency, and blame-consistency conditions.
  arXiv  Detail & Related papers  (2026-05-31T12:49:01Z)
• IMPACT-CYCLE: A Contract-Based Multi-Agent System for Claim-Level Supervisory Correction of Long-Video Semantic Memory [73.22944697933603]
  Existing pipelines produce opaque, end-to-end outputs that expose no intermediate state for inspection.<n>We present IMPACT-Cycle, a supervisory multi-agent system that reformulates long-video understanding as a multimodal iterative claim-level maintenance.
  arXiv  Detail & Related papers  (2026-04-22T03:03:33Z)
• To Throw a Stone with Six Birds: On Agents and Agenthood [0.0]
  Six Birds Theory (SBT) treats macroscopic objects as induced closures rather than primitives.<n>We give a type-correct account of agency within SBT.<n>We operationalize this contract in finite controlled systems using four checkable components.
  arXiv  Detail & Related papers  (2026-02-03T10:46:23Z)
• zkCraft: Prompt-Guided LLM as a Zero-Shot Mutation Pattern Oracle for TCCT-Powered ZK Fuzzing [7.274627641804014]
  zkCraft is a framework that combines deterministic, R1CS-aware localization with proof-bearing search to detect semantic inconsistencies.<n>We show that proof-bearing localization detects diverse under- and over-constrained faults with low false positives and reduces costly solver interaction.
  arXiv  Detail & Related papers  (2026-01-31T11:31:00Z)
• Reinforcement Learning with Verifiable yet Noisy Rewards under Imperfect Verifiers [90.50039419576807]
  Reinforcement Learning with Verifiable Rewards (RLVR) trains policies against automated verifiers to avoid costly human labeling.<n>To reduce vulnerability to verifier hacking, many RLVR systems collapse rewards to binary $0,1$ during training.<n>This choice carries a cost: it introduces textitfalse negatives (rejecting correct answers, FNs) and textitfalse positives (accepting incorrect ones, FPs)
  arXiv  Detail & Related papers  (2025-10-01T13:56:44Z)
• COIN: Uncertainty-Guarding Selective Question Answering for Foundation Models with Provable Risk Guarantees [51.5976496056012]
  COIN is an uncertainty-guarding selection framework that calibrates statistically valid thresholds to filter a single generated answer per question.<n>COIN estimates the empirical error rate on a calibration set and applies confidence interval methods to establish a high-probability upper bound on the true error rate.<n>We demonstrate COIN's robustness in risk control, strong test-time power in retaining admissible answers, and predictive efficiency under limited calibration data.
  arXiv  Detail & Related papers  (2025-06-25T07:04:49Z)
• Certifying classes of $d$-outcome measurements with quantum steering [49.1574468325115]
  We provide a construction of a family of steering inequalities tailored to large classes of $d$-outcomes projective measurements. We prove that the maximal quantum violation of those inequalities can be used for certification of those measurements and the maximally entangled state of two qudits.
  arXiv  Detail & Related papers  (2024-10-27T15:32:53Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.