Basic concepts in quantum computation - INSPIRE

DataBETA

Basic concepts in quantum computation

Nov 2, 2000

37 pages

Published in:

LHSUMMER, 72

ISBN:

9783540410478 (Print),
9783540453383 (eBook)

Published: 2002 in Heidelberg by Springer

e-Print:

quant-ph/0011013 [quant-ph]

DOI:

10.1007/3-540-45338-5_10 (publication)

View in:

ADS Abstract Service

reference search18 citations

Citations per year

Abstract: (arXiv)

Section headings: 1 Qubits, gates and networks 2 Quantum arithmetic and function evaluations 3 Algorithms and their complexity 4 From interferometers to computers 5 The first quantum algorithms 6 Quantum search 7 Optimal phase estimation 8 Periodicity and quantum factoring 9 Cryptography 10 Conditional quantum dynamics 11 Decoherence and recoherence 12 Concluding remarks

Note:

37 pages, lectures given at les Houches Summer School on "Coherent Matter Waves", July-August 1999

References(54)

Figures(0)

[1]

Quantum coding

Benjamin Schumacher
(
- Kenyon Coll.
)

- Phys.Rev.A 51 (1995) 4, 2738
•
DOI:
- 10.1103/PhysRevA.51.2738

[2]

D

- Proc.Roy.Soc.Lond.A A 425 (1989) 73

[3]

A single quantum cannot be cloned

W.K. Wootters
(
- Texas U. and
- Caltech
)
,
W.H. Zurek
(
- Texas U. and
- Caltech
)

- Nature 299 (1982) 802-803
•
DOI:
- 10.1038/299802a0

[4]

Elementary gates for quantum computation

Adriano Barenco
(
- Oxford U.
)
,
Charles H. Bennett
(
- IBM Watson Res. Ctr.
)
,
Richard Cleve
(
- Calgary U.
)
,
David P. DiVincenzo
(
- IBM Watson Res. Ctr.
)
,
Norman Margolus
(
- MIT, LNS
)

et al.

- Phys.Rev.A 52 (1995) 3457
•
e-Print:
- quant-ph/9503016
•
DOI:
- 10.1103/PhysRevA.52.3457

[5]

D

A. Barenco
,
A. Ekert

- Proc.Roy.Soc.Lond.A A 449 (1995) 669

[6]

Conditional quantum dynamics and logic gates

- Phys.Rev.Lett. 74 (1995) 4083-4086
•
e-Print:
- quant-ph/9503017
•
DOI:
- 10.1103/PhysRevLett.74.4083

[7]

Two-bit gates are universal for quantum computation

David P. DiVincenzo
(
- IBM Watson Res. Ctr.
)

- Phys.Rev.A 51 (1995) 1015-1022
•
e-Print:
- cond-mat/9407022
•
DOI:
- 10.1103/PhysRevA.51.1015

[8]

Almost Any Quantum Logic Gate is Universal

Seth Lloyd
(
- Unlisted
)

- Phys.Rev.Lett. 75 (1995) 346-349
•
DOI:
- 10.1103/PhysRevLett.75.346

[9]

An Introduction to the Theory of Numbers (Oxford University Press, Oxford,)

G.H. Hardy
,
E.M. Wright

[10]

T. Toffoli

- Math.Syst.Theor. 14 (1981) 13

[11]

Computational Complexity

C.H. Papadimitriou

[12]

IBM Research report

D. Coppersmith

[13]

J. Comp

R. Solovay
,
V. Strassen

[14]

Randomised Algorithms (Cambridge University Press,)

R. Motwani
,
P. Raghavan

[15]

Algorithms for quantum computation: Discrete logarithms and factoring

P.W. Shor

[15]

Proc. 35th Annual Symposium on the Foundations of Computer Science, p. 124

S. Goldwasser

[16]

Simulating physics with computers

Richard P. Feynman
(
- Caltech
)

- Int.J.Theor.Phys. 21 (1982) 467-488,
•
DOI:
- 10.1007/BF02650179

[17]

R. Cleve
,
A. Ekert
,
C. Macchiavello
,
M. Mosca

- Proc.Roy.Soc.Lond.A A 454 (1998) 339

[18]

D

- Proc.Roy.Soc.Lond.A A 400 (1985) 97

[19]

A fast quantum mechanical algorithm for database search

L.K. Grover

[20]

Proc. of the Workshop on Physics and Computation (PhysComp96) 36

M. Boyer
,
G. Brassard
,
P. Hoyer
,
A. Tapp

[21]

A Framework for structured quantum search

Tad Hogg
(
- Xerox, Palo Alto
)

- Physica D 120 (1998) 102-116
•
e-Print:
- quant-ph/9701013
•
DOI:
- 10.1016/S0167-2789(98)00047-5

[22]

Grover's quantum searching algorithm is optimal

Christof Zalka
(
- Los Alamos
)

- Phys.Rev.A 60 (1999) 2746
•
e-Print:
- quant-ph/9711070
•
DOI:
- 10.1103/PhysRevA.60.2746

[23]

Quantum measurements and the Abelian stabilizer problem

A.Yu. Kitaev
(
- Landau Inst.
)

e-Print:
- quant-ph/9511026

[24]

Quantum networks for elementary arithmetic operations

- Phys.Rev.A 54 (1996) 147
•
e-Print:
- quant-ph/9511018
•
DOI:
- 10.1103/PhysRevA.54.147

1-25 of 54
1
2
3
25 / page