-
Notifications
You must be signed in to change notification settings - Fork 0
QEC: implement magic-state-consuming logical T and CCZ operations #283
Copy link
Copy link
Closed
Labels
backendGeneral backend / compilation pipeline (not NA- or IBM-specific)General backend / compilation pipeline (not NA- or IBM-specific)compilerFrontend / MLIR passes, type system, language semanticsFrontend / MLIR passes, type system, language semanticsenhancementNew feature or requestNew feature or requestready-for-agentFully specified, ready for an AFK agentFully specified, ready for an AFK agentresearchResearch or design exploration, not a straight implementation ticketResearch or design exploration, not a straight implementation ticket
Description
Metadata
Metadata
Assignees
Labels
backendGeneral backend / compilation pipeline (not NA- or IBM-specific)General backend / compilation pipeline (not NA- or IBM-specific)compilerFrontend / MLIR passes, type system, language semanticsFrontend / MLIR passes, type system, language semanticsenhancementNew feature or requestNew feature or requestready-for-agentFully specified, ready for an AFK agentFully specified, ready for an AFK agentresearchResearch or design exploration, not a straight implementation ticketResearch or design exploration, not a straight implementation ticket
What to build
Add a scoped logical non-Clifford path for QEC-backed programs by modeling magic-state-consuming logical T/Tdag and CCZ operations in the first slice.
This should be implemented as compiler-visible operations with explicit resource accounting and QEC experiment metadata. It does not need to implement a full distillation factory in the first slice, but it must make magic-state consumption explicit rather than hiding non-Clifford behavior as generic gates.
Acceptance criteria
Blocked by
None - can start immediately.