### Abstract

We present the first explicit connection between quantum computation and lattice problems. Namely, we show a solution to the Unique Shortest Vector Problem (SVP) under the assumption that there exists an algorithm that solves the hidden subgroup problem on the dihedral group by coset sampling. Moreover, we solve the hidden subgroup problem on the dihedral group by using an average case subset sum routine. By combining the two results, we get a quantum reduction from Θ̃ (n^{2.5})-unique-SVP to the average case subset sum problem. This is a better connection than the known classical results.

Original language | English (US) |
---|---|

Title of host publication | Annual Symposium on Foundations of Computer Science - Proceedings |

Editors | D.C. Martin |

Pages | 520-529 |

Number of pages | 10 |

State | Published - 2002 |

Event | The 34rd Annual IEEE Symposium on Foundations of Computer Science - Vancouver, BC, Canada Duration: Nov 16 2002 → Nov 19 2002 |

### Other

Other | The 34rd Annual IEEE Symposium on Foundations of Computer Science |
---|---|

Country | Canada |

City | Vancouver, BC |

Period | 11/16/02 → 11/19/02 |

### Fingerprint

### ASJC Scopus subject areas

- Hardware and Architecture

### Cite this

*Annual Symposium on Foundations of Computer Science - Proceedings*(pp. 520-529)

**Quantum computation and lattice problems.** / Regev, Oded.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Annual Symposium on Foundations of Computer Science - Proceedings.*pp. 520-529, The 34rd Annual IEEE Symposium on Foundations of Computer Science, Vancouver, BC, Canada, 11/16/02.

}

TY - GEN

T1 - Quantum computation and lattice problems

AU - Regev, Oded

PY - 2002

Y1 - 2002

N2 - We present the first explicit connection between quantum computation and lattice problems. Namely, we show a solution to the Unique Shortest Vector Problem (SVP) under the assumption that there exists an algorithm that solves the hidden subgroup problem on the dihedral group by coset sampling. Moreover, we solve the hidden subgroup problem on the dihedral group by using an average case subset sum routine. By combining the two results, we get a quantum reduction from Θ̃ (n2.5)-unique-SVP to the average case subset sum problem. This is a better connection than the known classical results.

AB - We present the first explicit connection between quantum computation and lattice problems. Namely, we show a solution to the Unique Shortest Vector Problem (SVP) under the assumption that there exists an algorithm that solves the hidden subgroup problem on the dihedral group by coset sampling. Moreover, we solve the hidden subgroup problem on the dihedral group by using an average case subset sum routine. By combining the two results, we get a quantum reduction from Θ̃ (n2.5)-unique-SVP to the average case subset sum problem. This is a better connection than the known classical results.

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

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

M3 - Conference contribution

SP - 520

EP - 529

BT - Annual Symposium on Foundations of Computer Science - Proceedings

A2 - Martin, D.C.

ER -