# Universal Quantum Simulators

@article{Lloyd1996UniversalQS, title={Universal Quantum Simulators}, author={Seth Lloyd}, journal={Science}, year={1996}, volume={273}, pages={1073 - 1078} }

Feynman's 1982 conjecture, that quantum computers can be programmed to simulate any local quantum system, is shown to be correct.

## 1,864 Citations

Universal quantum processors with arbitrary radix n

- PhysicsOFC 2001
- 2001

Here is discussed the Hamiltonian approach to construction of deterministic universal (in approximate sense) programmable quantum circuits with qubits or any other quantum systems with dimension of…

A bird's eye view of quantum computers

- Physics
- 2007

Quantum computers are discussed in the general framework of computation, the laws of physics and the foundations of quantum mechanics.

QUANTUM MODELS AND MODES OF COMPUTATION AND COMMUNICATION (Algebraic Systems, Formal Languages and Computations)

- Computer Science
- 2000

The paper deals with the main approaches to quantum computing and communication models and modes, and in addition, it investigates the role of quantum entanglement in the design of quantum devices.

Quantum Computer Systems: Research for Noisy Intermediate-Scale Quantum Computers

- Physics, Computer ScienceQuantum Computer Systems
- 2020

Abstract This book targets computer scientists and engineers who are familiar with concepts in classical computer systems but are curious to learn the general architecture of quantum computing syst...

Hybrid Quantum Computing

- Computer Science, Physics
- 2003

Necessary and sufficient conditions are given for the construction of a hybrid quantum computer that operates on both continuous and discrete quantum variables that are more efficient than conventional quantum computers for performing a variety of quantum algorithms.

Unconventional Quantum Computing Devices

- Physics, Computer Science
- 2000

It is shown that unconventional quantum computing devices can in principle compute some quantities more rapidly than `conventional' quantum computers.

Superposition, entanglement, and raising Schrödinger's cat

- Physics
- 2013

Experimental control of quantum systems has been pursued widely since the invention of quantum mechanics. Today, we can in fact experiment with individual quantum systems, deterministically preparing…

Quantum Simulation with a Quantum Computer

- Physics
- 2011

A fundamentally new approach to the simulation of quantum systems is needed because certain quantum phenomena are not intrinsically simulatable by any classical device unless they are introduced artificial hidden variables.

Dynamical Localization Simulated on Actual Quantum Hardware

- PhysicsEntropy
- 2021

It is shown that dynamical localization of the quantum sawtooth map, a highly sensitive quantum coherent phenomenon, can be simulated on actual, small-scale quantum processors.

## References

SHOWING 1-10 OF 51 REFERENCES

Quantum mechanical computers

- Physics
- 1986

The physical limitations, due to quantum mechanics, on the functioning of computers are analyzed.

Universality in quantum computation

- PhysicsProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences
- 1995

We show that in quantum computation almost every gate that operates on two or more bits is a universal gate. We discuss various physical considerations bearing on the proper definition of…

Scheme for reducing decoherence in quantum computer memory.

- PhysicsPhysical review. A, Atomic, molecular, and optical physics
- 1995

In the mid-1990s, theorists devised methods to preserve the integrity of quantum bits\char22{}techniques that may become the key to practical quantum computing on a large scale.

Realizable Universal Quantum Logic Gates.

- PhysicsPhysical review letters
- 1995

This work identifies a 2-bit quantum gate that is sufficient to build any quantum logic network and proposes an explicit construction of this gate, which is based on cavity QED techniques and may be realizable with current technology.

Rapid solution of problems by quantum computation

- Computer ScienceProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences
- 1992

A class of problems is described which can be solved more efficiently by quantum computation than by any classical or stochastic method. The quantum computation solves the problem with certainty in…

Quantum computers and dissipation

- PhysicsProceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
- 1996

We analyse dissipation in quantum computation and its destructive impact on the efficiency of quantum algorithms. Using a general model of decoherence, we study the time evolution of a quantum…

Quantum Mechanical Models of Turing Machines That Dissipate No Energy

- Physics
- 1982

Quantum mechanical Hamiltonian models of Turing machines are constructed here on a finite lattice of spin-\textonehalf{} systems. The models do not dissipate any energy and they operate at the…

Quantum computational networks

- Physics, Computer ScienceProceedings of the Royal Society of London. A. Mathematical and Physical Sciences
- 1989

The theory of quantum computational networks is the quantum generalization of the theory of logic circuits used in classical computing machines, and a single type of gate, the universal quantum gate, together with quantum ‘unit wires' is adequate for constructing networks with any possible quantum computational property.

Conditional Quantum Dynamics and Logic Gates.

- PhysicsPhysical review letters
- 1995

A simple quantum logic gate, the quantum controlled-NOT, is described, and two possible physical realizations of the gate are discussed, one based on Ramsey atomic interferometry and the other on the selective driving of optical resonances of two subsystems undergoing a dipole-dipole interaction.

Reversible logic and quantum computers.

- PhysicsPhysical review. A, General physics
- 1985

The construction of a quantum-mechanical Hamiltonian describing a computer generates a dynamical evolution which mimics a sequence of elementary logical steps if each logical step is locally reversible (global reversibility is insufficient).