# Oracle construction and unitary-synthesis cost audit

Family 283: Polynomial-time unitary synthesis from a Boolean oracle. First application triage, 9 October 2026 Australia/Brisbane.

## Problem and potential new use

Quantum compiler researchers can separate a polynomial query circuit from the cost of supplying a target-dependent Boolean oracle.

## Applicability and commercial boundary

The oracle truth table is unrestricted and its efficient classical construction is not asserted. The diamond-norm tolerance is one half; it is not an arbitrary-precision generic polynomial compiler.

## Initial business decision

Research infrastructure. Buyer budget, commercial novelty and profitability are unvalidated.

## Next verification action

Expose oracle preparation, storage and implementation cost in the existing algorithm feasibility workbench.

## Evidence scope

The catalog statement was individually reviewed. Main-paper abstract passages and available family scope notes were also inspected; paper-level theorem and algorithm details still require deeper review. No independent Lean check was run. Source revision `fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb`. See [source metadata](source.json).

## Main source

[Polynomial-Time Unitary Synthesis from a Boolean Oracle](https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/preprints/Polynomial-Time-Unitary-Synthesis-from-a-Boolean-Oracle-October-5-2026/paper.pdf).