# Hard instance learning for quantum adiabatic prime factorization

@article{Lin2021HardIL, title={Hard instance learning for quantum adiabatic prime factorization}, author={Jian Lin and Zhengfeng Zhang and Junping Zhang and Xiaopeng Li}, journal={ArXiv}, year={2021}, volume={abs/2110.04782} }

Jian Lin,1 Zhengfeng Zhang,2 Junping Zhang,2, ∗ and Xiaopeng Li1, 3, † 1State Key Laboratory of Surface Physics, Institute of Nanoelectronics and Quantum Computing, and Department of Physics, Fudan University, Shanghai 200433, China 2Shanghai Key Lab of Intelligent Information Processing, and School of Computer Science, Fudan University, Shanghai 200433, China 3Shanghai Qi Zhi Institute, AI Tower, Xuhui District, Shanghai 200232, China (Dated: October 12, 2021)

## References

SHOWING 1-10 OF 35 REFERENCES

Quantum Annealing for Prime Factorization

- Medicine, MathematicsScientific Reports
- 2018

We have developed a framework to convert an arbitrary integer factorization problem to an executable Ising model by first writing it as an optimization function then transforming the k-bit coupling…

Efficiently embedding QUBO problems on adiabatic quantum computers

- Computer ScienceQuantum Inf. Process.
- 2019

This work proposes an efficient embedding algorithm, that lets us embed QUBO problems fast, uses less qubits and gets the objective function value close to the global minimum value, and compares the performance of the algorithm to that of D-Wave’s embedding algorithms.

A hybrid scheme for prime factorization and its experimental implementation using IBM quantum processor

- Physics, Computer ScienceQuantum Inf. Process.
- 2021

A quantum-classical hybrid scheme for factorization of bi-prime numbers (which are odd and square-free) using IBM's quantum processors and can be implemented using any quantum computing architecture is reported.

Factoring larger integers with fewer qubits via quantum annealing with optimized parameters

- Computer ScienceScience China Physics, Mechanics & Astronomy
- 2019

This study optimize the problem Hamiltonian to reduce the number of qubits involved in the final Hamiltonian while maintaining the QUBO coefficients in a reasonable range, enabling the improved algorithm to factorize larger integers with fewer qubits.

Prime factorization algorithm based on parameter optimization of Ising model

- Medicine, MathematicsScientific Reports
- 2020

This paper provides a new (second) way, which is completely different from Shor’s algorithm, to show the optimistic potential of a D-Wave quantum computer for deciphering RSA and successfully…

Experimental Adiabatic Quantum Factorization under Ambient Conditions Based on a Solid-State Single Spin System.

- Physics, MedicinePhysical review letters
- 2017

This Letter reports on the experimental realization of an adiabatic quantum algorithm on a single solid spin system under ambient conditions and finds the ground state of the problem Hamiltonian S_{z}I_{z}, which can be mapped to the factorization of 35 into its prime factors 5 and 7.

Prime factorization using quantum annealing and computational algebraic geometry

- Computer Science, PhysicsScientific reports
- 2017

This work presents a novel autonomous algorithm which combines the two approaches and leads to the factorization of all bi-primes up to just over 200000, the largest number factored to date using a quantum processor.

The Quantum Adiabatic Algorithm applied to random optimization problems: the quantum spin glass perspective

- Physics, Computer ScienceArXiv
- 2012

This paper reviews recent analytical works that extended these studies to incorporate the effect of quantum fluctuations, and presents also some original results in this direction.

A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem

- Physics, MedicineScience
- 2001

For the small examples that the authors could simulate, the quantum adiabatic algorithm worked well, providing evidence that quantum computers (if large ones can be built) may be able to outperform ordinary computers on hard sets of instances of NP-complete problems.

Schedule path optimization for adiabatic quantum computing and optimization

- Computer Science, Mathematics
- 2016

This work investigates a strategy for increasing the minimum gap and success probability by introducing intermediate Hamiltonians that modify the evolution path between initial and final Hamiltonians and empirically finds that random Hamiltonians have a significant probability of increasing the success probability, but only by a modest amount.