Hidden subgroup problem

Results: 21



#Item
1Graph 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

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
2Graph 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

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
3An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups ∗ G´abor Ivanyos† Luc Sanselme‡

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
    4An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups ∗ G´abor Ivanyos† Luc Sanselme‡

    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
      5Mathematical Challenges in Quantum Algorithms Ashley Montanaro Department of Computer Science, University of Bristol

      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
      6OPTIMAL 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

      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
      7QIP 2001 Program January 29, 2001 1

      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
      8On Statistical Query Sampling and NMR Quantum Computing Avrim Blum Ke Yang Abstract

      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
      9On Quantum Sieve Approaches to the Lattice Shortest Vector Problem Daniel Epelbaum December[removed]

      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
      10Nonabelian 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,

      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