From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups
We approach the hidden subgroup problem by performing the so-called pretty good measurement on hidden subgroup states. For various groups that can be expressed as the semidirect product of an abelian group and a cyclic group, we show that the pretty good measurement is optimal and that its probabili...
Gespeichert in:
| Veröffentlicht in: | 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05) S. 469 - 478 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Tagungsbericht |
| Sprache: | Englisch |
| Veröffentlicht: |
IEEE
2005
|
| Schlagworte: | |
| ISBN: | 0769524680, 9780769524689 |
| ISSN: | 0272-5428 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | We approach the hidden subgroup problem by performing the so-called pretty good measurement on hidden subgroup states. For various groups that can be expressed as the semidirect product of an abelian group and a cyclic group, we show that the pretty good measurement is optimal and that its probability of success and unitary implementation are closely related to an average-case algebraic problem. By solving this problem, we find efficient quantum algorithms for a number of nonabelian hidden subgroup problems, including some for which no efficient algorithm was previously known: certain metacyclic groups as well as all groups of the form /spl Zopf//sub p/ /sup r/ /spl times/ /spl Zopf//sub p/ fixed r (including the Heisenberg group, r = 2). In particular our results show that entangled measurements across multiple copies of hidden subgroup states can be useful for efficiently solving the nonabelian HSP. |
|---|---|
| AbstractList | We approach the hidden subgroup problem by performing the so-called pretty good measurement on hidden subgroup states. For various groups that can be expressed as the semidirect product of an abelian group and a cyclic group, we show that the pretty good measurement is optimal and that its probability of success and unitary implementation are closely related to an average-case algebraic problem. By solving this problem, we find efficient quantum algorithms for a number of nonabelian hidden subgroup problems, including some for which no efficient algorithm was previously known: certain metacyclic groups as well as all groups of the form /spl Zopf//sub p/ /sup r/ /spl times/ /spl Zopf//sub p/ fixed r (including the Heisenberg group, r = 2). In particular our results show that entangled measurements across multiple copies of hidden subgroup states can be useful for efficiently solving the nonabelian HSP. |
| Author | Childs, A.M. Bacon, D. van Dam, W. |
| Author_xml | – sequence: 1 givenname: D. surname: Bacon fullname: Bacon, D. organization: Dept. of Comput. Sci. & Eng., Washington Univ., Seattle, WA, USA – sequence: 2 givenname: A.M. surname: Childs fullname: Childs, A.M. – sequence: 3 givenname: W. surname: van Dam fullname: van Dam, W. |
| BookMark | eNotj0FLwzAYhgNOcJvevHnJH-j8mjRNe5ThnDDwMD2PJP26RZqmJqniv7dTTy_vy8MD74LMet8jIbc5rPIc6vv9Zr1fMQCx4tUFWYAsa8GKsoIZmQOTLBMFq67IIsZ3gAIE8Dn52gTvqB-SdaqjDlUcAzrsE02eYttaY8_lY1R9Gh1V3dEHm04u0tYHmk5IT7ZpsKdx1Mfgx4EOwesOJ-cnBhrR2cYGNOm8N-OUv1S8Jpet6iLe_OeSvG0eX9fbbPfy9Lx-2GU2lyJlpZZKQaF5Y3jbCia1YEYzYZhGI4VgHPPSqIZJU09APSFcggLJmFJlpfmS3P15LSIehjDdDN-HXHCQvOY_JV1f-A |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1109/SFCS.2005.38 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE/IET Electronic Library IEEE Proceedings Order Plans (POP) 1998-present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE/IET Electronic Library url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Physics Computer Science |
| EndPage | 478 |
| ExternalDocumentID | 1530739 |
| GroupedDBID | -~X 23M 6IE 6IF 6IH 6IK 6IL 6IM 6IN AAJGR AAWTH ACNCT ADZIZ AFFNX AI. ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IPLJI OCL RIE RIL RIO RNS VH1 |
| ID | FETCH-LOGICAL-i175t-6b7aa04b3dc3ff527b52cb25c2bec75523e16cad27c93ff9f52370a0722aa68b3 |
| IEDL.DBID | RIE |
| ISBN | 0769524680 9780769524689 |
| ISICitedReferencesCount | 62 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000234538200044&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0272-5428 |
| IngestDate | Tue Aug 26 19:35:31 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i175t-6b7aa04b3dc3ff527b52cb25c2bec75523e16cad27c93ff9f52370a0722aa68b3 |
| PageCount | 10 |
| ParticipantIDs | ieee_primary_1530739 |
| PublicationCentury | 2000 |
| PublicationDate | 20050000 |
| PublicationDateYYYYMMDD | 2005-01-01 |
| PublicationDate_xml | – year: 2005 text: 20050000 |
| PublicationDecade | 2000 |
| PublicationTitle | 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05) |
| PublicationTitleAbbrev | SFCS |
| PublicationYear | 2005 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0040503 ssj0000451054 |
| Score | 1.5574061 |
| Snippet | We approach the hidden subgroup problem by performing the so-called pretty good measurement on hidden subgroup states. For various groups that can be expressed... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 469 |
| SubjectTerms | Computer science Fourier transforms Lattices Particle measurements Performance evaluation Physics Polynomials Quantum computing Quantum mechanics State estimation |
| Title | From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups |
| URI | https://ieeexplore.ieee.org/document/1530739 |
| WOSCitedRecordID | wos000234538200044&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwED61FUiwFNoi3vLASGjqPGzPFRULVaWC1K2yHYdGahrIA_4-thNSBha22DpFll939_nuO4A7MZETVzLtmygSOn5IPYdGoQkCCDmOQ-FSvy42QeZzulqxRQfu21wYpZQNPlMP5tO-5UeZrAxUNtan0zwsdaFLCKlztVo8xfCkuEY11rewb3hOLL5CDNc_prXLzgKsx9NwPbVt1kbEs_FyNl3WUItJWflVccUqnFn_f0M9gdE-cw8tWp10Ch21G0D_p3QDak7yAI6fW7rWYgCHNg5UFkP4muVZijJ9j6R8i9I9gIjKDClLN2EaH5VekCpFfPuW5Um5SQukjV-kf4k2hpNkh4pK2IQR1FSsQSZUFBUqTWolavoN1SyyUsUIXmePL9Mnp6nN4CTa4CidUBDOXV94kfTiOMBEBFgKHEisNwUJtHurJqHkESaSaQGmRTzicpdgzHlIhXcGvV22U-eAGI6pnj9tunq-z7SQ9BULFPeDWHAq6AUMzfyu32v6jXUztZd_d1_BkWVXtSjJNfTKvFI3cCA_y6TIb-2e-QY9y74b |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwED6Vl4AFKCDeeGAkNHGc2J4RVRG0qgRIbJXtOrRS00CTwN_HdkLKwMIWW6fI8uvuPt99B3AlAxX4ihvfRNPYIzELPTaObRBALHASS5-RqtgEHQzY6ysftuC6yYXRWrvgM31jP91b_jhTpYXKOuZ02oelFViLCMFBla3VICqWKcW3yrG6h4llOnEIC7Vs_5hVTjuPsBlRzfbUtHkTE887T93bpwpssUkrv2quOJXT3fnfYHfhYJm7h4aNVtqDlp63YeeneAOqz3IbtvsNYWvehg0XCaryffjqLrIUZeYmScUMpUsIERUZ0o5wwjY-SrMkZYrE7C1bTItJmiNj_iLzSzSxrCRzlJfSpYygumYNssGiKNfptFKjtt-SzSInlR_AS_fu-bbn1dUZvKkxOQovllQIn8hwrMIkiTCVEVYSRwqbbUEj4-DqIFZijKniRoAbkZD6wqcYCxEzGR7C6jyb6yNAHCfMzJ8xXkNCuBFSRPNICxIlUjDJjmHfzu_ovSLgGNVTe_J39yVs9p77j6PH-8HDKWw5rlWHmZzBarEo9Tmsq89imi8u3P75Bk1fwWI |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=46th+Annual+IEEE+Symposium+on+Foundations+of+Computer+Science+%28FOCS%2705%29&rft.atitle=From+optimal+measurement+to+efficient+quantum+algorithms+for+the+hidden+subgroup+problem+over+semidirect+product+groups&rft.au=Bacon%2C+D.&rft.au=Childs%2C+A.M.&rft.au=van+Dam%2C+W.&rft.date=2005-01-01&rft.pub=IEEE&rft.isbn=9780769524689&rft.issn=0272-5428&rft.spage=469&rft.epage=478&rft_id=info:doi/10.1109%2FSFCS.2005.38&rft.externalDocID=1530739 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0272-5428&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0272-5428&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0272-5428&client=summon |

