R.I.P.
👻
Ghosted
Prime factorization using quantum annealing and computational algebraic geometry
April 20, 2016 · Declared Dead · 🏛 Scientific Reports
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Raouf Dridi, Hedayat Alghassi
arXiv ID
1604.05796
Category
quant-ph: Quantum Computing
Cross-listed
cs.CR,
math.AC,
math.AG
Citations
92
Venue
Scientific Reports
Last Checked
3 months ago
Abstract
We investigate prime factorization from two perspectives: quantum annealing and computational algebraic geometry, specifically Gröbner bases. We present a novel scalable algorithm which combines the two approaches and leads to the factorization of all bi-primes up to just over $200 \, 000$, the largest number factored to date using a quantum processor.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
📜 Similar Papers
In the same crypt — Quantum Computing
R.I.P.
👻
Ghosted
The power of quantum neural networks
R.I.P.
👻
Ghosted
Power of data in quantum machine learning
R.I.P.
👻
Ghosted
Quantum machine learning: a classical perspective
R.I.P.
👻
Ghosted
Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers
R.I.P.
👻
Ghosted
ProjectQ: An Open Source Software Framework for Quantum Computing
Died the same way — 👻 Ghosted
R.I.P.
👻
Ghosted
Language Models are Few-Shot Learners
R.I.P.
👻
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
👻
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
👻
Ghosted