Skip to content

recover all quantum Tanner codes from 2601.15446 #54

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Draft
Fe-r-oz wants to merge 6 commits into
base: main
Choose a base branch
from
Draft

recover all quantum Tanner codes from 2601.15446 #54

Changes from all commits
Commits
Show all changes
6 commits
Select commit Hold shift + click to select a range
e3ea209
recover all quantum Tanner codes from 2601.15446
Fe-r-oz Feb 9, 2026
be28a96
polish
Fe-r-oz Feb 9, 2026
3d6b585
recover [[72, 19, 4]] from reference
Fe-r-oz Feb 9, 2026
cdc2d55
polish\
Fe-r-oz Feb 10, 2026
135e7b0
Merge branch 'main' into fa/tests
Fe-r-oz Mar 11, 2026
43f228f
refactor test cases for Quantum Tanner codes
Fe-r-oz Mar 11, 2026
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
87 changes: 87 additions & 0 deletions test/test_quantum_tanner_codes.jl
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -746,4 +746,91 @@
c = QuantumTannerCode(G, A, B, classical_code_pair)
@test stab_looks_good(parity_checks(c), remove_redundant_rows=true)
end

@testset "Quantum Tanner codes from https://www.arxiv.org/pdf/2601.15446" begin
# [[72, 19, 4]]
G = dihedral_group(12)
rng = MersenneTwister(7);
A, B = find_random_generating_sets(G, 3, 4, rng=rng)
H_A = Matrix{Int}(parity_matrix(RepCode(3)))
G_A = Matrix{Int}(lift.(dual_code(matrix(ZZ, H_A))))
H_B = Matrix{Int}(parity_matrix(ReedMuller(1,2)))
G_B = Matrix{Int}(lift.(dual_code(matrix(ZZ, H_B))))
classical_code_pair = ((H_A, G_A), (H_B, G_B))
c = QuantumTannerCode(G, A, B, classical_code_pair)
@test stab_looks_good(parity_checks(c), remove_redundant_rows=true)
@test code_n(c) == 72
@test code_k(c) == 19
@test distance(c, DistanceMIPAlgorithm(solver=HiGHS, time_limit=120)) == 4
@test maximum(sum(Matrix(parity_matrix_x(c)), dims=2)) == 8
@test maximum(sum(Matrix(parity_matrix_z(c)), dims=2)) == 6

# [[96, 30, 4]]
G = dihedral_group(12)
rng = MersenneTwister(1);
A, B = find_random_generating_sets(G, 4, 4, rng=rng)
H_A = Matrix{Int}(parity_matrix(RepCode(4)))
G_A = Matrix{Int}(lift.(dual_code(matrix(ZZ, H_A))))
H_B = Matrix{Int}(parity_matrix(ReedMuller(1,2)))
G_B = Matrix{Int}(lift.(dual_code(matrix(ZZ, H_B))))
classical_code_pair = ((H_A, G_A), (H_B, G_B))
c = QuantumTannerCode(G, A, B, classical_code_pair)
@test stab_looks_good(parity_checks(c), remove_redundant_rows=true)
@test code_n(c) == 96
@test code_k(c) == 30
@test distance(c, DistanceMIPAlgorithm(solver=HiGHS, time_limit=120)) == 4
@test maximum(sum(Matrix(parity_matrix_x(c)), dims=2)) == 8
@test maximum(sum(Matrix(parity_matrix_z(c)), dims=2)) == 8

# [[96, 24, 4]]
G = direct_product(cyclic_group(8), cyclic_group(2))
rng = MersenneTwister(15);
A, B = find_random_generating_sets(G, 3, 4, rng=rng)
H_A = Matrix{Int}(parity_matrix(RepCode(3)))
G_A = Matrix{Int}(lift.(dual_code(matrix(ZZ, H_A))))
H_B = Matrix{Int}(parity_matrix(ReedMuller(1,2)))
G_B = Matrix{Int}(lift.(dual_code(matrix(ZZ, H_B))))
classical_code_pair = ((H_A, G_A), (H_B, G_B))
c = QuantumTannerCode(G, A, B, classical_code_pair)
@test stab_looks_good(parity_checks(c), remove_redundant_rows=true)
@test code_n(c) == 96
@test code_k(c) == 24
@test distance(c, DistanceMIPAlgorithm(solver=HiGHS, time_limit=120)) == 4
@test maximum(sum(Matrix(parity_matrix_x(c)), dims=2)) == 8
@test maximum(sum(Matrix(parity_matrix_z(c)), dims=2)) == 6

# [[128, 40, 4]]
G = cyclic_group(16)
rng = MersenneTwister(27);
A, B = find_random_generating_sets(G, 4, 4, rng=rng)
H_A = Matrix{Int}(parity_matrix(RepCode(4)))
G_A = Matrix{Int}(lift.(dual_code(matrix(ZZ, H_A))))
H_B = Matrix{Int}(parity_matrix(ReedMuller(1,2)))
G_B = Matrix{Int}(lift.(dual_code(matrix(ZZ, H_B))))
classical_code_pair = ((H_A, G_A), (H_B, G_B))
c = QuantumTannerCode(G, A, B, classical_code_pair)
@test stab_looks_good(parity_checks(c), remove_redundant_rows=true)
@test code_n(c) == 128
@test code_k(c) == 40
@test distance(c, DistanceMIPAlgorithm(solver=HiGHS, time_limit=120)) == 4
@test maximum(sum(Matrix(parity_matrix_x(c)), dims=2)) == 8
@test maximum(sum(Matrix(parity_matrix_z(c)), dims=2)) == 8

# [[120, 34, 4]]
G = cyclic_group(15)
rng = MersenneTwister(27);
A, B = find_random_generating_sets(G, 4, 4, rng=rng)
H_A = Matrix{Int}(parity_matrix(RepCode(4)))
G_A = Matrix{Int}(lift.(dual_code(matrix(ZZ, H_A))))
H_B = Matrix{Int}(parity_matrix(ReedMuller(1,2)))
G_B = Matrix{Int}(lift.(dual_code(matrix(ZZ, H_B))))
classical_code_pair = ((H_A, G_A), (H_B, G_B))
c = QuantumTannerCode(G, A, B, classical_code_pair)
@test stab_looks_good(parity_checks(c), remove_redundant_rows=true)
@test code_n(c) == 120
@test code_k(c) == 34
@test distance(c, DistanceMIPAlgorithm(solver=HiGHS, time_limit=120)) == 4
@test maximum(sum(Matrix(parity_matrix_x(c)), dims=2)) == 8
@test maximum(sum(Matrix(parity_matrix_z(c)), dims=2)) == 8
end
end
Loading