Quantum model of computations: Underlying principles and achievements

DOI10.1007/BF02733301zbMath0966.68075MaRDI QIDQ1592007

S. V. Danil'chenko, Anatoly V. Anisimov

Publication date: 15 January 2001

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

quantum computationsquantum Turing machine

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum cryptography: public key distribution and coin tossing
• Riemann's hypothesis and tests for primality
• Recursive information transducers: Computation models
• Quantum Fourier sampling simplified
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Quantum cryptography based on Bell’s theorem
• Quantum cryptography using any two nonorthogonal states
• Quantum complexity theory
• Logical Reversibility of Computation

This page was built for publication: Quantum model of computations: Underlying principles and achievements