Mathematical models of quantum computation

DOI10.1007/BF03037370zbMath1013.68089OpenAlexW1971258940MaRDI QIDQ1862645

Tetsuro Nishino

Publication date: 26 June 2003

Published in: New Generation Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03037370

zbMATH Keywords

bulk quantum computationrealistic quantum computation

Mathematics Subject Classification ID

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

Related Items (2)

Efficient algorithms for NMR quantum computers with small qubits ⋮ A framework for quantum-classical cryptographic translation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• NP is as easy as detecting unique solutions
• Principles and demonstrations of quantum information processing by NMR spectroscopy
• Quantum computational networks
• Bulk Spin-Resonance Quantum Computation
• Rapid solution of problems by quantum computation
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Bulk quantum computation with nuclear magnetic resonance: theory and experiment
• Quantum Complexity Theory
• Strengths and Weaknesses of Quantum Computing
• Quantum lower bounds by polynomials
• Logical Reversibility of Computation

This page was built for publication: Mathematical models of quantum computation