(Q57696179)

English

Intricacies of quantum computational paths

scientific article published on 31 August 2012

In more languages

default for all languages

No label defined

No description defined

edit

Statements

instance of

scholarly article

0 references

title

Intricacies of quantum computational paths (English)

0 references

Luís Tarrataca

0 references

Andreas Wichert

0 references

31 August 2012

0 references

published in

Quantum Information Processing

0 references

volume

0 references

issue

0 references

page(s)

1365-1378

0 references

maintained by WikiProject

WikiProject Mathematics

0 references

cites work

Any AND-OR Formula of Size N can be Evaluated in time N^{1/2 + o(1)} on a Quantum Computer

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1007%2FS11128-012-0475-7

retrieved

21 January 2018

Quantum lower bounds by polynomials

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1007%2FS11128-012-0475-7

retrieved

21 January 2018

A fast quantum mechanical algorithm for database search

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1007%2FS11128-012-0475-7

retrieved

21 January 2018

Tree search and quantum computation

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1007%2FS11128-012-0475-7

retrieved

21 January 2018

Identifiers

DOI

10.1007/S11128-012-0475-7

0 references

DBLP publication ID

journals/qip/TarratacaW13

1 reference

stated in

DBLP Dataset 2021-01-02

retrieved

28 January 2021

zbMATH Open document ID

1264.68080

0 references

Sitelinks

Wikipedia(0 entries)

Wikibooks(0 entries)

Wikinews(0 entries)

Wikiquote(0 entries)

Wikisource(0 entries)

Wikiversity(0 entries)

Wikivoyage(0 entries)

Wiktionary(0 entries)

Multilingual sites(0 entries)

Retrieved from "https://www.wikidata.org/w/index.php?title=Q57696179&oldid=2074884454"