Efficient algorithms for NMR quantum computers with small qubits

DOI10.1007/BF03037307MaRDI QIDQ1880338zbMATH OpenFDO

Authors Noboru Kunihiro, S. Yamasita

Publication date 22 September 2004

Published in New Generation Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF03037307

zbMATH Keywords

Counting ProblemDiscrete Logarithm ProblemFactoring ProblemNMR Quantum ComputersPolynomial Time Algorithm

Mathematics Subject Classification ID

Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16) Parallel algorithms in computer science (68W10) Quantum computation (81P68)

Recommendations

• Quantum factorization algorithm by NMR ensemble computers
• Quantum algorithms for computing short discrete logarithms and factoring RSA integers
• NMR quantum computing
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum factoring algorithm: resource estimation and survey of experiments

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• Equivalence of counting the number of points on elliptic curve over the ring Zn and factoring n
• Mathematical models of quantum computation
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Riemann's hypothesis and tests for primality

Cited in

(2)

• Practical security of RSA against NTC-architecture quantum computing attacks
• Quantum factorization algorithm by NMR ensemble computers

This page was built for publication: Efficient algorithms for NMR quantum computers with small qubits

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