Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Springer eBooks

Fast Factorization

Mika Hirvensalo

Published Jan 1, 2001• 0 citations
Publisher
DOI
10.1007/978-3-662-04461-2_3

Related papers

Fast Factorization

Mika Hirvensalo

Springer eBooks•Jan 1, 2004•0 citations

Syndrome Check aided Fast-SSCANL Decoding Algorithm for Polar Codes

Choangyang Liu, Wenjie Dai, Rui Guo

The soft cancellation list (SCANL) decoding algorithm for polar codes runs L soft cancellation (SCAN) decoders with different decoding factor graphs.Although it can achieve better decoding performance than SCAN algorithm, it has high latency.In this paper, a fast simplified SCANL (Fast-SSCANL) algorithm that runs L independent Fast-SSCAN decoders is proposed.In Fast-SSCANL decoder, special nodes in each factor graph is identified, and corresponding low-latency decoding approaches for each special node is propose first.Then, syndrome check aided Fast-SSCANL (SC-Fast-SSCANL) algorithm is further put forward.The ordinary nodes satisfied the syndrome check will execute hard decision directly without traversing the factor graph, thereby reducing the decoding latency further.Simulation results show that Fast-SSCANL and SC-Fast-SSCANL algorithms can achieve the same BER performance as the SCANL algorithm with lower latency.Fast-SSCANL algorithm can reduce latency by more than 83% compared with SCANL, and SC-Fast-SSCANL algorithm can reduce more than 85% latency compared with SCANL regardless of code length and code rate.

KSII Transactions on Internet and Information Systems•May 31, 2024•1 citation

Fast Phase Factor Finding for Quantum Signal Processing

Hongkang Ni, Lexing Ying

Abstract. This paper presents two efficient and stable algorithms for recovering phase factors in quantum signal processing (QSP), a crucial component of many quantum information processing applications. The first algorithm, the Half Cholesky (HC) method, which is based on nonlinear Fourier analysis and fast solvers for structured matrices, demonstrates robust performance across all regimes. The second algorithm, Fast Fixed Point Iteration (FFPI), offers even greater efficiency in the non–fully coherent regime. Both theoretical analysis and numerical experiments demonstrate the significant advantages of these new methods over all existing approaches. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://github.com/HongkangNi/Fast-Phase-Factor-Finding-for-QSP and in the supplementary materials ( Fast-Phase-Factor-Finding-for-QSP-main.zip [135KB]). [Formula: see text]

arXiv:2410.06409•SIAM Journal on Scientific Computing•Jul 30, 2026•22 citations

Shor’s Factorization Algorithm

Taylor & Francis eBooks•Mar 11, 2008•0 citations

Sparse factor graph representations of reed-solomon and related codes

Jonathan S. Yedidia

We present sparse factor graph representations of Reed-Solomon codes based on a fast Fourier transform. These representations can be used to create encoders, or message-passing decoders that use soft input information. We discuss various simplifications and transformations of the factor graph representations that may be useful. Finally, we show that other interesting codes can be represented using sparse fast transform factor graphs.

IEEE International Symposium on Information Theory (ISIT)•Dec 23, 2004•9 citations

The Method of Factorization

Konstantin V. Kazakov

Elsevier eBooks•Jan 1, 2012•0 citations
The soft cancellation list (SCANL) decoding algorithm for polar codes runs L soft cancellation (SCAN) decoders with different decoding factor graphs.Although it can achieve better decoding performance than SCAN algorithm, it has high latency.In this paper, a fast simplified SCANL (Fast-SSCANL) algorithm that runs L independent Fast-SSCAN decoders is proposed.In Fast-SSCANL decoder, special nodes in each factor graph is identified, and corresponding low-latency decoding approaches for each special node is propose first.Then, syndrome check aided Fast-SSCANL (SC-Fast-SSCANL) algorithm is further put forward.The ordinary nodes satisfied the syndrome check will execute hard decision directly without traversing the factor graph, thereby reducing the decoding latency further.Simulation results show that Fast-SSCANL and SC-Fast-SSCANL algorithms can achieve the same BER performance as the SCANL algorithm with lower latency.Fast-SSCANL algorithm can reduce latency by more than 83% compared with SCANL, and SC-Fast-SSCANL algorithm can reduce more than 85% latency compared with SCANL regardless of code length and code rate.
Abstract. This paper presents two efficient and stable algorithms for recovering phase factors in quantum signal processing (QSP), a crucial component of many quantum information processing applications. The first algorithm, the Half Cholesky (HC) method, which is based on nonlinear Fourier analysis and fast solvers for structured matrices, demonstrates robust performance across all regimes. The second algorithm, Fast Fixed Point Iteration (FFPI), offers even greater efficiency in the non–fully coherent regime. Both theoretical analysis and numerical experiments demonstrate the significant advantages of these new methods over all existing approaches. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://github.com/HongkangNi/Fast-Phase-Factor-Finding-for-QSP and in the supplementary materials ( Fast-Phase-Factor-Finding-for-QSP-main.zip [135KB]). [Formula: see text]