Rydberg Atoms/Quantum simulation

From Wikiversity
Jump to navigation Jump to search

Simulating the time evolution of a quantum many-body system on a classical computer is believed to be a task that requires resources that grow exponentially with the size of the system [1]. The underlying lies in the tensor product structure of the composite Hilbert space, meaning that for every -level system added to the problem, the number of basis states in the system increases by a factor of . While there are sophisticated concepts, e.g., based on matrix product states [2], these only work in specific instances and an efficient simulation of quantum many-body dynamics on classical computers is not possible.

In 1982, Richard Feynman realized that in order to overcome this exponential scaling, the simulation device itself would have to be governed by quantum mechanics, from which the idea of quantum simulation was born [3]. Building a quantum simulator requires to have excellent control over the degrees of freedom represented by the quantum device. This has led to two different routes for designing a quantum simulation. One possibility is to build a specific device that is exactly undergoing the same Hamiltonian evolution as the simulated system. Such devices are called analog quantum simulators. For instance, a many-body system of laser driven Rydberg atoms in the limit of small blockade radius could be called a quantum simulator of the Ising model. The other possibility is to construct a device that is, in principle, capable to simulate the dynamics of any other quantum system. Similar to classical computers, this works best when the simulation dynamics becomes discrete, i.e., the simulator reproduces the state of the simulated system only at certain timesteps , while in between the state of the simulator can be completely different. Such an approach is known as digital quantum simulator. For practical purposes, we restrict the definition of such a universal quantum simulator to the simulation of Hamiltonians with short-ranged interactions [4], as all physical interactions reduce to purely local interaction at some point. Similar to simulations on classical computers, it is also helpful to introduce abstraction layers so that we can use suitable approximations for the inner workings of the quantum simulator. If we decide to ignore the actual physical implementation for now, the lowest level we can consider is given by quantum logic gates, which have originally been discussed in the context of quantum computing [5]

Quantum logic gates[edit | edit source]

Quantum logic gates are represented by unitary matrices that transform the quantum state before the operation into another after the application of the quantum gate. As such, they can be seen as the time-evolution operator acting for discrete timesteps,

The basis set for the quantum state is given by a product basis of two-level systems (quantum bits or "qubits"),

We can also think of the operation to be constructed out of several smaller building blocks,

For simplicity, we want to restrict ourselves to a universal set of quantum gates that can be used to construct any other gate from it. This can be realized by a set of three quantum gates, including the rotation gate,

where is an arbitrary rotation angle. To construct any other single qubit quantum gate, we need a second gate that does not commute with . The most convenient choice is the Hadamard gate given by

The Hadamard gate can be used to transform into and vice versa, i.e.,

Note that while the Hadamard gate is Hermitian, , most quantum gates are not. Finally, rotations about the axis can be constructed as

Single qubit rotation do not allow us to generate entanglement between the qubits. Therefore, it is necessary to include a two-qubit quantum gate, which is most coveniently chosen as the controlled-not (CNOT) gate, acting on two qubits and as

Its function can be understood as follows: If the "control" qubit is in the 0 state, nothing happens. However, if is in 1, the target qubit gets flipped by the operation. As an example, let us study the creation of entanglement between two qubits by a gate sequence consisting of a single Hadamard gate, followed by a CNOT operation. The qubits are initialized in the product state . Then, we have

which is a maximally entangled state as its reduced density matrix is the maximally mixed state. The set of , , and forms a universal set for all -qubit quantum gates [6].

Circuit representation of the Hadamard gate.
Circuit reprensation of the CNOT gate.

It is often convenient to use a pictorial representation for quantum gate networks, also known as quantum circuits. Each qubit is represented by a straight line, with the horizontal axis denoting time, and each single qubit gate is shown a rectangular box acting on the particular qubit. Two-qubit gates are represented in a similar way, with the control qubit being indicated by a small circle, see Fig. 1. In this notation, much more complex quantum circuits can be represented and analyzed, for instance the decomposition of the Toffoli gate,

which is a 3-qubit variant of the CNOT gate and is universal for all classical computations. It can be constructed from elementary gates, see Fig. 2, where [5].

Decomposition of the Toffoli gate into elementary quantum gates.

Digital simulation procedure[edit | edit source]

Suppose we want to simulate a four-body spin interaction of the form

This four-body spin operator has two eigenvalues, , which are eightfold degenerate. The key idea is to use an additional auxiliary particle and encode the eigenvalue into its spin state. If the auxiliary control spin is initially in , this can be done using the gate sequence

To understand this in more detail, let us look at the behavior of the gate sequence on the spin state , where labels the state within the degenerate manifold. The first Hadamard gate will yield

Applying the sequence of CNOT gates will multiply the eigenvalue of the spin interaction, conditional on the control spin being in ,

Finally, the second Hadamard gate will give us


Consequently, we have mapped the eigenvalue of the four-body interaction operator onto the state of a single auxiliary spin.

The full quantum simulation of the dynamics can then be realized by applying a rotation to the control spin and reverse the mapping ,

The phase of the rotation is related to the timescale of the simulation according to .

For a many-body system, the full dynamics can be simulated if the gate sequences are applied in parallel (if they act on independent spins) or sequentially (if they act on the same spins). However, in case of non-commuting operators, one has to ensure that this sequential operations does not introduce errors. This is true if the timestep of the simulation procedure is sufficiently small, as can be seen from the Suzuki-Trotter expansion

This completes the toolbox required for the realization of a universal quantum simulator.

  1. Cite error: Invalid <ref> tag; no text was provided for refs named Bernstein1997
  2. Cite error: Invalid <ref> tag; no text was provided for refs named Schollwock2011
  3. Cite error: Invalid <ref> tag; no text was provided for refs named Feynman1982
  4. Lloyd, Seth (1996-08-23). "Universal Quantum Simulators". Science 273 (5278): 1073-1078. doi:10.1126/science.273.5278.1073. ISSN 1095-9203 0036-8075, 1095-9203. http://www.sciencemag.org/content/273/5278/1073. Retrieved 2013-06-26. 
  5. 5.0 5.1 Nielsen, Michael A; Chuang, Isaac L (2010). Quantum computation and quantum information. Cambridge, UK: Cambridge University Press. ISBN 9781107002173.
  6. Barenco, Adriano; Charles H. Bennett, Richard Cleve, David P. DiVincenzo, Norman Margolus, Peter Shor, Tycho Sleator, John A. Smolin, Harald Weinfurter (1995-11-01). "Elementary gates for quantum computation". Physical Review A 52 (5): 3457-3467. doi:10.1103/PhysRevA.52.3457. http://link.aps.org/doi/10.1103/PhysRevA.52.3457. Retrieved 2013-06-27.