Simulation of many body Fermi systems on a universal quantum computer - INSPIRE

DataBETA

Simulation of many body Fermi systems on a universal quantum computer

Daniel S. Abrams
(
- MIT
)
,
Seth Lloyd
(
- MIT
)

Mar, 1997

10 pages

Published in:

Phys.Rev.Lett. 79 (1997) 2586-2589

e-Print:

quant-ph/9703054 [quant-ph]

DOI:

10.1103/PhysRevLett.79.2586

View in:

ADS Abstract Service

reference search410 citations

Citations per year

Abstract:

We provide fast algorithms for simulating many body Fermi systems on a universal quantum computer. Both first and second quantized descriptions are considered, and the relative computational complexities are determined in each case. In order to accommodate fermions using a first quantized Hamiltonian, an efficient quantum algorithm for anti-symmetrization is given. Finally, a simulation of the Hubbard model is discussed in detail.

Note:

Submitted 11/7/96 to Phys. Rev. Lett. 10 pages, 0 figures

References(27)

Figures(0)

Demonstration of a Fundamental Quantum Logic Gate

- Phys.Rev.Lett. 75 (1995) 4714-4717
•
DOI:
- 10.1103/PhysRevLett.75.4714

Measurement of conditional phase shifts for quantum logic

- Phys.Rev.Lett. 75 (1995) 4710-4713
•
e-Print:
- quant-ph/9511008
•
DOI:
- 10.1103/PhysRevLett.75.4710

- Phys.Rev.A 52 3554

- Phys.Rev.A 52 2493

Quantum Computations with Cold Trapped Ions

J.I. Cirac
(
- Innsbruck U.
)
,
P. Zoller
(
- Innsbruck U.
)

- Phys.Rev.Lett. 74 (1995) 4091-4094
•
DOI:
- 10.1103/PhysRevLett.74.4091

A Potentially Realizable Quantum Computer

Seth Lloyd
(
- Los Alamos
)

- Science 261 (1993) 5128, 1569-1571
•
DOI:
- 10.1126/science.261.5128.1569

Realizable Universal Quantum Logic Gates

Tycho Sleator
(
- New York U.
)
,
Harald Weinfurter
(
- Innsbruck U.
)

- Phys.Rev.Lett. 74 (1995) 4087-4090
•
DOI:
- 10.1103/PhysRevLett.74.4087

Conditional quantum dynamics and logic gates

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

- Phys.Rev.B 37 8096

Quantum Computation

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

- Science 270 (1995) 5234, 255-261
•
DOI:
- 10.1126/science.270.5234.255

Quantum computation and Shor's factoring algorithm

Artur Ekert
(
- Oxford U. and
- Plymouth U.
)
,
Richard Jozsa
(
- Oxford U. and
- Plymouth U.
)

- Rev.Mod.Phys. 68 (1996) 733-753
•
DOI:
- 10.1103/RevModPhys.68.733

Maintaining coherence in quantum computers

W.G. Unruh
(
- British Columbia U.
)

- Phys.Rev.A 51 (1995) 992
•
e-Print:
- hep-th/9406058
•
DOI:
- 10.1103/PhysRevA.51.992

Quantum computers and dissipation

G. Massimo Palma
(
- Oxford U.
)
,
Kalle-Antti Suominen
(
- Helsinki U.
)
,
Artur K. Ekert
(
- Oxford U.
)

- Proc.Roy.Soc.Lond.A 452 (1996) 567-584
•
e-Print:
- quant-ph/9702001
•
DOI:
- 10.1098/rspa.1996.0029

- Proc.Roy.Soc.Lond.A 353 367

Quantum computers, factoring and decoherence

I.L. Chuang
(
- Stanford U., Ginzton Lab.
)
,
Raymond Laflamme
(
- Los Alamos
)
,
P. Shor
(
- Bell Labs
)
,
W.H. Zurek
(
- Los Alamos
)

- Science 270 (1995) 1633
•
e-Print:
- quant-ph/9503007
•
DOI:
- 10.1126/science.270.5242.1633

Efficient networks for quantum factoring

- Phys.Rev.A 54 (1996) 1034-1063
•
e-Print:
- quant-ph/9602016
•
DOI:
- 10.1103/PhysRevA.54.1034

Universal Quantum Simulators

Seth Lloyd
(
- MIT
)

- Science 273 (1996) 5278, 1073
•
DOI:
- 10.1126/science.273.5278.1073

Simulating physics with computers

Richard P. Feynman
(
- Caltech
)

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

- Proc.Roy.Soc.Lond.A 439 553

Almost Any Quantum Logic Gate is Universal

Seth Lloyd
(
- Unlisted
)

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

Universality in quantum computation

- Proc.Roy.Soc.Lond.A 449 (1995) 669
•
e-Print:
- quant-ph/9505018
•
DOI:
- 10.1098/rspa.1995.0065

- Proc.Roy.Soc.Lond.A 400 97

- Proc.Roy.Soc.Lond.A 425 75

- Annals Phys. 480 487

- Phys.Rev.Lett. 48 1581

1-25 of 27
1
2
25 / page