Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Qubit complexity of continuous problems

From MaRDI portal
Publication:2431383
Jump to:navigation, search

DOI10.1007/s11784-009-0132-7zbMath1213.68288arXivquant-ph/0512082OpenAlexW2010814638MaRDI QIDQ2431383

J. F. Traub, Anargyros Papageorgiou

Publication date: 13 April 2011

Published in: Journal of Fixed Point Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0512082

zbMATH Keywords

quantum algorithmsnumerical approximationquery complexity


Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)





Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2431383&oldid=15095901"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 2 February 2024, at 22:51.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki