Hidden subgroup problem

Results: 21



#Item
1Computational complexity theory / Theory of computation / Complexity classes / Graph isomorphism problem / NP / PP / Low / Graph automorphism / Hidden subgroup problem / Time complexity / P / Chromatic polynomial

Graph Isomorphism is in SPP ? V. Arvind ∗ and Piyush P Kurur 1 Institute of Mathematical Sciences, Chennai, India Abstract We show that Graph Isomorphism is in the complexity class SPP, and hence it is

Add to Reading List

Source URL: www.cse.iitk.ac.in

Language: English - Date: 2016-07-30 09:35:21
2Complexity classes / Finite groups / Combinatorial group theory / Graph isomorphism problem / Morphisms / Hidden subgroup problem / Permutation group / Permutation / Graph canonization / ArthurMerlin protocol / Graph automorphism / NP

Graph Isomorphism is in SPP V. Arvind and Piyush P Kurur Institute of Mathematical Sciences, C.I.T Campus Chennai, India email: {arvind,ppk}@imsc.ernet.in Abstract

Add to Reading List

Source URL: www.cse.iitk.ac.in

Language: English - Date: 2016-07-30 09:35:21
3

An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups ∗ G´abor Ivanyos† Luc Sanselme‡

Add to Reading List

Source URL: www.liafa.univ-paris-diderot.fr

Language: English - Date: 2010-12-13 11:02:50
    4

    An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups ∗ G´abor Ivanyos† Luc Sanselme‡

    Add to Reading List

    Source URL: www.liafa.univ-paris-diderot.fr

    Language: English - Date: 2010-12-13 11:02:49
      5Algebra / Hidden subgroup problem / Quantum algorithm / Coset / Integer factorization / Quantum computer / Subgroup / Elliptic curve / Discrete logarithm / Abstract algebra / Group theory / Mathematics

      Mathematical Challenges in Quantum Algorithms Ashley Montanaro Department of Computer Science, University of Bristol

      Add to Reading List

      Source URL: www.turing-gateway.cam.ac.uk

      Language: English - Date: 2014-09-23 05:58:29
      6Quantum algorithms / Theoretical computer science / Quantum information science / Hidden subgroup problem / Combinatorics on words / Quantum computer / Subgroup / Symmetric group / Presentation of a group / Abstract algebra / Mathematics / Group theory

      OPTIMAL MEASUREMENTS FOR THE DIHEDRAL HIDDEN SUBGROUP PROBLEM DAVE BACON, ANDREW M. CHILDS, AND WIM VAN DAM Abstract. We consider the dihedral hidden subgroup problem as the problem of distinguishing hidden subgroup stat

      Add to Reading List

      Source URL: cjtcs.cs.uchicago.edu

      Language: English - Date: 2006-10-12 00:19:53
      7Quantum mechanics / Quantum algorithm / Quantum teleportation / Quantum computer / Quantum key distribution / Hidden subgroup problem / Quantum information / Quantum circuit / Quantum relative entropy / Theoretical computer science / Quantum information science / Applied mathematics

      QIP 2001 Program January 29, 2001 1

      Add to Reading List

      Source URL: homepages.cwi.nl

      Language: English - Date: 2001-01-29 04:38:02
      8Quantum algorithms / Computational complexity theory / Quantum information science / Quantum computer / PP / Algorithm / Hidden subgroup problem / BQP / Theoretical computer science / Applied mathematics / Quantum complexity theory

      On Statistical Query Sampling and NMR Quantum Computing Avrim Blum Ke Yang Abstract

      Add to Reading List

      Source URL: www.cs.cmu.edu

      Language: English - Date: 2003-04-15 22:18:07
      9Quantum algorithms / Cryptography / Group theory / Computational complexity theory / Lattice problem / Lattice / Hidden subgroup problem / Lenstra–Lenstra–Lovász lattice basis reduction algorithm / Quantum computer / Mathematics / Theoretical computer science / Algebra

      On Quantum Sieve Approaches to the Lattice Shortest Vector Problem Daniel Epelbaum December[removed]

      Add to Reading List

      Source URL: www.scottaaronson.com

      Language: English - Date: 2014-12-25 20:29:11
      10

      Nonabelian Hidden Subgroup Problem Ph/CS 219, 9 February 2009 Last time we discussed the HSP for finitely generated abelian groups. For a black box function f: G -> X that is constant and distinct on the cosets of H < G,

      Add to Reading List

      Source URL: www.theory.caltech.edu

      - Date: 2009-02-09 18:24:50
        UPDATE