Quantum model of computations: Underlying principles and achievements
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3817043 (Why is no real title available?)
- scientific article; zbMATH DE number 3825698 (Why is no real title available?)
- scientific article; zbMATH DE number 1030974 (Why is no real title available?)
- scientific article; zbMATH DE number 1559521 (Why is no real title available?)
- scientific article; zbMATH DE number 1775384 (Why is no real title available?)
- Logical Reversibility of Computation
- Quantum complexity theory
- Quantum cryptography based on Bell’s theorem
- Quantum cryptography using any two nonorthogonal states
- Quantum cryptography: public key distribution and coin tossing
- Quantum Fourier sampling simplified
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Recursive information transducers: Computation models
- Riemann's hypothesis and tests for primality
Cited in
(5)- A computational model for quantum measurement
- Models in quantum computing: a systematic review
- Quantum computers: the fundamentals and algorithms (a brief review)
- scientific article; zbMATH DE number 1072528 (Why is no real title available?)
- scientific article; zbMATH DE number 1867388 (Why is no real title available?)
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)