This HTML5 document contains 25 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n11https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Hidden_shift_problem
rdfs:label
Hidden shift problem
rdfs:comment
The Hidden shift problem states: Given an oracle that encodes two functions and , there is an n-bit string for which for all . Find . Many functions, such as the Legendre symbol and Bent functions, satisfy these constraints. With a quantum algorithm that's defined as "" where is the Hadamard gate and is the Fourier transform of , this problem can be solved in a polynomial number of queries to while taking exponential queries with a classical algorithm. The difference between the Hidden subgroup problem and the Hidden shift problem is that the former focuses on the underlying group while the latter focuses on the underlying ring or field.
dcterms:subject
dbc:Quantum_algorithms
dbo:wikiPageID
63466570
dbo:wikiPageRevisionID
1084375504
dbo:wikiPageWikiLink
dbr:Oracle_machine dbc:Quantum_algorithms dbr:Legendre_symbol dbr:Bent_function dbr:Hadamard_gate dbr:Quantum_algorithm dbr:Ring_(mathematics) dbr:Hidden_subgroup_problem dbr:Group_(mathematics) dbr:Fourier_transform dbr:Field_(mathematics)
owl:sameAs
n11:BzcPd wikidata:Q96381001
dbp:wikiPageUsesTemplate
dbt:Reflist
dbo:abstract
The Hidden shift problem states: Given an oracle that encodes two functions and , there is an n-bit string for which for all . Find . Many functions, such as the Legendre symbol and Bent functions, satisfy these constraints. With a quantum algorithm that's defined as "" where is the Hadamard gate and is the Fourier transform of , this problem can be solved in a polynomial number of queries to while taking exponential queries with a classical algorithm. The difference between the Hidden subgroup problem and the Hidden shift problem is that the former focuses on the underlying group while the latter focuses on the underlying ring or field.
prov:wasDerivedFrom
wikipedia-en:Hidden_shift_problem?oldid=1084375504&ns=0
dbo:wikiPageLength
1878
foaf:isPrimaryTopicOf
wikipedia-en:Hidden_shift_problem
Subject Item
dbr:Hidden_subgroup_problem
dbo:wikiPageWikiLink
dbr:Hidden_shift_problem
Subject Item
wikipedia-en:Hidden_shift_problem
foaf:primaryTopic
dbr:Hidden_shift_problem