Sciweavers

341 search results - page 7 / 69
» Quantum Computation and Lattice Problems
Sort
View
SODA
2003
ACM
100views Algorithms» more  SODA 2003»
13 years 9 months ago
Quantum algorithms for some hidden shift problems
Almost all of the most successful quantum algorithms discovered to date exploit the ability of the Fourier transform to recover subgroup structure of functions, especially periodi...
Wim van Dam, Sean Hallgren, Lawrence Ip
EUROCRYPT
2005
Springer
14 years 1 months ago
Computational Indistinguishability Between Quantum States and Its Cryptographic Application
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is “secu...
Akinori Kawachi, Takeshi Koshiba, Harumichi Nishim...
IAJIT
2010
114views more  IAJIT 2010»
13 years 6 months ago
A Quantum-Inspired Differential Evolution Algorithm for Solving the N-Queens Problem
: In this paper, a quantum-inspired differential evolution algorithm for solving the N-queens problem is presented. The N-queens problem aims at placing N queens on an NxN chessboa...
Amer Draa, Souham Meshoul, Hichem Talbi, Mohamed B...
IPL
2006
104views more  IPL 2006»
13 years 7 months ago
The communication complexity of the Hamming distance problem
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
Wei Huang, Yaoyun Shi, Shengyu Zhang, Yufan Zhu
CORR
2004
Springer
94views Education» more  CORR 2004»
13 years 7 months ago
Quantum Computing, Postselection, and Probabilistic Polynomial-Time
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
Scott Aaronson