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

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

Namespace Prefixes

PrefixIRI
n21https://arxiv.org/abs/quant-ph/
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
dbpedia-huhttp://hu.dbpedia.org/resource/
n13https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n15http://xstructure.inr.ac.ru/x-bin/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n16http://dbpedia.org/resource/Quantum_Computing:
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Index_of_physics_articles_(H)
dbo:wikiPageWikiLink
dbr:Hidden_subgroup_problem
Subject Item
dbr:Quantum_computing
dbo:wikiPageWikiLink
dbr:Hidden_subgroup_problem
Subject Item
dbr:Simon's_problem
dbo:wikiPageWikiLink
dbr:Hidden_subgroup_problem
Subject Item
n16:_A_Gentle_Introduction
dbo:wikiPageWikiLink
dbr:Hidden_subgroup_problem
Subject Item
dbr:Quantum_algorithm
dbo:wikiPageWikiLink
dbr:Hidden_subgroup_problem
Subject Item
dbr:Core_(group_theory)
dbo:wikiPageWikiLink
dbr:Hidden_subgroup_problem
Subject Item
dbr:Shor's_algorithm
dbo:wikiPageWikiLink
dbr:Hidden_subgroup_problem
Subject Item
dbr:BQP
dbo:wikiPageWikiLink
dbr:Hidden_subgroup_problem
Subject Item
dbr:Discrete_logarithm
dbo:wikiPageWikiLink
dbr:Hidden_subgroup_problem
Subject Item
dbr:Graph_isomorphism_problem
dbo:wikiPageWikiLink
dbr:Hidden_subgroup_problem
Subject Item
dbr:HSP
dbo:wikiPageWikiLink
dbr:Hidden_subgroup_problem
dbo:wikiPageDisambiguates
dbr:Hidden_subgroup_problem
Subject Item
dbr:Quantum_Fourier_transform
dbo:wikiPageWikiLink
dbr:Hidden_subgroup_problem
Subject Item
dbr:Hidden_shift_problem
dbo:wikiPageWikiLink
dbr:Hidden_subgroup_problem
Subject Item
dbr:Hidden_subgroup_problem
rdf:type
yago:Algorithm105847438 yago:PsychologicalFeature100023100 yago:Procedure101023820 yago:Abstraction100002137 yago:Event100029378 yago:WikicatQuantumAlgorithms yago:Act100030358 dbo:Scientist yago:Activity100407535 yago:YagoPermanentlyLocatedEntity yago:Rule105846932
rdfs:label
Hidden subgroup problem
rdfs:comment
The hidden subgroup problem (HSP) is a topic of research in mathematics and theoretical computer science. The framework captures problems such as factoring, discrete logarithm, graph isomorphism, and the shortest vector problem. This makes it especially important in the theory of quantum computing because Shor's quantum algorithm for factoring is an instance of the hidden subgroup problem for finite Abelian groups, while the other problems correspond to finite groups that are not Abelian.
dcterms:subject
dbc:Group_theory dbc:Quantum_algorithms
dbo:wikiPageID
3728000
dbo:wikiPageRevisionID
1107211671
dbo:wikiPageWikiLink
dbr:Hidden_shift_problem dbr:Dual_group_(Quantum_Computing) dbc:Group_theory dbr:Abelian_group dbr:Non-abelian_group dbr:Group_(mathematics) dbr:Cosets dbr:Dihedral_group dbr:Kernel_(algebra) dbr:Quantum_algorithms dbr:Finite_abelian_group dbr:Discrete_logarithm dbr:Quantum_algorithm dbc:Quantum_algorithms dbr:Quantum_Fourier_transform dbr:Oracle_machine dbr:Symmetric_group dbr:Shortest_vector_problem dbr:Mathematics dbr:Integer_factorization dbr:Quantum_computer dbr:Shor's_algorithm dbr:Subgroup dbr:Theoretical_computer_science dbr:Group_homomorphism dbr:Quantum_computing dbr:Graph_isomorphism_problem
dbo:wikiPageExternalLink
n15:theme2.py%3Farxiv=quant-ph&level=1&index1=14486 n21:0012084 n21:0411037
owl:sameAs
dbpedia-hu:Rejtettrészcsoport-probléma n13:4mV2W wikidata:Q5752087 freebase:m.09xmsx yago-res:Hidden_subgroup_problem
dbp:wikiPageUsesTemplate
dbt:Use_American_English dbt:Short_description
dbo:abstract
The hidden subgroup problem (HSP) is a topic of research in mathematics and theoretical computer science. The framework captures problems such as factoring, discrete logarithm, graph isomorphism, and the shortest vector problem. This makes it especially important in the theory of quantum computing because Shor's quantum algorithm for factoring is an instance of the hidden subgroup problem for finite Abelian groups, while the other problems correspond to finite groups that are not Abelian.
gold:hypernym
dbr:Topic
prov:wasDerivedFrom
wikipedia-en:Hidden_subgroup_problem?oldid=1107211671&ns=0
dbo:wikiPageLength
5576
foaf:isPrimaryTopicOf
wikipedia-en:Hidden_subgroup_problem
Subject Item
dbr:Hidden_subgroup
dbo:wikiPageWikiLink
dbr:Hidden_subgroup_problem
dbo:wikiPageRedirects
dbr:Hidden_subgroup_problem
Subject Item
wikipedia-en:Hidden_subgroup_problem
foaf:primaryTopic
dbr:Hidden_subgroup_problem