Year: 2026
Type: article
Abstract: The distance of a stabilizer quantum code is a very important feature since it determines the number of errors that can be detected and corrected. We present three new fast algorithms and implementations for computing the symplectic distance of the associated classical code. Our new algorithms are based on the Brouwer–Zimmermann algorithm. Our experimental study shows that these new implementations are much faster than current state-of-the-art licensed implementations on single-core processors, multicore processors, and shared-memory multiprocessors. In the most computationally-demanding cases, the performance gain in the computational time can be larger than one order of magnitude. The experimental study also shows a good scalability on shared-memory parallel architectures.
DOI: 10.1145/3795877
Institutions: Universitat Jaume I, University of Gdańsk
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Awards: G1105844351, G1175115578, G1502225866, G1535764158, G1622782223, G210041235, G2262748287, G2317074901, G2601397997, G26886609, G300979063, G310844197, G3418582823, G34346518, G3480869486, G3681454997, G4042783231, G410571670, G425668148, G451917667, G4644698862, G4857899014, G491712853, G5080475149, G5195188938, G5404395142, G5539308778, G5967599077, G624877701, G6298273575, G6521374674, G6998574964, G7084143925, G7413739749, G7569305816, G7805626310, G7863371703, G81526208, G8181105605, G8497050386, G929308097
OpenAlex ID: W4403007328