Efficient algorithms for NMR quantum computers with small qubits
From MaRDI portal
Publication:1880338
DOI10.1007/BF03037307zbMath1101.81317MaRDI QIDQ1880338
Noboru Kunihiro, Shigeru Yamashita
Publication date: 22 September 2004
Published in: New Generation Computing (Search for Journal in Brave)
Counting Problem; Discrete Logarithm Problem; Factoring Problem; NMR Quantum Computers; Polynomial Time Algorithm
81P68: Quantum computation
11Y16: Number-theoretic algorithms; complexity
68W10: Parallel algorithms in computer science
11Y05: Factorization
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