1 Introduction
Storing, exchanging and processing of information has always been a defining aspect of human culture. With the rise of semiconductor technology and microelectronics, it became possible to encode virtually every type of information electronically. By now, we have become accustomed to having digitally encoded information available at our fingertips, with continuously increasing speed of communication and processing, and virtually limitless storage capacity. On the level of the material basis, this is the result of great advances in the capacity and speed of the computer hardware.
While these improvements have continued at a steady pace [
1], it is now becoming clear that there are limits to this process that are starting to make it ever more difficult to continue this trend [
2]. Some of these limits are technological in nature and a large number of ingenious engineers are working hard to find ways around these obstacles; examples are speed limits that may be overcome by adjustments to the manufacturing process, e.g., switching from silicon to silicon-germanium or using new types of insulator materials.
A second type of problems are fundamental physical problems, such as the limitations on the size of electronic circuits by the finite size of atoms or the amount of heat being dissipated by the electronic circuits [
3]. These limitations are much more fundamental and cannot be overcome by simply switching the material basis of the electronic circuit technology. The third type of limitations are software: there are a number of computational problems where no efficient solution is known. Here, examples include optimization problems like the “traveling salesman problem” or the factorization of large numbers. Again, for these examples no efficient solutions are known, and it is not even known if they exist.
One possible way around both these fundamental problems was sketched out in 1982, at an international conference on the “Physics of Computation”, organized at the Massachusetts Institute of Technology by Ed Fredkin, Rolf Landauer, and Tom Toffoli. At this conference, several participants explored the fundamental limits that physics imposes on the speed of computation [
4], such as the minimal amount of energy that computational machinery must dissipate. One of the participants was Richard Feynman from Caltech. In his lecture, he discussed the requirements for numerical simulations of quantum mechanical systems and showed that this is also a “hard” problem, i.e. one for which no algorithm is known that scales less than exponentially with the size of the system [
5]. He suggested, however, that it might be possible to get around this obstacle by using quantum mechanical systems as the carriers of information and construct computing devices that operate according to Schrödinger’s equation. That quantum mechanical systems can really be used for storing and processing information was shown by Benioff [
6] by constructing “Quantum mechanical Hamiltonian models of Turing machines”, which are universal computers. Since the time evolution of quantum mechanical systems is a unitary operation and therefore inherently reversible, quantum systems are a specific example of reversible computation, which demonstrates that computation can be performed without any energy dissipation. At that time, it was not known if these devices, now called “quantum computers” can actually be more powerful than classical computers. This conjecture was proven in 1993 by Bernstein and Vazirani [
7], and shortly thereafter, the first algorithms were devised that operate exponentially faster on quantum computers than on classical computers [
8,
9].
Following this idea, Lloyd [
10] showed in 1996 that universal quantum simulators can be built from quantum mechanical systems. Subsequently, quantum simulation algorithms were developed for physical problems [
11–
17], such as the calculation of eigenstates and eigenvectors for given Hamiltonians [
13], the energy spectrum [
14], the spectrum of observables or relevant correlation functions [
11] and the dynamics of many-body Fermi systems [
18] as well as bosonic systems [
12]. Besides these typical physical problems, quantum simulators should also be able to solve chemical problems. Some polynomial-time quantum algorithms have been proposed to perform the simulation for the calculations of the molecular energies [
19,
20], the thermal rate constant of chemical reactions [
21], chemical reactions using quantum dots [
22] and chemical dynamics [
23]. An attractive application of quantum simulations would be to calculate the folding of a protein under conditions of slow cooling.
Quantum simulators may turn out to be the field where quantum computers first successfully challenged classical computers. While algorithms such as Shors factoring algorithm require quantum computers with at least a few thousand qubits, it may be possible to perform useful quantum simulations with quantum computers that incorporate as few as 20–50 qubits. They could be used for a variety of problems in physics, chemistry and biology.
A universal quantum computer is particularly appealing, since it can efficiently simulate the dynamics of any quantum system. However, from the experimental perspective, it may be more efficient to first realize a special-purpose quantum simulator that has less stringent requirements, e.g., on the type of gate operations that can be applied. Some successful examples are quantum simulation of the Bose–Hubbard model using cold atoms in optical lattices [
24,
25] and that of the Anderson model, the Kondo lattice and the multichannel Kondo model using superconducting qubits [
26].
In comparison to this vast body of theoretical work, relatively little experimental work has been published. The first few examples used liquid-state NMR [
27–
31] to simulate, e.g., three spins that are coupled by a 3-particle interaction [
27], the dynamics of truncated quantum harmonic and anharmonic oscillators [
28], or the fermionic Fano–Anderson model for many-body problems [
31]. In the simulations, the average Hamiltonian theory (AHT) [
32] is widely adopted to design appropriate control sequences for certain Hamiltonians to be simulated. Building a small-scale, special-purpose NMR quantum simulator is an interesting and significant work. On the technological side, the developments of operational demonstrations of efficient control of dynamics of few-qubit quantum systems that will be employed for performing quantum simulations will provide the groundwork for large-scale universal quantum simulators based on other physical systems.
In this paper, we first give a brief introduction to NMR quantum information processing (QIP). Based on this, we describe and experimentally demonstrate the quantum simulation of quantum phase transitions (QPTs, an important physical phenomenon in condensed-matter physics) for certain spin chains with many-body interaction on few-qubit liquid-state NMR simulators. Incorporating adiabatic evolution into the Hamiltonian simulation allows one to drive the system through quantum phase transitions and study the ground state properties in the different parameter ranges. In particular, we show the relationship between the ground-state entanglement and QPTs in the critical systems.
The paper is organized as follows: In Section 2, we introduce two quantum computation models: the standard circuit model and adiabatic quantum computation (AQC) model, in which the principles of implementation of quantum computation by NMR QIP are explained. In Section 3, we summarize the general scheme of quantum simulation by NMR QIP. We then describe two methods to complete Hamiltonian simulation, which is the key step in quantum simulation in Section 4. As an important indicator for some quantum phase transitions (QPTs), we explain how to characterize entangled ground states and introduce the concept of quantum phase transitions in Section 5. In Sections 6 and 7, we illustrate these concepts using simple examples in two- and three-qubit systems.
2 Computing with quanta
2.1 Fundamentals
Storing and processing of information are the main tasks of computers. Conventionally, the information is decomposed into bits, i.e., binary digits, which can assume the values 0 or 1. These units of information can be stored in different physical systems that can assume 2 distinct states, e.g., a capacitor with different amounts of charge or the magnetization of a spot on a magnetic disc, which can be oriented in different directions. Processing this information implies that a string of bits is changed into a different string, according to a finite set of instructions called the algorithm. In the case of a quantum computer,the system that represents the information is a quantum mechanical system, and the logical operations correspond to the temporal evolution of this system [
33,
34].
The main difference between the quantum mechanical and the classical computational models is that in classical computers, the information being processed always corresponds to a single string of bits. In quantum mechanical information processors, however, the information being processed can also be a superposition of all the possible strings of bits. The logical operations are then applied to this superposition. Due to the linearity of the Schrödinger equation, the superposition of all possible input states evolves into a superposition of all states that would be obtained by processing the initial states individually. Algorithms taking advantage of this possibility can therefore increase the speed of computation dramatically: in some cases, the speed increases exponentially with the number of qubits of the processor. This possibility of processing superpositions of basis states is often referred to as “quantum parallelism”.
Different computational models exist for converting a given input into the desired solution. The model that has been most thoroughly investigated so far is the so-called circuit or network model [
33,
34], which is closely related to the processing of classical information.
Figure 1 illustrates the basics of the network model of quantum information processing [
35,
36]. The quantum information is stored in a string of qubits called the quantum register. Before the computation can start, this register has to be initialized into an initial state containing the input and, possibly, additional qubits required by the algorithm. Logical operations are then implemented as unitary transformations acting on the qubits. After the last operation, the result has to be read out by measuring suitable observables of some (possibly all) qubits.
2.2 Quantum bits
To store a quantum bit, we need a quantum system (i.e., a physical system that can be described by the laws of quantum mechanics) with two distinct (i.e., orthogonal) states, which we label and . The only physical system that has exactly two orthogonal states is a spin with an angular momentum of . In the context of this review, we will consider nuclear spins with (in units of ), which are easy to manipulate and store the quantum information for a relatively long time, since they are quite well isolated from other degrees of freedom.
While we are in principle free to choose any 2 orthogonal states as the basis states for the computation, one usually opts for the states parallel and anti-parallel to the direction of an external magnetic field as the basis states and labels them
Each qubit can be in an arbitrary superposition of these states,
Like in the classical case, we need a string of qubits to store more information. For instance, a pure state for a string of N qubits is represented by
where the cx are probability amplitudes with
The quantum information is then contained in a state that lives in the Hilbert space spanned by the computational basis states from to .
If the qubits are realized by nuclear spins, it is usually advantageous to choose a spin-1/2 system. Suitable nuclei are 1H, 13C, 19F, 15N, 31P and 29Si. While a spin can store more (quantum-)information than a qubit, and it is possible to exploit this, most algorithms assume that qubits are used. Furthermore, spins have a nuclear quadrupole moment, which is a rather effective mechanism for coupling the spin to its environment and therefore dissipate the quantum information by relaxation.
2.3 Quantum gates for single qubits
Logical operations being applied to the qubits can be described in terms of operators acting on the states. For a single qubit, every operator can be written as a complex matrix and expanded in terms of a basis of four orthogonal operators. Suitable operators are, e.g., the unit operator together with the three spin operators Ix, Iy and Iz:
An equivalent alternative consists of the set , , and Iz.
A logical operation is then represented by a unitary operator
where H is a Hermitian operator describing a physical interaction and τ the duration for which this interaction is active.
All logical operations on information encoded in quantum states can be decomposed into operations on single qubits (single-qubit operations) and operations acting on two qubits (two-qubit operations). The single-qubit operations correspond to rotations of the (pseudo-)spins. In the context of spin-qubits, it is convenient to distinguish between rotations around the z-axis, which corresponds to precession in the static magnetic field, and rotations around axes in the -plane, which are induced by radio-frequency pulses.
The z-rotations require the Zeeman interaction with a static magnetic field. This interaction is represented by the Hamiltonian
where the Larmor frequency is proportional to the strength of the magnetic field B0 and the gyromagnetic ratio γ of the spin.
The rotations around axes in the -plane are generated by pulsed radio-frequency (RF) fields. These operations are best described in the so-called rotating frame, which rotates around the direction of the static magnetic field with a frequency equal to the radio-frequency of the applied field. In this reference frame, the interaction with the RF field becomes static and can be written as:
where is the strength of the RF field and is a direction in the -plane that can be chosen by the phase of the radio-frequency.
Using these interactions, it is possible to perform arbitrary logical operations on individual qubits. Every such operation corresponds to a rotation of the spins. Mathematically, it is described by a unitary transformation:
Here, δ is an overall phase factor, while is a rotation by an angle α around the η axis. Rotations around axes in the -plane can be implemented by suitable radio-frequency pulses, where the rotation angle is given by the product of the nutation frequency and the pulse duration τ, . Similarly, a rotation around the z-axis corresponds to an evolution in the static magnetic field for a suitable period τ.
2.4 Two-qubit operations
Any nontrivial algorithm includes conditional operations. In standard programming languages they are represented by operations like
if,
while or
for. Clearly, such operations operate on more than one (qu)bit: at least one that controls the operation (the control qubit) and at least one on which the operation is performed (the target qubit). It is possible to show that all multi-qubit operations can be decomposed into one- and two-qubit operations [
33,
34]. Therefore, we discuss here only two-qubit operations.
To implement controlled operations in a physical device, information must be exchanged between the qubits participating in the operation. This requires an interaction between them. In the case of spins, this interaction is a spin–spin coupling. In the simplest case (to which we restrict ourselves here), this interaction is represented by the Hamiltonian:
The interaction can be turned into an operation by letting the system evolve under this Hamiltonian. In reality, the coupling operator (2) is only part of the complete system Hamiltonian. For two spins, a typical system Hamiltonian takes the form
Evolution under this Hamiltonian will therefore result in a different logical operation than under the pure coupling operator. To turn this into the desired evolution
we have to refocus the Zeeman-terms using π-pulses (rotations by an angle π around an axis in the -plane) in the middle and at the end of the evolution period. The π rotation of both spins around the x-axis corresponds to the operation
and the free evolution of duration τ to
The sequence of a free evolution period, a π rotation, another free evolution period and another π rotation results therefore in the following evolution:
as required. Depending on the state of the system, the second π-pulse can be omitted.
In the following, we will use the graphical representation of Fig. 2 to represent the single-qubit operation and the two-qubit operation in a quantum network.
Interactions are important because their effect on a quantum state depends not only on the state of a single qubit, but on the state of several (usually 2) qubits. This is essential for implementing multiple qubit operations. Perhaps the most important multi-qubit operation is the controlled-NOT (CNOT) operation: a NOT operation on one qubit (the target qubit) that is only executed if the second qubit (the control qubit) is 1. If the control qubit is zero, the CNOT operation becomes a unity (=NOP) operation. In the 2-qubit basis , this operation can be expressed in matrixform as:
The first qubit is the control-bit: it is never changed by the CNOT operation. The target-bit is inverted if the control-bit has the value 1 and left unchanged if the control-bit is 0. The overall effect is therefore an exchange of the two states and . This operation can be implemented by single-qubit operations and the two-qubit operation as:
Each rotation acts only on a single qubit, indicated by the superscript k. The subscript gives the rotation axis, the argument in parentheses is the rotation angle.
2.5 Multi-qubit quantum gate operations
Universal quantum gate operations on arbitrary numbers of qubits can be decomposed into one- and two-qubit operations. These operations must be applied selectively, i.e., only to those qubits (or pairs of qubits) whose operations are required by the algorithm. In NMR quantum computing, the selective addressing is implemented via resonant excitation. The resonance frequencies of the different spins must therefore be sufficiently different. This is ideally satisfied if the different qubits are represented by different spin species (e.g., 1H, 13C, 15N etc.). However, in most cases, it is necessary to use more than one spin of the same spin species. In this case, the distinction must be accomplished by different chemical shifts.
The internal Hamiltonian of the spins (Zeeman + spin-spin coupling) is time-independent, while gate operations require the Hamiltonian to be switched on and off. This is straightforward for the single-qubit operations, but the two-qubit operations require us to switch the effect of couplings on and off. As we have discussed in the case of a two-qubit system, the two-qubit gate operation can be implemented by a free precession period with refocusing of the chemical shift. The same principle can be used for multi-qubit systems in which couplings are present between all quibts. To implement a two-qubit operation between qubits
i and
k only, we let the system evolve freely, but apply refocusing pulses to spins
i and
k. This refocuses their chemical shift as well as their couplings to all other spins, but leaves the coupling between
i and
k invariant. In most cases, it will be necessary to refocus also the couplings between the other spins and their chemical shifts. We refer to the literature for more details on how to implement these operations [
37–
40].
The scheme that we have discussed so far uses free precession
under the coupling operator to realize two-qubit operations. Alternatively, it is also possible to implement them by selective irradiation of individual transitions in coupled multi-qubit systems (see, e.g., Refs. [
41–
53]). As an example, a transition-selective
π-pulse applied to the transition between the states
implements the operation [
50]:
which is closely related to the CNOT operation. “Transition-selective” means in this context that only the two states and may be affected by the pulse. This implies that the RF pulse must be long compared to the inverse of the coupling constant or, equivalently, that .
This technique of implementing multi-qubit operations by selective RF pulses can also be extended to three-qubit operations (and beyond). As an example, the operation
which closely resembles the quantum TOFFOLI-gate (=CCNOT), has been implemented by transition-selective RF pulses [
50].
2.6 Initialization
Before starting a calculation, the system must be initialized into a well-defined state. In many algorithms, it is assumed that the initial state is the state , which corresponds to the ground state of the spin system. Unfortunately, for nuclear spins in liquids, only a fraction of the spins is in this state. For an ensemble of spins in thermal equilibrium at a temperature K,Boltzmann’s law predicts that the states and are almost equally populated, with an occupation probability of , where at room temperature.
For an ensemble of systems, each consisting of n nuclear spins, the populations of the levels are
where
are the magnetic quantum numbers of the
n spins. This state is very close to the maximally mixed state, where
. Nevertheless, it is possible to coax such a system into simulating systems that are in a pure state, including systems in the ground state. For this purpose, we use the fact that a system, in which initially all states are equally populated, does not contribute to an observable signal. Conceptually, this is easy to understand, since for every spin
, there is exactly one spin
, and the signal contributions from each such pair of spins cancel exactly. It is therefore not necessary to bring all spins into the ground state, but it is sufficient to have an excess
of subsystems in the state
, while all other states are equally populated. This system behaves exactly like a system with all spins in the ground state, except for a signal reduction by
ε. This type of states are referred to as “pseudo-pure” or “effective pure” states. The procedure was originally proposed by Cory
et al. [
54] and by Gershenfeld and Chuang [
55] in 1997.
The correct description of these states is in terms of a density operator
where describes a pure quantum state of n qubits.
These states cannot be prepared from the thermal equilibrium state by unitary operations. Instead, the preparation must include nonunitary processes, which can be generated by averaging over different unitary processes. Different averaging techniques have been proposed, including the
temporal averaging [
56–
58],
spatial averaging [
45,
54,
59–
61],
logical labeling[
44,
55,
56]
spatially averaged logical labeling [
45,
62,
63], using cat states [
64],
pairs of pseudopure states [
65], and so on.
As an example, let us consider the preparation of a pseudo-pure state for a two-spin system by the
spatial averaging method [
54,
66]. If the first spin is a
13C and the second a
1H nuclear spin, the thermal equilibrium state is given by the density operator:
where we have omitted the term proportional to the unity operator and and are, respectively, the gyromagnetic ratios for 13C and 1H. Starting from this state, we first apply an rf pulse to the 1H nuclear spin, thus converting polarization into transverse magnetization. The transverse magnetization can be destroyed by applying a pulsed magnetic field gradient, which dephases spins in different parts of the sample. The resulting state is thus
where we have used . By applying another set of two pulses with an intervening period of free precession, and a second gradient pulse, this state can be converted into
In this state, the population of the ground state is
, while all other states have the population
[
163].
This procedure can be extended to larger systems. As an example, for a three-spin system consisting of
13C,
1H and
19F, it is possible to generate a spatially averaged pseudopure state via the following sequence [
54,
66]:
The main difficulty with this approach is that the preparation eliminates a large fraction of the polarization, resulting in poor sensitivity [
67]. Depending on the system, it is sometimes possible to counter this sensitivity decrease by techniques for polarization enhancement, such as optical pumping, dynamic nuclear polarization, the use of parahydrogen and algorithmic cooling (see Ref. [
68] and references therein).
2.7 Readout
As the last step of the quantum computation, it is necessary to read out the result from the quantum state by performing an appropriate set of measurements. As NMR QIP uses an ensemble of nuclear spin systems, which are only weakly coupled to the detection apparatus, the readout differs from the idealized projective measurements that are usually considered in textbooks on quantum mechanics: in NMR, the quantum state does not collapse, but continues to evolve with very little perturbation. In addition, the results of the measurements are not populations of quantum states, but the expectation values of the transverse magnetization of the spins, Ix and Iy (which can be measured simultaneously).
For most algorithms, it is sufficient to measure the polarization of individual qubits independently. To improve the understanding of the relevant processes and to check individual computational steps, however, it is sometimes useful to determine the complete density operator. This can be achieved via
quantum state tomography: converting those parts of the density operator that are not directly observable, into observable magnetization and subsequently measuring the NMR signal allows one to tomographically reconstruct the density operator [
55]. In the case of a two-qubit system, quantum state tomography can be achieved with the help of four independent readout pulses [
69], in the case of three qubits, the same result can be achieved with seven readout pulses [
70]. For larger systems, the number of readout pulses required to reconstruct the complete density operator increases exponentially with the number of qubits, making this approach unsuitable for large quantum registers. Possible alternatives include a two-demensional Fourier transform technique [
71], but again this approach is not scalable to very large systems.
2.8 Adiabatic quantum computing
While the “circuit” or “network” model has been used in most theoretical and experimental approaches to quantum information processing, it is sometimes useful to consider alternative approaches. The second approach that we consider here is the model of adiabatic quantum computing, which was proposed by Farhi
et al. [
72] and which has been shown to be equivalent (in terms of computational complexity) to the circuit model [
73].
Adiabatic quantum computing differs radically from the network approach: the information is not “processed” in the conventional sense. The main step is the generation of a problem Hamiltonian HP, whose ground state encodes the desired output. Possible examples include search algorithms, where the Hamiltonian represents a penalty function that vanishes in the ground state.
To find the solution, it is then necessary to bring the quantum register into the ground state of the problem Hamiltonian. This is obviously a nontrivial task since we do not know the state beforehand. Here, the adiabatic theorem of quantum mechanics comes to the rescue: if we prepare the system in the ground state of any suitable Hamiltonian and then slowly change the Hamiltonian until it becomes equal to the problem Hamiltonian, the quantum adiabatic theorem predicts that the system will remain in the ground state and therefore encodes the desired solution once the Hamiltonian has become equal to the problem Hamiltonian. The procedure starts at time with the system in the ground state of a Hamiltonian H0. The Hamiltonian is then changed continuously into the problem Hamiltonian HP over a time T:
where the function increases monotonically from 0 at to 1 at . The solution of the optimization problem is then determined by measuring the final ground state of HP.
For this procedure to succeed, three conditions must be met:
• The system is initially in the ground state of the initial Hamiltonian .
• There is a gap between the two lowest energy eigenvalues of the Hamiltonian at all times, .
• The Hamiltonian is varied sufficiently slowly, such that . Here and refer to the instantaneous ground state and the first excited state, respectively, and , are the corresponding energies.
Several adiabatic quantum algorithms have been developed for solving classical optimization problems. Examples include the 3-SAT algorithm [
72,
74] and the unsorted databases search [
75]. Some small-scale adiabatic algorithms have already been implemented experimentally, using NMR systems [
76–
78]. In comparison to the circuit model, AQC appears to offer some advantages:
• It eliminates the need to perform fast quantum logic operations and measurements, which is particularly troublesome in the context of fault-tolerant quantum computation.
• It is inherently robust against errors due to dephasing, environmental noise and some unitary control errors [
79,
80] as long as the system is kept at low temperature.
On the other hand, the scaling properties of some adiabatic quantum algorithms, especially for nondeterministic polynomial (NP)-complete problems [
81], are still not completely clear. Certain specialized examples have been analyzed numerically. In some cases, these tests indicated exponential complexity [
82], in others polynomial [
72,
83]. It has been believed that the worst case performance is exponential [
84] for NP-complete problems.
3 Basics of quantum simulation
For the purpose of this review, we will concentrate on one particular application of quantum information processing, the simulation of other quantum systems on a quantum computer. This was one of the original motivations for looking into the possibility of using quantum systems for information processing [
5] and may well be the first application where quantum computers become sufficiently powerful to successfully challenge classical computers.
3.1 Mapping the system
Simulating another quantum system on a quantum computer [
27,
28] requires first of all a quantum register that has at least as many degrees of freedom as the system to be simulated. Furthermore, the time evolution of the system must be simulated on the target physical system. In most cases, it is not possible to implement the Hamiltonian of the simulated system directly. In this common case, one has to implement a time-dependent Hamiltonian in such a way that after a total evolution time
T, the overall evolution under the time-dependent Hamiltonian becomes the same as it would have been under the real Hamiltonian
HS.
Figure 3 summarizes the requirements for a quantum simulation: the left-hand column shows the system whose evolution we wish to study by simulating it on a quantum computer (right-hand column). The simulated system is mapped into the physical system by the unitary operation ϕ.
3.2 Evolution
If the simulated system evolves under a (time-independent) Hamiltonian HS, and we require the relation between the simulated and the physical system to be time-independent, i.e.,
the propagator for the physical system must be
In most cases, it will not be possible to directly implement a time-independent Hamiltonian HP such that the desired evolution is obtained directly, . Like in other quantum computational problems, it is then necessary to instead implement the overall propagator by a time-dependent Hamiltonian. In those cases, where the Hamiltonian is piecewise constant, we can write
where is the time period during which the physical system evolves under the Hamiltonian . Writing also
we obtain an effective Hamiltonian , which formally generates the desired time-evolution and satisfies the simulation condition
For our purpose, the physical system P corresponds to a nuclear spin system. Its internal Hamiltonian is
where represents the Larmor frequency of spin i, the strength of the coupling between spins i and j, n is the number of spins, and we have assumed weak coupling.
The external Hamiltonian describing the effect of the RF pulses is
where is the angular frequency, the initial phase, ti the duration, and the amplitude of the rf pulse acting on spin i. This is the most general case, where each spin interacts with its own rf field. In practice, we often work with several qubits corresponding to the same spin species. In those cases, the fields acting on different qubits may be identical.
To implement a quantum simulation, we have to choose the correct sequence of phases, frequencies, amplitudes and pulse durations, such that the resulting sequence of Hamiltonians
fulfills Eq. (12). This condition can always be fulfilled if the individual qubits can be distinguished by their frequencies and they are part of a single coupling network.
4 Generating effective Hamiltonians
4.1 Mathematical basics
The evolution that generates the required unitary transformation VT can be generated in different ways. Here, we will always assume that the complete Hamiltonian of the physical system P consists of an internal part , which is time-independent, and a control part , which describes the interaction with experimentally adjustable control fields that will be taken to be piecewise constant.
Depending on the sequence of the control fields, the overall propagator can be generated in different ways. In simple cases, it is possible to calculate the propagator for each segment and multiply them to obtain the overall propagator. We will refer to this approach as “exact decomposition”. As a simple example, we generate a Hamiltonian
when the available Hamiltonian includes single qubit operations and
We may then convert this Hamiltonian into the desired one by “sandwiching” it between two rotations:
This approach provides a simple, intuitive and efficient way to generate the required Hamiltonian. However, when the system size increases, it becomes difficult and often impossible to find an analytical solution for the propagators in the individual period and the numerical approach (which would correspond to a classical simulation) scales poorly with system size. It may thus be necessary to use a perturbation expansion, where each period is short and the overall propagator can be calculated by a perturbation expansion in the duration of each pulse cycle.
The mathematical basis for this perturbation theory is the Baker–Campbell–Hausdorff formula:
In the context of NMR, it is often evaluated with the help of the Magnus expansion [
32,
85]:
with
In many cases, Trotter’s formula is also helpful:
This symmetrisation in time makes the expression accurate to second order in . It can be extended to Hamiltonians with more than two components,
For the present purpose, it is sufficient to assume that the Hamiltonian is time-independent and that the decomposition is such that each term Hk can be realized. We may then expand the propagator in a symmetric manner as:
which is again exact to second order in
. By repeating this period with short evolution times
, it is then possible to generate arbitrary evolutions. Higher-order decompositions are also possible [
86].
4.2 Heisenberg Hamiltonian for 2 spins
As a specific example, we discuss the simulation of two spins interacting with local magnetic fields and with each other through a Heisenberg interaction. The system Hamiltonian is
where the are the strengths of the external magnetic fields (along the z axis) acting on qubit k, and the Heisenberg exchange constants. Here and are in angular frequency units. and correspond to the antiferromagnetic and ferromagnetic cases, respectively. For arbitrary , this is often called the anisotropic Heisenberg model. Some special cases are:
• (or isotropic Heisenberg):
• :
• :
• :
• Heisenberg–Ising:
The system Hamiltonian (13) of the NMR system is an example of a Heisenberg–Ising Hamiltonian. Here, we discuss how to use it for simulating the behavior of a system with the more general Heisenberg Hamiltonian (16) by applying a suitable sequence of RF pulses and free evolutions.
4.3 Exact decomposition
The Hamiltonian (16) can be diagonalized by the transformation:
where
and
with
In terms of spin operators, the transformation R is
This can be generated from the natural spin-spin coupling Hamiltonian by rotating the two spin operators from the z to the x and y axes, i.e., using the two relations:
and
The diagonal Hamiltonian is a special case of an NMR Hamiltonian (13):
An evolution can thus be implemented as
provided we choose the experimentally accessible parameters as:
Combining Eqs. (19)–(21), we can thus realize the propagator
by the pulse sequence shown in Fig. 4.
4.4 Perturbation expansion
The same evolution can also be realized in a different way. For this purpose, we use the Trotter approximation to write the Heisenberg Hamiltonian as:
where
and
The implementation of was discussed above, and the evolution under the transverse term can be realized as:
This decomposition is exact, since the two terms commute, . The overall evolution under , however, is approximate, since the two terms do not commute. Using the Trotter expansion, we can approximate the Heisenberg evolution operator by
This approximates the true evolution up to second order in :
The segment duration determines the quality of the approximation; it has to be kept short in order to minimize the higher-order terms. If the required total evolution time τ is longer than a reasonable choice of allows, , we repeat the segment M times, such that . Figure 5 shows the resulting sequence, using the same representation as before.
As a check of the effect of the duration of the segment, Figure 6 shows the fidelity of the resulting evolution as a function of the duration of each segment. For this analysis, we calculated the fidelity of the evolution operator as a function of the number of segments, while keeping the total duration constant at . Since this fidelity depends on the parameters in the Hamiltonian, we averaged the fidelity over 200 different, randomly chosen parameter sets () with coupling constants in the range [0…1]. For each instance, the fidelity was calculated as:
5 Entanglement and quantum phase transitions
5.1 Basics
Nonlocality appears to be one of the fundamental but still baffling properties of quantum mechanics. Entangled states are quantum states that cannot be understood by the properties of their constituents alone. Among the best known examples is the singlet state of two identical particles, such as two electrons.
For a long time, entanglement was considered as a curiosity only of interest to those who were interested in the fundamentals of quantum mechanics. However, this has changed recently, with the advent of quantum technologies, where entanglement is now often regarded as a resource rather than a curiosity. This is most clearly the case in quantum communication, where entanglement can even be considered as a commodity, since it allows, e.g., to securely exchange data, eliminating many possibilities for eavesdropping.
This increased and more widespread interest has also initiated research into better characterization of entanglement, including the study of different forms of entanglement, and its quantification, leading to questions such as:
• How strongly are two given subsystems entangled?
• Which subsystems of a group are entangled with what other subsystems?
• What happens if one subsystem is removed from an entangled system?
Answers to these (and many similar) questions have an impact on future tools of communication and secrecy, and possibly also to a number of other “quantum technologies”, such as quantum metrology.
While much of this research is still in its infancy, small systems, consisting of 2–3 subsystems can now be classified completely in terms of their entanglement. Nuclear spin systems have been used very successfully to study the various entangled states in small systems, since they can be quite readily prepared using the techniques of pulsed NMR. We start the discussion by reviewing some measures of entanglement for bipartite and tripartite systems.
5.2 Bipartite systems
A bipartite system is called “entangled” if it cannot be written as a product state of the two subsystems. For pure states of the bipartite system, this can easily be checked by tracing over one of the two subsystems. If the system is a product state, the resulting density operator for the subsystem is a pure state,
The most common measure of entanglement is the concurrence [
87], which is related to the “entanglement of formation”. Let
A and
B be a pair of qubits, whose state is described by the density matrix
of the pair, which may be pure or mixed. We define the spin-flipped density matrix as:
where ∗ denotes the complex conjugation. Let and be the square roots of the eigenvalues of in decreasing order. Then the concurrence C for is
A simpler expression is possible if we restrict ourselves to pure two-qubit states . Then, the concurrence can be calculated as:
Its value ranges from 0 (no entanglement) to 1 (maximum entanglement). An example of maximally entangled states are the Bell states:
“Maximally entangled” means that if we consider only one of the two subsystems (e.g. A) by tracing over the other subsystem, the resulting state is maximally mixed, i.e., its density operator is equal to the unity operator:
5.3 Tripartite systems
While entanglement in bipartite systems can be quantified by a single measure (the concurrence), larger systems can support different types of entanglement. In tripartite systems, we can have either pairwise entanglement or essential three-way entanglement [
88], which cannot be reduced to pairwise entanglement. To keep the situation (relatively) simple, we discuss here only tripartite systems
that are in a pure state. For these systems, we can calculate the pairwise entanglement between qubits
A and
B by first tracing over the third qubit (
C) and then using Eq. (26) to calculate the bipartite concurrence
, and similarly for
and
.
In addition to this pairwise entanglement, tripartite systems also support an essential three-way entanglement [
88]. This is found, e.g., in the GHZ states,
Since tracing over any of the three qubits leaves the remaining system in a maximally mixed state , these states
• are maximally entangled;
• contain no pairwise entanglement, according to Eq. (26).
For pure states of a 3-qubit system
, it is possible to quantitate the different types of entanglement [
88]. For the essential three-way entanglement, we use the 3-tangle
The first term in Eq. (29) quantifies the entanglement of qubit
A with the remaining subsystem
. It is called the “generalized I-concurrence” [
89,
90] and is defined as:
Here, the density operator of the A subsystem is obtained by tracing over the degrees of freedom of B and C. If A is not entangled with the remaining subsystem, i.e., if the system is in a product state, represents a pure state, , and . For a maximally entangled state, , , and , as expected. The remaining 2 terms in Eq. (29) quantify the pairwise entanglement of A with B and A with C. The 3-tangle can thus be understood as the difference between the entanglement of one of the qubits with the remaining system and the total pairwise entanglement of the same qubit with each of the other qubits.
As noted above, the GHZ states are examples (actually: the only examples in a tripartite system) for maximum essential three-way entanglement, , while all measures of pairwise entanglement vanish, or . In contrast to this, the W states,
have no essential three-way entanglement , but are strongly pairwise entangled, .
GHZ states and W states are the only two inequivalent kinds of genuine tripartite entanglement in a 3-qubit system [
91]. Unfortunately, there is currently no known analytical expression for the 3-tangle of a mixed state of three qubits, nor is it known whether expressions analogous to Eq. (29) can be found for systems consisting of more than three qubits.
Another important method for characterizing entanglement uses specifically designed observables to distinguish between entangled and separable states in a quantum system. These observables are called entanglement witnesses [
92–
95], which can always be used to detect various forms of multipartite entanglement, provided some
a priori knowledge is available about the states under investigation. In our context, the two witness operators
and
are useful for distinguishing the two types of entanglement. If their expectation value is negative, they indicate genuine tripartite entanglement; further detects GHZ-type entanglement. These witnesses do not detect all types of GHZ- or W-entanglement, e.g., they do not detect the state. However, this state can be converted into the state by local unitary transformations; in the context of NMR, this means that such a state could be transformed by rf pulses and then detected by the same entanglement witness.
5.4 Quantum phase transitions
Phase transitions are a common feature in classical physics. Familiar examples are boiling and freezing of water. In these classical phase transitions, several properties of the system change discontinuously as a control parameter (e.g., temperature or pressure) changes by a small amount.
In quantum mechanical systems, we do not consider phase transitions of ensembles, but instead abrupt changes of the ground state of a Hamiltonian when a parameter of the Hamiltonian changes continuously - so-called quantum phase transitions (QPTs) [
96]. Well-known examples are the superconductor-insulator transition and the paramagnetic-antiferromagnetic transition in quantum magnets. While classical phase transitions often occur as a consequence of temperature change, quantum phase transitions occur at
.
Besides its own remarkable properties, the investigation of such phase transitions is often tightly associated with the design, discovery and growth of novel materials [
97]. Experimental observations of QPTs were reported only recently, e.g., in magnetic systems [
98], heavy-fermion metals [
99], common metals [
100] and Bose–Einstein condensation [
24]. A collection of reviews [
97,
101–
105] on QPTs reported the current status and recent developments in this field.
At the critical point where QPT occurs, the ground state of the system undergoes a qualitative change in some of its properties [
96]. In this context, we will emphasize the change in entanglement, which is associated with various types of QPTs. Examples that were discussed in detail include the Heisenberg model [
106–
109] and the Hubbard model [
110]. It is believed that the ground-state entanglement also plays a crucial role in other QPTs, like the change of conductivity in the Mott insulator-superfluid transition [
111] and the quantum Hall effect [
112]. Many of the relevant features, like the transition from a simple product state to a strongly entangled state, occur over a wide range of parameters and persist for infinite systems as well as for systems with as few as two spins [
108,
113–
115].
In most systems studied, attention was focused on two-body interactions, which are most readily accessible experimentally. On the other hand, spin systems with three-body interactions have been shown to exhibit exotic ground-state properties [
116–
127], which are unknown in systems with only two-body interactions. In cluster Hamiltonians, the presence of three-spin interactions results in unique entanglement properties and new critical phenomena that cannot be detected by two-point correlation functions, a traditional approach to measure criticality of ground states [
122].
6 A simple example
6.1 Motivation
The goal of a quantum simulation is to observe the behavior of a system that does not exist or cannot be observed directly, or to examine properties that are not directly measurable in the real system. In our example, we use a system of nuclear spins to investigate entanglement and quantum phase transitions. The systems that we discussed in the previous section are not easy to find in nature and even if they exist, it is usually not straightforward to change the relevant parameters nor to observe their behavior as a function of these parameters. We demonstrate these issues here, first using the simplest possible example. In the following section, we move to a slightly larger system, where we can discuss the issues that arise when the system becomes more complex.
The simulation experiments that we discuss here consist of three steps:
(1) Initialize the quantum simulator into the ground state of the initial Hamiltonian .
(2) Generate an effective Hamiltonian that corresponds to the target Hamiltonian and drive it through the relevant trajectory, including the quantum critical points, by adiabatically changing a suitable control parameter.
(3) Detect the QPTs using a suitable indicator.
6.2 Target system Hamiltonian
The simplest system that exhibits a QPT of ground-state entanglement consists of two spins in an external magetic field, coupled by an Ising-type interaction. The corresponding Hamiltonian is
where is the magnetic field strength (in frequency units), and Jz is the spin-spin coupling constant.
A symmetry-adapted basis that is an eigenbasis for this Hamiltonian consists of the states , with and and the spin-down and spin up states. While the states and are product states, the states are maximally entangled states. is the singlet state, the others are triplet states.
Since the ground state of this system is always one of the triplet states, and transitions to the singlet state are symmetry-forbidden, we can reduce our system of interest to the triplet states. The ground state depends then only on the dimensionless field strength :
The ground state of the system is therefore a maximally entangled state if the field is small, , but a product state in the large field region, . are quantum critical points, where the ground state changes from the ferromagnetically ordered high field states to the entangled, antiferromagnetic low-field state. Figure 7 summarizes this behavior.
To observe the transitions between these different ground states, we will drive the system adiabatically through the critical points. Such an adiabatic passage is only possible if the ground state is never degenerate. We therefore must avoid the degeneracies of the Hamiltonian (34). This is possible by adding a small transverse field to the system:
The transverse field is always kept small, . As shown in Fig. 7, this modified Hamiltonian is nondegenerate and the QPTs now have a finite width of order .
6.3 Effective Hamiltonian
To generate the effective Hamiltonian, we used a pulse sequence whose parameters could be varied in such a way that the corresponding parameter in the effective Hamiltonian went through the desired trajectory adiabatically, i.e., such that the system always remained in the instantaneous ground state. We used the approximate expansion technique to create the target Hamiltonian (see Section 4.2):
with
The approximation is valid as long as the evolution period is kept sufficiently short. The decomposed operator can be realized by incorporating the free evolutions under the natural NMR Hamiltonian with the RF pulses.
For the experimental implementation of the adiabatic passage, we discretized the time-dependent Hamiltonian into segments with peacewise constant Hamiltonians
where T is the total duration of the adiabatic passage and C is the control parameter in . The adiabatic condition is achieved when both and the duration of each step . Figure 8 shows the sequence of RF pulses that generates the adiabatic evolution.
The experimental implementation generates an effective Hamiltonian that is constant for a time . This stepwise approximation is faithful if the duration of each time step is chosen such that (1) the time is short enough that the average Hamiltonian approximation holds and (2) the transfer remains adiabatic. While this calls for many short steps, there is also a lower limit for the duration of each step, which is dictated by experimental aspects: pulse errors and switching transients tend to generate errors that increase with the number of cycles.
We used a numerical optimisation procedure to determine the optimal sequence of Hamiltonians, taking the full level structure into account. Choosing a hyperbolic sine as the functional form, we optimised its parameters. Furthermore, to determine the optimal number of steps, we used the same numerical simulation, keeping the functional dependence vs. t constant, but increasing the number of steps M.
The results are summarized in Fig. 9, which plots the lowest fidelity encountered during each scan against the number of steps taken in the simulation. The fidelity is calculated as the overlap of the state with the ground state at the relevant position. The simulation shows also the effect of decoherence, which reduces the achievable fidelity if the total duration of the scan becomes comparable to the decoherence time. The number of steps for the discretized scans in the experiments was chosen near the top of the curves. The model that we used to take the effect of decoherence into account is similar to that of Vandersypen
et al. [
128].
6.4 Experimental results
The experiments were carried out at room temperature using a 500 MHz (11.7 Tesla) NMR spectrometer from Bruker Biospin. For the two-qubit quantum simulations, we chose the 13C and 1H spins of 13C-labeled chloroform. The relatively large spin-spin coupling constant of Hz makes this molecule well suited for this simulation. The pseudo-pure initial state was generated with the pulse sequence (9) described in Section 2. The fidelity of this state preparation was checked by quantum state tomography and found to be better than 0.99.
The adiabatic scan through the QPT was performed by shifting the RF frequencies of both channels after each period. In the following, we present the results as a function of the dimensionless magnetic field strength , i.e., normalized to the strength of the coupling. Using the sweep shown in Fig. 9, the offset was changed from to in 60 steps. The evolution of the system during the scan was checked by performing a complete quantum state tomography after every second step during the experiment.
We calculated the concurrence C from the tomographically reconstructed density matrix according to Eq. (26). Figure 10 shows the measured concurrence as individual points and compares them with the theoretical values . Both data sets clearly show the expected QPTs near the critical points . The entangled ground state for is characterised by a concurrence close to 1, while the high field states are only weakly entangled (the entanglement vanishes for ).
The experimentally determined concurrence C remains below , significantly less than the theoretical values. To verify that this deviation is due to decoherence, we simulated the experiment on a classical computer, taking into account the details of the pulse sequence as well as the effect of decoherence. We obtained good agreement between theoretical and experimental data if we assumed a total decoherence time of 130 ms, which is comparable to the experimental scan time of ms. Figure 10 shows the simulated values of the concurrence as triangles; their evolution during the scans is quite similar to that of the experimental data points.
To assess the quality of the adiabatic scan, we also determined the fidelities from the tomographically reconstructed density operators, where is the ideal ground state at the measured time point. The fidelities, which are shown at the top of Fig. 10, deviate from unity when the system passes through the critical points and show some overall decrease due to decoherence. It can also been seen that the biggest deviation of the fidelity occurs at the critical points, i.e., the sensitivity of the fidelity can also give some information on critical points. Again, the simulated fidelities agree remarkably well with the experimental values.
As a second-order parameter, we also determined the two-spin correlation [
96]
. Figure 10 shows the results. As expected, the system is ferromagnetically ordered (
) at high fields, but turns to an antiferromagnetic state (
) at low fields between the two quantum critical points. Comparing these two plots in Fig. 10, we find that the behavior of the concurrence is similar to the two-spin correlation.
The quantum state tomography used in these experiments provides very detailed information on the quantum system and contains all the possible information about its state. However, the number of measurements required for this analysis, as well as the date processing increases exponentially with the size of the system. It is therefore important to look into alternative methods for characterizing quantum systems and quantum phase transitions. As discussed elsewhere [
129], one possible technique is to couple the system to one additional qubit. If the coupling is chosen well, a single measurement on this “ancilla qubit” is sufficient to detect the quantum phase transition, independent of the size of the system.
7 Three-qubit system
7.1 Three-spin chain
If we extend our system to three qubits, we can study several qualitatively new effects. In particular, we are interested in the different types of entanglement that we find in this system: Some states correspond to pairwise entanglement, while other states correspond to genuine tripartite entanglement. We are again interested in the quantum mechanical ground state of the system and investigate to which class of states it belongs, depending on the relevant parameters of the Hamiltonian. We consider a triangle of three spins 1/2 in a uniform magnetic field, interacting by both Ising-type two-body and three-body couplings:
where and characterize the strengths of the longitudinal and transverse magnetic fields, and J2, J3 represent the two-body and three-body coupling constants. The transverse field is small, .
Using perturbation theory in a symmetry-adapted basis , we find the ground state of the Hamiltonian (37) as a function of the three control parameters , and J3. Table 1 summarizes the different phases for the half-space . Similar expressions are obtained for . The competition between the three kinds of interactions (one-, two- and three-body) results in distinct types of ground states (product-, W- and GHZ-states) in different parameter ranges.
In the two-qubit system that we discussed in the preceding subsection, only one type of entanglement exists. In the three-spin systems, we obtain a qualitatively different behavior: In addition to the familiar bipartite entanglement, the system can also exhibit genuine tripartite entanglement. In particular, we will consider two classes of states that exhibit two types of entanglement—W states and GHZ states. Compared to a two-qubit system, a three-qubit system therefore has a much richer phase diagram and requires more specific measures for characterizing the different possible QPTs.
7.2 Target Hamiltonians and phases
To observe the different types of phase transitions in the Hamiltonian (16), we chose two different Hamiltonians:
with vanishing three-spin interaction but nonvanishing two-spin interactions and
with only three-spin interaction.
From Table 1 and Fig. 11, we find that the ground state of the first system has a transition from a product state to a W entangled state at , while the ground state of the second system has a transition from a product state to a GHZ entangled state at .
7.3 Physical system and effective Hamiltonians
Our three-qubit NMR quantum simulator is based on the molecule Diethyl-fluoromalonate, dissolved in acetone-d6. Its structure is shown in Figure 12 and we use the 13C, 1H, and 19F nuclear spins in the dashed oval as qubits. Figure 12 also shows the relevant parameters of this system.
The target Hamiltonians were created as an average Hamiltonian by concatenating evolutions with short periods:
and
Here,
All the pairwise couplings between the spins in the molecule have nonzero strength. However, they are not identical and therefore cannot be used directly. We used a sutiable refocusing scheme [
39,
40,
130] to create the Hamiltonian
with equal two-spin interactions. Figure 13 (a) shows the pulse sequence used in the experiment. For all three spins, nonzero offsets
(
) were used; their values are given in the figure caption.
Three-spin interactions do not occur naturally in NMR, but they can be simulated by a combination of two-spin interactions and RF pulses [
27]:
To implement this, we also use the relation
The pulse sequence that generates the Hamiltonian is shown in Fig. 13 (b).
As in the two-spin system, we used a hyperbolic sine for the variation of the control parameters J2 and J3. To optimize the experimental parameters, we first performed a numerical simulation. The results are shown in Fig. 14. For the experiments, we chose the number of steps such that the fidelities were maximized, to . The first adiabatic trajectory that we implemented corresponded to in Hamiltonian , with the duration of each segment set to . The longitudinal field in was set to , and the transverse field to . The second trajectory implemented , varying the 3-body interaction from . The other parameters were and .
7.4 Experimental results
At the start of the simulation, the system was prepared in a pseudo-pure initial state with an experimental fidelity of 0.99 by using the pulse sequence (10) (see Section 2.1). The density matrix reconstructed from the experimental results is shown in Fig. 15 (a).
We first checked the final states generated at the end of the adiabatic scan by performing complete quantum state tomography [
131]. The experimentally reconstructed density matrices are shown in Fig. 15, together with the initial state. They agree quite closely with the theoretical ones. To quantify the agreement between the theoretical and experimental states, we used two different measures to compare them: First, we considered the
attenuated correlation [
132]:
where is a theoretical output state, obtained by applying the ideal transformations to the experimental input state , and is the experimental output state obtained by density operator tomography. Eq. (41) implies that . The experimental values of the correlation for the two cases considered here were and . As the second measure, we used the definition of the state fidelity (42):
which yielded and .
In principle, we could use density operator tomography to monitor the variation of the system state during the adiabatic passage. However, this would involve a very large number of measurements and experimental data to be processed. We therefore switched to two simpler indicators of the expected critical behavior, correlation functions and entanglement witnesses. One is the spin-spin correlation including two-spin and three-spin correlation functions. We define an average two-spin correlation as:
and a three-spin correlation
The other one is the entanglement witnesses [see Eqs. (32) and (33)].
Figure 16 shows the result of these measurements. The two-spin correlation function C2, which is frequently used as a measure of the critical behavior, clearly shows the expected transition for the first system , but nothing for the second system . Inversely, the higher-order correlation function C3 reveals a critical behavior for , but nothing for . Therefore, two types of QPTs induced by varying different control parameters are detected by simultaneously employing the multi-spin correlation functions.
The experimentally determined correlations are generally smaller than the theoretical values. This deviation can be attributed to decoherence. To verify this, we also simulated the experiments on a classical computer, using the decoherence model of Ref. [
128]. We obtained good agreement between theoretical and experimental data if we assumed an average decoherence time of
ms for
and
ms for
. In system
, the symmetric pulse sequence eliminated the inhomogeneity of the static magnetic field to some extent. The run time of the experiments was about
ms for the system
and
ms for the system
. The simulated values are also shown in Fig. 16 (a) and (b), as circles and triangles.
Figure 16 also shows the result of monitoring the QPTs using the entanglement witnesses [parts (c) and (d)]. The data points were obtained by first fitting the experimental signals by an effective decoherence time , which had been estimated by the decay of the signal with the duration of the experiment. These data also allow us to verify the generation of a tripartite entangled state in the system as the strength J2 of the two-body interaction increases, i.e., and after the critical point . Conversely, we observe the generation of a GHZ state in the system if the strength J3 of the three-body interaction increases, in agreement with and when .
8 Conclusion
The main goal of this review was an introduction into the basics of quantum information processing and an illustration of its application to the simulation of quantum systems, using nuclear spins as qubits. The examples that we used consisted of small systems in which we adiabatically varied the Hamiltonian in such a way that the systems went through quantum critical points. This allowed us to discuss some important features of entanglement and quantum phase transitions.
Many physical systems or models show a QPT when a single parameter is varied through a critical point, where the ground state and the first excited state become degenerate or go through an avoided crossing. In this paper, we investigated some of these systems by NMR QIP, using adiabatic evolutions under an effective Hamiltonian. A related simulation of a transition from a quantum para- to a quantum (anti-) ferromagnet in a Heisenberg transverse Ising Hamiltonian was also demonstrated with two trapped ions [
133].
While the small (toy-) systems that we used here are ideal for demonstrating the basic issues, it is of course tempting to consider larger systems. While this is beyond the scope of this article, we would like to mention some of the issues that will arise in this context.
Generalization. — If we consider systems consisting of a larger number of subsystems, the complexity increases. In particular, larger systems support even more types of qualitatively different entanglement, e.g., nine ways for four qubits [
134]. Clearly, the increasing complexity, as well as the increasing size of the relevant Hilbert space, will make it even more difficult to completely characterize these systems. Most of the previous works used the nearest-neighbor pairwise entanglement [
106,
108,
115,
135–
139] or entanglement entropy [
140–
146]. However, it has been shown that these measures are not always suitable and should be considered incomplete [
147]. Other entanglement measures, such as entanglement witnesses, a global entanglement [
109,
148,
149] and average local entanglement
[
150] will lead to more useful tools for detecting possible phase transitions in multi-spin systems.
Efficiency. — Simulating a QPT on a classical computer is known to be a hard problem. The experimental examples of quantum simulations presented here demonstrate that this simulation can in principle be completed on a quantum computer programmed to pass near a quantum phase transition using adiabatic evolution. The adiabatic simulation of a QPT is thus equivalent to a very specific quantum adiabatic computation [
151–
154]. Therefore, in analogy to AQC, the performance of the simulation is determined by the minimum energy gap
between the lowest two energy eigenvalues of
, since the total run time
in a
global adiabatic evolution scheme and
in a
local adiabatic evolution scheme [
75,
78] (used in our simulation scheme). If
along the adiabatic evolution is only polynomially small in the number of qubits, the simulation is efficient. Schützhold and Schaller [
152] suggested that in an AQC, transitions of second or higher order are advantageous in comparison to those of first order. Transitions of second or higher order are thus easier to be simulated in comparison to those of first order.
In our simulation scheme, we introduced a small perturbation into the simulated Hamiltonian to eliminate the degeneracy between the ground state and the first excited state. This allows one to adiabatically go through the critical points. Different choices of time-dependent perturbations, such as Gauss functions, can further improve the energy gap while the phases on the two sides of the critical points remain the same. The implementation of such a scheme requires some prior knowledge of the spectrum. The scaling of the energy gap with the system size is very important for this type of quantum simulations and must be further investigated.
Simulations of quantum mechanical systems may well be the first applications where quantum computers outcompete classical computers, since the requirements on the number of qubits are relatively modest and known quantum algorithms are exponentially faster than classical algorithms. This expectation is also reflected in the European QIPC roadmap [
155].
A number of possible approaches to the implementation of quantum information processing have been suggested or demonstrated. Out of these, liquid-state NMR is clearly the most advanced technique. Fully operational systems with up to 12 quantum bits have been demonstrated and used to confirm the basic principles of quantum computing. Even larger system, with up to several thousand qubits have been created using solid-state NMR techniques [
156–
159]. These systems were designed to study the decoherence of large quantum systems, but they do not allow addressing of individual qubits and therefore cannot be used for information processing.
For the implementation of large-scale general-purpose quantum computers, different types of qubits may well turn out to be more promising. Independent of the physical basis of these future systems, however, it is more than likely that the concepts and techniques for coherent control of coupled nuclear spins will be transferred to other fields of physics. This process has already started in several systems, such as trapped ions [
160], excitons in quantum dots [
161] and Cooper pair boxes [
162].
As Vandersypen and Chuang mentioned “NMR has been the workhorse for the experimental implementation of quantum protocols” [
37]. We expect that NMR will remain a testbed for this development for the foreseeable future, especially for the first short term application of quantum computers – quantum simulators.
Higher Education Press and Springer-Verlag 2009