χ_R(∣qubit_T⟩^⊗6) ≥ 4

BK T-type orbit, qubit.

Participate

Run it yourself, or point a coding agent at it.

git clone https://github.com/unitaryfoundation/stabrank
cd stabrank
# describe your decomposition in bounds/mybound.json
make fit BOUND=bounds/mybound.json ARGS=--write
make verify BOUND=bounds/mybound.json

fit solves for the exact coefficients, or tells you no exact combination of your terms reproduces the target. verify rebuilds the identity in exact arithmetic. If it passes, open a pull request adding the file and the leaderboard picks it up on the next build.

A bound the pipeline cannot check is recorded as cited and never takes a record.

← back to the board

Verification

reproduced certificate script asserted: CERTIFIED chi(qubit_T^6) >= 4

Compute

1 run; 0.01 CPU-hours; 0.003 h wall-clock; on the m=5 certificate.

Notes

χ(ψ ⊗ φ) ≥ χ(ψ) when φ has a nonzero computational amplitude, applied to χ(T^5) ≥ 4, whose certificate prints this line as well. Puts the cell at 4 ≤ χ ≤ 6.

Attribution

this repository · stabrank verify_challenge · projection monotonicity applied to the slice-and-lift bound at m=5

Submission

JSON

{
  "schema_version": "0.1",
  "orbit": "qubit_T",
  "m": 6,
  "direction": "lower",
  "rank": 4,
  "certificate": {
    "script": "verify_challenge/cert_qubit_t_m5_lift.py",
    "expect": "CERTIFIED chi(qubit_T^6) >= 4"
  },
  "provenance": {
    "author": "this repository",
    "reference": "stabrank verify_challenge",
    "method": "projection monotonicity applied to the slice-and-lift bound at m=5",
    "date": "2026-09-20",
    "github": [
      "vprusso"
    ],
    "compute": {
      "cpu_hours": 0.01,
      "wall_clock_hours": 0.003,
      "runs": 1,
      "hardware": "the m=5 certificate"
    }
  },
  "notes": "chi(psi (x) phi) >= chi(psi) when phi has a nonzero computational amplitude, applied to chi(T^5) >= 4, whose certificate prints this line as well. Puts the cell at 4 <= chi <= 6."
}