Limitations of quantum coset states for graph isomorphism

Sean Hallgren, Cristopher Moore, Martin Rötteler, Alexander Russell, Pranab Sen

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by solving instances of the HSP. A common feature of the resulting algorithms is the use of quantum coset states, which encode the hidden subgroup. An open question has been how hard it is to use these states to solve graph isomorphism. It was recently shown by Moore et al. [2005] that only an exponentially small amount of information is available from one, or a pair of coset states. A potential source of power to exploit are entangled quantum measurements that act jointly on many states at once. We show that entangled quantum measurements on at least Ω (n log n) coset states are necessary to get useful information for the case of graph isomorphism, matching an information theoretic upper bound. This may be viewed as a negative result because in general it seems hard to implement a given highly entangled measurement. Our main theorem is very general and also rules out using joint measurements on few coset states for some other groups, such as GL(n, F pm) and Gn where G is finite and satisfies a suitable property.

Original languageEnglish (US)
Article number34
JournalJournal of the ACM
Volume57
Issue number6
DOIs
StatePublished - Oct 1 2010

Fingerprint

Quantum computers

All Science Journal Classification (ASJC) codes

  • Software
  • Control and Systems Engineering
  • Information Systems
  • Hardware and Architecture
  • Artificial Intelligence

Cite this

Hallgren, Sean ; Moore, Cristopher ; Rötteler, Martin ; Russell, Alexander ; Sen, Pranab. / Limitations of quantum coset states for graph isomorphism. In: Journal of the ACM. 2010 ; Vol. 57, No. 6.
@article{aa6b32bb7c0c4773bc6df36562d26f85,
title = "Limitations of quantum coset states for graph isomorphism",
abstract = "It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by solving instances of the HSP. A common feature of the resulting algorithms is the use of quantum coset states, which encode the hidden subgroup. An open question has been how hard it is to use these states to solve graph isomorphism. It was recently shown by Moore et al. [2005] that only an exponentially small amount of information is available from one, or a pair of coset states. A potential source of power to exploit are entangled quantum measurements that act jointly on many states at once. We show that entangled quantum measurements on at least Ω (n log n) coset states are necessary to get useful information for the case of graph isomorphism, matching an information theoretic upper bound. This may be viewed as a negative result because in general it seems hard to implement a given highly entangled measurement. Our main theorem is very general and also rules out using joint measurements on few coset states for some other groups, such as GL(n, F pm) and Gn where G is finite and satisfies a suitable property.",
author = "Sean Hallgren and Cristopher Moore and Martin R{\"o}tteler and Alexander Russell and Pranab Sen",
year = "2010",
month = "10",
day = "1",
doi = "10.1145/1857914.1857918",
language = "English (US)",
volume = "57",
journal = "Journal of the ACM",
issn = "0004-5411",
publisher = "Association for Computing Machinery (ACM)",
number = "6",

}

Limitations of quantum coset states for graph isomorphism. / Hallgren, Sean; Moore, Cristopher; Rötteler, Martin; Russell, Alexander; Sen, Pranab.

In: Journal of the ACM, Vol. 57, No. 6, 34, 01.10.2010.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Limitations of quantum coset states for graph isomorphism

AU - Hallgren, Sean

AU - Moore, Cristopher

AU - Rötteler, Martin

AU - Russell, Alexander

AU - Sen, Pranab

PY - 2010/10/1

Y1 - 2010/10/1

N2 - It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by solving instances of the HSP. A common feature of the resulting algorithms is the use of quantum coset states, which encode the hidden subgroup. An open question has been how hard it is to use these states to solve graph isomorphism. It was recently shown by Moore et al. [2005] that only an exponentially small amount of information is available from one, or a pair of coset states. A potential source of power to exploit are entangled quantum measurements that act jointly on many states at once. We show that entangled quantum measurements on at least Ω (n log n) coset states are necessary to get useful information for the case of graph isomorphism, matching an information theoretic upper bound. This may be viewed as a negative result because in general it seems hard to implement a given highly entangled measurement. Our main theorem is very general and also rules out using joint measurements on few coset states for some other groups, such as GL(n, F pm) and Gn where G is finite and satisfies a suitable property.

AB - It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by solving instances of the HSP. A common feature of the resulting algorithms is the use of quantum coset states, which encode the hidden subgroup. An open question has been how hard it is to use these states to solve graph isomorphism. It was recently shown by Moore et al. [2005] that only an exponentially small amount of information is available from one, or a pair of coset states. A potential source of power to exploit are entangled quantum measurements that act jointly on many states at once. We show that entangled quantum measurements on at least Ω (n log n) coset states are necessary to get useful information for the case of graph isomorphism, matching an information theoretic upper bound. This may be viewed as a negative result because in general it seems hard to implement a given highly entangled measurement. Our main theorem is very general and also rules out using joint measurements on few coset states for some other groups, such as GL(n, F pm) and Gn where G is finite and satisfies a suitable property.

UR - http://www.scopus.com/inward/record.url?scp=78649239030&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78649239030&partnerID=8YFLogxK

U2 - 10.1145/1857914.1857918

DO - 10.1145/1857914.1857918

M3 - Article

VL - 57

JO - Journal of the ACM

JF - Journal of the ACM

SN - 0004-5411

IS - 6

M1 - 34

ER -