Quantum model of computations: Underlying principles and achievements
From MaRDI portal
Publication:1592007
DOI10.1007/BF02733301zbMATH Open0966.68075MaRDI QIDQ1592007FDOQ1592007
Anatoly V. Anisimov, S. V. Danil'chenko
Publication date: 15 January 2001
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Recommendations
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)
Cites Work
- Quantum cryptography based on Bell’s theorem
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum cryptography: public key distribution and coin tossing
- Title not available (Why is that?)
- Quantum cryptography using any two nonorthogonal states
- Logical Reversibility of Computation
- Riemann's hypothesis and tests for primality
- Quantum complexity theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quantum Fourier sampling simplified
- Recursive information transducers: Computation models
Cited In (4)
This page was built for publication: Quantum model of computations: Underlying principles and achievements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1592007)