Efficient algorithms for NMR quantum computers with small qubits (Q1880338): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Quantum theory, the Church–Turing principle and the universal quantum computer / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Equivalence of counting the number of points on elliptic curve over the ring Zn and factoring n / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Riemann's hypothesis and tests for primality / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Mathematical models of quantum computation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A method for obtaining digital signatures and public-key cryptosystems / rank | |||
Normal rank | |||
Latest revision as of 19:52, 6 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for NMR quantum computers with small qubits |
scientific article |
Statements
Efficient algorithms for NMR quantum computers with small qubits (English)
0 references
22 September 2004
0 references
Factoring Problem
0 references
Discrete Logarithm Problem
0 references
NMR Quantum Computers
0 references
Counting Problem
0 references
Polynomial Time Algorithm
0 references
0 references
