An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

Quantum Signal Processing is a Hamiltonian simulation algorithm with optimal lower bounds in query complexity. It linearizes the operator of a quantum walk using eigenvalue transformation. The quantum walk takes a constant number of queries. So quantum signal processing's cost depends on the constant number of calls to the quantum walk operator, number of single qubit quantum gates that aid in the eigenvalue transformation and an ancilla qubit.

Property Value
dbo:abstract
  • Quantum Signal Processing is a Hamiltonian simulation algorithm with optimal lower bounds in query complexity. It linearizes the operator of a quantum walk using eigenvalue transformation. The quantum walk takes a constant number of queries. So quantum signal processing's cost depends on the constant number of calls to the quantum walk operator, number of single qubit quantum gates that aid in the eigenvalue transformation and an ancilla qubit. (en)
dbo:wikiPageID
  • 61732051 (xsd:integer)
dbo:wikiPageLength
  • 2799 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1108920562 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • Quantum Signal Processing is a Hamiltonian simulation algorithm with optimal lower bounds in query complexity. It linearizes the operator of a quantum walk using eigenvalue transformation. The quantum walk takes a constant number of queries. So quantum signal processing's cost depends on the constant number of calls to the quantum walk operator, number of single qubit quantum gates that aid in the eigenvalue transformation and an ancilla qubit. (en)
rdfs:label
  • Quantum signal processing (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License