Update QuantumClifford requirement from 0.9.4, 0.10 to 0.9.4, 0.10, 0.11

[dependabot]

Updates the requirements on QuantumClifford to permit the latest version.

Release notes

Sourced from QuantumClifford's releases.

v0.11.0

QuantumClifford v0.11.0

Diff since v0.10.1

• Drop support for Julia <1.12.
• Implementation of the specialized simulation algorithms for graph states (faster for large sparse tableaux).
• (breaking) moving all graph state functionality to a submodule GraphSim.
• (fix) canonicalize_gott! now properly supports non-UInt64 types.
• MixedDestabilizer now has a backtrack keyword argument that makes it possible to undo the canonicalization step and recover destabilizers for specific stabilizer operators.
• ptrace for partial traces. We already had traceout!, which returns tableaux with the same number of qubits. ptrace removes the traceout qubits besides setting their stabilizing operators to I.
• Add apply_right! that applies a Clifford operator to the right of a dense clifford operator.
• Implementing apply_inv! for direct application of the inverse of a given gate.
• Add mul_right! methods for inplace operations between tableaus
• Add a CliffordOperator constructor that builds a dense clifford from a PauliOperator
• Add a phases getter for CliffordOperator
• A new non-Clifford operation was added as a Pauli channel, the rotation gate pcRx.
• Adapt.jl can now be used to convert various types to GPU-backed storage.
• The phase storage type can now be parameterized, instead of hardcoded to UInt8.
• Add an extension to QECCore -- QECCoreNemoExt for accurate matrix rank computation
• Introduce metacheck_matrix_x, metacheck_matrix_z, and metacheck_matrix for CSS codes built using chain complexes and homology.
• Quantum codes (including (breaking) changes to API): _ Improvements to decoders: - TableDecoder now supports arbitrary error weights and a new CSSTableDecoder is available that separate decodes the x and z syndromes of CSS codes. - Google's tesseract decoder is available through PyTesseractDecoder.jl
  • The lifted product code constructor LPCode now supports non-commutative group algebras by appropriate switching left/right representations — particularly useful now that there is also an Oscar.jl extension, which provides many non-abelian group constructors.
  • Add BivariateBicycleViaPoly, implemented using multivariate quotient ring formalism
  • In a Hecke extension for QuantumClifford.ECC:
    • Add GeneralizedBicycle and ExtendedGeneralizedBicycle
    • Add GeneralizedHyperGraphProduct
    • Add [[2n², 2k², d]] and [[(n - k)² + n², k², d]] La-cross codes via univariate polynomial ring
    • Add convenience wrappers for code families honeycomb_color_codes_as_2bga and Haah_cubic_codes_as_2bga
  • In an Oscar extension for QuantumClifford.ECC:
    • Add TrivariateTricycle
    • Add GeneralizedToric on twisted tori in terms of Laurent polynomials
    • Add HomologicalProduct and DoubleHomologicalProduct
    • Add D-dimensional Surface and Toric codes through chain complexes and GF2 homology
  • In QECCore:
    • Add cyclic quantum Tanner graph product codes
    • Add [[n² + m²,(n - rank([C ∣ M]))² + (m − rank([C ∣ M]ᵀ))², d]] quantum Tillich-Zémor random_TillichZemor_code
    • Add Delfosse-Reichardt codes from classical self-orthogonal Reed-Muller seed codes
    • Add [[4p, 2(p − 2), 4]] Delfosse-Reichardt repetition DelfosseReichardtRep
    • Add [[8p, 4p − 2, 3]] Delfosse-Reichardt Generalized [[8,2,3]] DelfosseReichardt823
    • In an Oscar extension for QECCore
      • Add BivariateBicycleViaCirculantMat
• Classical codes (including (breaking) changes to API):
  • In QECCore:
    • Add classical Goppa
    • Add classical Gallager's LDPC code
• (breaking) Some codes are moved to QECCore from QuantumClifford, including Hamming, Golay, Triangular488 , Triangular666 , Gottesman, ReedMuller, RecursiveReedMuller, and QuantumReedMuller.

... (truncated)

Changelog

Sourced from QuantumClifford's changelog.

v0.11.0 - 2026-01-01

• Drop support for Julia <1.12.
• Implementation of the specialized simulation algorithms for graph states (faster for large sparse tableaux).
• (breaking) moving all graph state functionality to a submodule GraphSim.
• (fix) canonicalize_gott! now properly supports non-UInt64 types.
• MixedDestabilizer now has a backtrack keyword argument that makes it possible to undo the canonicalization step and recover destabilizers for specific stabilizer operators.
• ptrace for partial traces. We already had traceout!, which returns tableaux with the same number of qubits. ptrace removes the traceout qubits besides setting their stabilizing operators to I.
• Add apply_right! that applies a Clifford operator to the right of a dense clifford operator.
• Implementing apply_inv! for direct application of the inverse of a given gate.
• Add mul_right! methods for inplace operations between tableaus
• Add a CliffordOperator constructor that builds a dense clifford from a PauliOperator
• Add a phases getter for CliffordOperator
• A new non-Clifford operation was added as a Pauli channel, the rotation gate pcRx.
• Adapt.jl can now be used to convert various types to GPU-backed storage.
• The phase storage type can now be parameterized, instead of hardcoded to UInt8.
• Add an extension to QECCore -- QECCoreNemoExt for accurate matrix rank computation
• Introduce metacheck_matrix_x, metacheck_matrix_z, and metacheck_matrix for CSS codes built using chain complexes and homology.
• Quantum codes (including (breaking) changes to API): _ Improvements to decoders: - TableDecoder now supports arbitrary error weights and a new CSSTableDecoder is available that separate decodes the x and z syndromes of CSS codes. - Google's tesseract decoder is available through PyTesseractDecoder.jl
  • The lifted product code constructor LPCode now supports non-commutative group algebras by appropriate switching left/right representations — particularly useful now that there is also an Oscar.jl extension, which provides many non-abelian group constructors.
  • Add BivariateBicycleViaPoly, implemented using multivariate quotient ring formalism
  • In a Hecke extension for QuantumClifford.ECC:
    • Add GeneralizedBicycle and ExtendedGeneralizedBicycle
    • Add GeneralizedHyperGraphProduct
    • Add [[2n², 2k², d]] and [[(n - k)² + n², k², d]] La-cross codes via univariate polynomial ring
    • Add convenience wrappers for code families honeycomb_color_codes_as_2bga and Haah_cubic_codes_as_2bga
  • In an Oscar extension for QuantumClifford.ECC:
    • Add TrivariateTricycle
    • Add GeneralizedToric on twisted tori in terms of Laurent polynomials
    • Add HomologicalProduct and DoubleHomologicalProduct
    • Add D-dimensional Surface and Toric codes through chain complexes and GF2 homology
  • In QECCore:
    • Add cyclic quantum Tanner graph product codes
    • Add [[n² + m²,(n - rank([C ∣ M]))² + (m − rank([C ∣ M]ᵀ))², d]] quantum Tillich-Zémor random_TillichZemor_code
    • Add Delfosse-Reichardt codes from classical self-orthogonal Reed-Muller seed codes
    • Add [[4p, 2(p − 2), 4]] Delfosse-Reichardt repetition DelfosseReichardtRep
    • Add [[8p, 4p − 2, 3]] Delfosse-Reichardt Generalized [[8,2,3]] DelfosseReichardt823
    • In an Oscar extension for QECCore
      • Add BivariateBicycleViaCirculantMat
• Classical codes (including (breaking) changes to API):
  • In QECCore:
    • Add classical Goppa
    • Add classical Gallager's LDPC code
• (breaking) Some codes are moved to QECCore from QuantumClifford, including Hamming, Golay, Triangular488 , Triangular666 , Gottesman, ReedMuller, RecursiveReedMuller, and QuantumReedMuller.
• (breaking) Some codes (types or functions) are slightly renamed for consistency.

Private API

... (truncated)

Commits

• See full diff in compare view

Dependabot will resolve any conflicts with this PR as long as you don't alter it yourself. You can also trigger a rebase manually by commenting @dependabot rebase.

---

Dependabot commands and options

You can trigger Dependabot actions by commenting on this PR:

• @dependabot rebase will rebase this PR
• @dependabot recreate will recreate this PR, overwriting any edits that have been made to it
• @dependabot merge will merge this PR after your CI passes on it
• @dependabot squash and merge will squash and merge this PR after your CI passes on it
• @dependabot cancel merge will cancel a previously requested merge and block automerging
• @dependabot reopen will reopen this PR if it is closed
• @dependabot close will close this PR and stop Dependabot recreating it. You can achieve the same result by closing it manually
• @dependabot show <dependency name> ignore conditions will show all of the ignore conditions of the specified dependency
• @dependabot ignore this major version will close this PR and stop Dependabot creating any more for this major version (unless you reopen the PR or upgrade to it yourself)
• @dependabot ignore this minor version will close this PR and stop Dependabot creating any more for this minor version (unless you reopen the PR or upgrade to it yourself)
• @dependabot ignore this dependency will close this PR and stop Dependabot creating any more for this dependency (unless you reopen the PR or upgrade to it yourself)

[codecov]

Codecov Report

✅ All modified and coverable lines are covered by tests.
✅ Project coverage is 67.76%. Comparing base (d1444ff) to head (5242fbc).
⚠️ Report is 1 commits behind head on main.

Additional details and impacted files

@@            Coverage Diff             @@
##             main     #160      +/-   ##
==========================================
+ Coverage   67.69%   67.76%   +0.07%     
==========================================
  Files          20       20              
  Lines         941      940       -1     
==========================================
  Hits          637      637              
+ Misses        304      303       -1     

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

🚀 New features to boost your workflow:

• ❄️ Test Analytics: Detect flaky tests, report on failures, and find test suite problems.