Efficient algorithms for NMR quantum computers with small qubits

DOI10.1007/BF03037307zbMath1101.81317MaRDI QIDQ1880338

Noboru Kunihiro, Shigeru Yamashita

Publication date: 22 September 2004

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

zbMATH Keywords

Counting ProblemDiscrete Logarithm ProblemFactoring ProblemNMR Quantum ComputersPolynomial Time Algorithm

Mathematics Subject Classification ID

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

Cites Work

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

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