341 search results - page 12 / 69 » Quantum Computation and Lattice Problems |
120
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
119
click to vote
ISCA
2007
IEEE
15 years 1 months ago
2007
IEEE
In recent years, quantum computing (QC) research has moved from the realm of theoretical physics and mathematics into real implementations [9]. With many different potential hardw...
114
click to vote
QCQC
1998
Springer
15 years 5 months ago
1998
Springer
Abstract. A quantum computer can efficiently find the order of an element in a group, factors of composite integers, discrete logarithms, stabilisers in Abelian groups, and hidden ...
JC
2006
15 years 1 months ago
2006
106
click to vote
QCQC
1998
Springer
15 years 5 months ago
1998
Springer
In order to design a quantum circuit that performs a desired quantum computation, it is necessary to find a decomposition of the unitary matrix that represents that computation in ...