12 problems
- 0 votes0 replies1 view
Linear-kernel dimension conjecture for HGP codes based on LPS graphs
Fix , and let be large enough that the parameters defined by … where is chosen so that . Let be the Tanner-code parity-chec…
- 0 votes0 replies0 views
Balanced triples attaining finite-degree GV
Let be any balanced triple satisfying … The corresponding HA-side and MN-side classical constituent codes are the codes associated with this triple, and a balanced tr…
- 0 votes0 replies0 views
The QTS isomorphism conjecture on qubit separation
QTS isomorphism conjecture. The isomorphic nature of the two disjoint subsets results in a set of qubits at level of for every , which limits the qubit sep…
- 0 votes0 replies1 view
Bravyi's conjecture on higher homological products with good distance
Bravyi's conjecture. Higher products of CSS codes with good distance should exist.
- 0 votes0 replies0 views
Interconnected 6-cycle correction conjecture for dv-3, dc-6 QLDPC codes
A -, - QLDPC code is a quantum low-density parity-check code with variable-node degree and check-node degree . An interconnected 6-cycle structure is a struc…
- 0 votes0 replies0 views
Girth-10 performance conjecture for the B3 code
The code is a quantum LDPC code whose one circulant matrix is composed of juxtaposed -cycles and whose other circulant matrix has girth . Girth-10 performance conjectur…
- 0 votes0 replies0 views
Universal (6,0) trapping-set conjecture for dv-3, dc-6 GHP codes
A -, - GHP code is a code with variable-node degree and check-node degree . A trapping set is a trapping set containing variable nodes and no uns…
- 0 votes0 replies0 views
Juxtaposed 6-cycle conjecture for dv-3, dc-6 GHP codes
A -, - GHP code is a code with variable-node degree and check-node degree . A weight- polynomial is a polynomial having three nonzero terms, and a juxtapo…
- 0 votes0 replies0 views
Greedy decoding conjecture for the projected base code
Let be the current error -chain in the bundle complex, and let its bundle projection be a -chain in the base complex. A -chain in the base complex is required to s…
- 0 votes0 replies0 views
Fiber-bundle homology decoding conjecture
Let denote the -distance of the quantum LDPC code, and consider the proposed homology-decoding algorithm described in the paper, which uses local updates by fiber strings…
- 0 votes0 replies0 views
Degeneracy conjecture for the employed quantum LDPC codes
Let the quantum LDPC codes be constructed from the classical LDPC codes employed in the paper. A quantum error-correcting code is degenerate if a nontrivial Pauli operator of weigh…
- 0 votes0 replies0 views
The impractically-large-ebit conjecture for entanglement-assisted quantum LDPC codes
Entanglement-assisted stabilizer codes use maximally entangled states, or ebits, to import classical binary or quaternary linear codes into the quantum setting. The entanglement-as…