-
1
-
-
0003779051
-
-
edited by A. J. G. Hey (Perseus Books, Reading
-
R. Landauer in Feynman and Computation, edited by A. J. G. Hey (Perseus Books, Reading, 1999).
-
(1999)
Feynman and Computation
-
-
Landauer, R.1
-
3
-
-
0344734433
-
-
For a history about quantum simulations see, for example, Ref. [2]
-
For a history about quantum simulations see, for example, Ref. [2].
-
-
-
-
4
-
-
0035435494
-
-
G. Ortiz, J. E. Gubernatis, E. Knill, and R. Laflamme, Phys. Rev. A 64 (2001) 22319.
-
(2001)
Phys. Rev. A
, vol.64
, pp. 22319
-
-
Ortiz, G.1
Gubernatis, J.E.2
Knill, E.3
Laflamme, R.4
-
5
-
-
0344302237
-
-
Probabilistic simulations of quantum systems on a CC are mainly performed with the use of the Monte Carlo method, which has the property that the probability distributions achieved represent the desired information efficiently. But they often require exponential sampling to obtain the desired expectation with sufficient accuracy
-
Probabilistic simulations of quantum systems on a CC are mainly performed with the use of the Monte Carlo method, which has the property that the probability distributions achieved represent the desired information efficiently. But they often require exponential sampling to obtain the desired expectation with sufficient accuracy.
-
-
-
-
7
-
-
0345596728
-
-
quant-ph/0108146
-
R. Somma, G. Ortiz, J. E. Gubernatis, E. Knill, and R. Laflamme, quant-ph/0108146.
-
-
-
Somma, R.1
Ortiz, G.2
Gubernatis, J.E.3
Knill, E.4
Laflamme, R.5
-
8
-
-
0035251603
-
-
C.D. Batista and G. Ortiz, unpublished preprint
-
C.D. Batista and G. Ortiz, Phys. Rev. Lett. 86 (2001) 1082. C.D. Batista and G. Ortiz, unpublished preprint.
-
(2001)
Phys. Rev. Lett.
, vol.86
, pp. 1082
-
-
Batista, C.D.1
Ortiz, G.2
-
9
-
-
0344302236
-
-
j
-
j.
-
-
-
-
10
-
-
0345596727
-
-
j - 1
-
j - 1.
-
-
-
-
11
-
-
0345164653
-
-
We are aware of at least one case where the sign problem can be mapped onto a 3-SAT problem, i.e., an NP-complete problem [7]. Therefore, one cannot yet claim that a QC can solve "all" sign problems, otherwise one would claim that one is solving all NP-complete problems and this has not been rigorously established
-
We are aware of at least one case where the sign problem can be mapped onto a 3-SAT problem, i.e., an NP-complete problem [7]. Therefore, one cannot yet claim that a QC can solve "all" sign problems, otherwise one would claim that one is solving all NP-complete problems and this has not been rigorously established.
-
-
-
-
12
-
-
0344302235
-
-
unpublished preprint
-
C. Negrevergne et al., unpublished preprint.
-
-
-
Negrevergne, C.1
-
15
-
-
0345596726
-
-
quant-ph/0109072
-
C. Miquel, J. P. Paz, M. Saraceno, E. Knill, R. Laflamme, and C. Negrevergne, quant-ph/0109072.
-
-
-
Miquel, C.1
Paz, J.P.2
Saraceno, M.3
Knill, E.4
Laflamme, R.5
Negrevergne, C.6
|