scientific article; zbMATH DE number 5049912
From MaRDI portal
Publication:5482449
zbMATH Open1112.68386MaRDI QIDQ5482449FDOQ5482449
Authors: Stefan Heinrich 
Publication date: 28 August 2006
Title of this publication is not available (Why is that?)
Recommendations
- Quantum computational number theory
- scientific article; zbMATH DE number 1796836
- scientific article; zbMATH DE number 1555956
- Quantum computation and NP-complete problems
- Quantum Complexity Theory
- Complexity considerations quantum computation
- Qubit complexity of continuous problems
- Computational complexity and applications of quantum algorithm
- On quantum complexity
- Computational complexity of the quantum separability problem
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)
Cited In (8)
- ON COMPUTATIONAL COMPLEXITY OF QUANTUM ALGORITHM FOR FACTORING
- Numerical Recipes in Quantum Information Theory and Quantum Computing
- The quantum query complexity of elliptic PDE
- Title not available (Why is that?)
- What can quantum computers do?
- Title not available (Why is that?)
- Title not available (Why is that?)
- Large-Scale Scientific Computing
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5482449)
