Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

What can quantum computers do?

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

DOI10.1007/S00591-006-0013-8zbMATH Open1110.81315OpenAlexW2074692488MaRDI QIDQ873912FDOQ873912


Authors: Erich Novak Edit this on Wikidata


Publication date: 20 March 2007

Published in: Mathematische Semesterberichte (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00591-006-0013-8





Mathematics Subject Classification ID

Quantum computation (81P68)


Cites Work

  • Title not available (Why is that?)
  • Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
  • Quantum summation with an application to integration.
  • On Computable Numbers, with an Application to the Entscheidungsproblem
  • Quantum complexity of integration
  • Title not available (Why is that?)
  • Verschränkte Systeme
  • Sharp error bounds on quantum Boolean summation in various settings
  • Title not available (Why is that?)


Cited In (3)

  • What is quantum computation.
  • What is quantum computation?
  • Title not available (Why is that?)





This page was built for publication: What can quantum computers do?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q873912)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:873912&oldid=12828760"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 15:45. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki