Efficient algorithms for NMR quantum computers with small qubits (Q1880338)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2101677
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for NMR quantum computers with small qubits |
scientific article; zbMATH DE number 2101677 |
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
0.8384089469909668
0 references
0.7893562912940979
0 references
0.7803949117660522
0 references
0.7694337964057922
0 references
0.7496329545974731
0 references
