Parameter definability in the recursively enumerable degrees, to appear (0)

by A Nies
Venue:1997], Logic for Applications
Add To MetaCart
Results 1 - 1 of 1

Abstract

by Cristopher Moore, Alexander Russell
"... We present an explicit measurement in the Fourier basis that solves an important case of the Hidden Subgroup Problem, including the case to which Graph Isomorphism reduces. This entangled measurement uses k = log 2 |G | registers, and each of the 2 k subsets of the registers contributes some informa ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
We present an explicit measurement in the Fourier basis that solves an important case of the Hidden Subgroup Problem, including the case to which Graph Isomorphism reduces. This entangled measurement uses k = log 2 |G | registers, and each of the 2 k subsets of the registers contributes some information. 1