License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TQC.2016.6
URN: urn:nbn:de:0030-drops-66877
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6687/
Go to the corresponding LIPIcs Volume Portal

Chia, Nai-Hui ; Hallgren, Sean

How Hard Is Deciding Trivial Versus Nontrivial in the Dihedral Coset Problem?

pdf-format:
LIPIcs-TQC-2016-6.pdf (0.5 MB)

Abstract

We study the hardness of the dihedral hidden subgroup problem. It is known that lattice problems reduce to it, and that it reduces to random subset sum with density > 1 and also to quantum sampling subset sum solutions. We examine a decision version of the problem where the question asks whether the hidden subgroup is trivial or order two. The decision problem essentially asks if a given vector is in the span of all coset states. We approach this by first computing an explicit basis for the coset space and the perpendicular space. We then look at the consequences of having efficient unitaries that use this basis. We show that if a unitary maps the basis to the standard basis in any way, then that unitary can be used to solve random subset sum with constant density >1. We also show that if a unitary can exactly decide membership in the coset subspace, then the collision problem for subset sum can be solved for density >1 but approaching 1 as the problem size increases. This strengthens the previous hardness result that implementing the optimal POVM in a specific way is as hard as quantum sampling subset sum solutions.

BibTeX - Entry

@InProceedings{chia_et_al:LIPIcs:2016:6687,
  author =	{Nai-Hui Chia and Sean Hallgren},
  title =	{{How Hard Is Deciding Trivial Versus Nontrivial in the Dihedral Coset Probleml}},
  booktitle =	{11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016)},
  pages =	{6:1--6:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-019-4},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{61},
  editor =	{Anne Broadbent},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6687},
  URN =		{urn:nbn:de:0030-drops-66877},
  doi =		{10.4230/LIPIcs.TQC.2016.6},
  annote =	{Keywords: Quantum algorithms, hidden subgroup problem, random subset sum problem}
}

Keywords: Quantum algorithms, hidden subgroup problem, random subset sum problem
Collection: 11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016)
Issue Date: 2016
Date of publication: 22.09.2016

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI