Experimental analysis of the optimization-based factorization algorithm

DOI10.1007/978-981-96-5566-3_8MaRDI QIDQ6877468zbMATH OpenFDO

Authors Junpei Yamaguchi, Tetsuya Izu, Noboru Kunihiro

Publication date 8 January 2026

Full work available at URL https://doi.org/10.1007/978-981-96-5566-3_8

zbMATH Keywords

annealing computationclosest vector problemquantum factorization

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Cites work

• A quantum circuit for Shor's factoring algorithm using 2n+2 qubits
• Experiments and resource analysis of Shor's factorization using a quantum simulator
• Factoring integers by CVP algorithms
• Factoring polynomials with rational coefficients
• scientific article; zbMATH DE number 3908520 (Why is no real title available?)
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems

This page was built for publication: Experimental analysis of the optimization-based factorization algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6877468)