Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions research/clifford-unknown-support-decoder/.gitattributes
Original file line number Diff line number Diff line change
@@ -0,0 +1 @@
tables/*.json -text
17 changes: 17 additions & 0 deletions research/clifford-unknown-support-decoder/CREDITS.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,17 @@
# Sources and credit

Ali Romman (@aliromman) prepared the new reconstruction algorithm, support certificates, two-register example, implementation and campaign synthesis with substantial OpenAI Codex assistance. New material is Apache-2.0. Separate Codex reviewers attacked the cut and phase arguments, implemented independent character, Pauli and dense-minor computations and tested the executable. Their checks do not constitute independent human review or formal proof-kernel acceptance.

## Mathematical and data dependencies

- Nick Petalas (@petalas) supplied the four-qubit quotient calculation and CTblLib projection in PR 7747. The 7,054-byte projection here is byte-exact. His proof credits alephnan for the odd-sector reduction, Ali Romman for the pointwise framework, and his own earlier lower bound. The published ordinary table is credited to the ATLAS and Thomas Breuer's CTblLib 1.3.11. [PR 7747](https://github.com/CrocSwap/integer-mult-bounds/pull/7747) · [Projection](https://github.com/petalas/integer-mult-bounds/blob/ff12ca358d601a21cd4b1f016b8a3a969ac44016/research/clifford-four-qubit-width-nine/PROJECTION.json) · [Source proof and notice](https://github.com/petalas/integer-mult-bounds/blob/ff12ca358d601a21cd4b1f016b8a3a969ac44016/research/clifford-four-qubit-width-nine/README.md)
- alephnan (@alephnan) developed the Pauli central-character and projective Gram framework in PR 6714. Its predecessor record preserves Ali Romman's pointwise definition, MatShep's small-qubit results and the Lee–Yu–Peng–Lai table. This package uses the four-qubit implications identified by the credited successors. [PR 6714](https://github.com/CrocSwap/integer-mult-bounds/pull/6714) · [Proof](https://github.com/alephnan/integer-mult-bounds/blob/f7f32a18dde54e67624a9ed9cc7e1b266d9585c0/research/clifford-three-qubit-threshold/PROOF.md)
- Ali Romman supplied the full width-13 threshold and width-11 decomposition, the complete width-12 projector and its four-row 10,561-byte projection, and the exact width-13 conditioning. The new work derives restricted-support and fibre guarantees from these results. It does not originate the tables or the predecessor thresholds. [PR 7766](https://github.com/CrocSwap/integer-mult-bounds/pull/7766) · [Odd-width proof](https://github.com/aliromman/integer-mult-bounds/blob/d7c2dd1868c70f0addce2c0a4d3220149452f14b/research/clifford-four-qubit-threshold/PROOF.md) · [PR 7770](https://github.com/CrocSwap/integer-mult-bounds/pull/7770) · [Even-width proof](https://github.com/aliromman/integer-mult-bounds/blob/ff9bdc0e82e75ab5ed39f3ff034ac8ddb3ea06d2/research/clifford-width-twelve-nullity/PROOF.md) · [Four character rows](https://github.com/aliromman/integer-mult-bounds/blob/ff9bdc0e82e75ab5ed39f3ff034ac8ddb3ea06d2/research/clifford-width-twelve-nullity/CHARACTER-COLUMNS.json) · [PR 7772](https://github.com/CrocSwap/integer-mult-bounds/pull/7772)
- The column recovery-norm comparison uses the full-spectrum bound and its odd and Bell-sector refinements. The odd-division obstruction concerns the canonical inverse. This algorithm has an exact Gaussian-rational arithmetic contract. [Odd spectrum](https://github.com/CrocSwap/integer-mult-bounds/pull/7788) · [Bell-sector spectrum](https://github.com/CrocSwap/integer-mult-bounds/pull/7789) · [Canonical divisor obstruction](https://github.com/CrocSwap/integer-mult-bounds/pull/7792)
- S. E. Leurgans, R. T. Ross and R. B. Abel proved three-way uniqueness with two independent factors and projectively distinct third factors. Ivan Oseledets developed tensor-train representations. Jeroen Dehaene and Bart De Moor gave binary and quadratic descriptions of Clifford operations and stabilizer states. These form the classical background. The new cut procedure exploits the finite phase ratios, exact Clifford test, restricted kernels and full residual on a supplied train. [Three-way decomposition](https://epubs.siam.org/doi/10.1137/0614071) · [Tensor-train decomposition](https://epubs.siam.org/doi/10.1137/090752286) · [Clifford normal forms](https://arxiv.org/abs/quant-ph/0304125)

## Distinct pending constructions

apoursh (@apoursh) supplied a sharp Gaussian-dyadic Bell decoder, 4,265 reads on a named four-qubit fibre, a compact identity-row contraction, the 256-output identity-fibre implementation, canonical denominator results, and a 51/52-pass Gram schedule. The chart contraction credits Ali Romman's earlier circuit evaluators. These constructions motivate the access-model comparison. Their row implementation, operator schedule and denominator computations are not dependencies of the new executable. [Sharp Bell width](https://github.com/CrocSwap/integer-mult-bounds/pull/7799) · [Compiled row](https://github.com/CrocSwap/integer-mult-bounds/pull/7800) · [Compact chart](https://github.com/CrocSwap/integer-mult-bounds/pull/7801) · [Optimal norm and denominator](https://github.com/CrocSwap/integer-mult-bounds/pull/7802) · [Canonical inverse denominator](https://github.com/CrocSwap/integer-mult-bounds/pull/7805) · [Gram schedules](https://github.com/CrocSwap/integer-mult-bounds/pull/7809) · [Compact full identity fibre](https://github.com/CrocSwap/integer-mult-bounds/pull/7813)

Clear1nsight (@Clear1nsight) supplied the pending P104 rational and binary construction used for the complete-cost comparison. The cooperative receiver-cut classification belongs to apoursh. Each row in the campaign inventory links its original scientific source and contributor evidence. [P104 application](https://github.com/CrocSwap/integer-mult-bounds/pull/7786) · [Cooperative cut](https://github.com/CrocSwap/integer-mult-bounds/pull/7808) · [Campaign index](https://github.com/CrocSwap/integer-mult-bounds/discussions/7794)
Loading
Loading