Home
File Metadata
quant-ph_0404067.txt
Annotation: dorsal/arxiv

dorsal/arxiv

Added by Arxiv Bot | Added: 2026-03-02 18:02 | Views: 1 | Source: arXiv Dataset IDs (Model)

A Note on the Quantum Query Complexity of the Hidden Subgroup Problem

Authors	Troels Windfeldt
Categories	quant-ph
ArXiv ID	quant-ph/0404067
URL	https://arxiv.org/abs/quant-ph/0404067

Abstract

We are concerned with the Hidden Subgroup Problem for finite groups. We present a simplified analysis of a quantum algorithm proposed by Hallgren, Russell and Ta-Shma as well as a detailed proof of a lower bound on the probability of success of the algorithm.

{
  "annotation_id": "77b54aa7-3716-4c55-940b-a4b41fb03d6b",
  "date_created": "2026-03-02T18:02:06.347000Z",
  "date_modified": "2026-03-02T18:02:06.347000Z",
  "file_hash": "48fac90624ee7134bd1db45b8c80f6e4c585a127f8fa1c983926ba7e2548e3b2",
  "private": false,
  "record": {
    "abstract": "We are concerned with the Hidden Subgroup Problem for finite groups. We\npresent a simplified analysis of a quantum algorithm proposed by Hallgren,\nRussell and Ta-Shma as well as a detailed proof of a lower bound on the\nprobability of success of the algorithm.",
    "arxiv_id": "quant-ph/0404067",
    "authors": [
      "Troels Windfeldt"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "A Note on the Quantum Query Complexity of the Hidden Subgroup Problem",
    "url": "https://arxiv.org/abs/quant-ph/0404067"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "2c8f7e57-b62b-4fbf-a4f6-b588d2080e7b",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}