Presents a concrete quantum oracle for bilinear Diophantine equations enabling factoring of n-bit biprimes with 2n-5 qubits or fewer and near-100% simulated success for numbers up to 35 bits.
Nature 414(6866), 883–887 (2001)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
physics.gen-ph 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient Quantum Oracle for Solving Bilinear Diophantine Equations on Digital Quantum Computers
Presents a concrete quantum oracle for bilinear Diophantine equations enabling factoring of n-bit biprimes with 2n-5 qubits or fewer and near-100% simulated success for numbers up to 35 bits.