Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Entropy logoLink to Entropy
. 2024 May 8;26(5):410. doi: 10.3390/e26050410

Geometric Algebra Jordan–Wigner Transformation for Quantum Simulation

Grégoire Veyrac 1, Zeno Toffano 1,*
Editor: Lu Wei1
PMCID: PMC11120067  PMID: 38785659

Abstract

Quantum simulation qubit models of electronic Hamiltonians rely on specific transformations in order to take into account the fermionic permutation properties of electrons. These transformations (principally the Jordan–Wigner transformation (JWT) and the Bravyi–Kitaev transformation) correspond in a quantum circuit to the introduction of a supplementary circuit level. In order to include the fermionic properties in a more straightforward way in quantum computations, we propose to use methods issued from Geometric Algebra (GA), which, due to its commutation properties, are well adapted for fermionic systems. First, we apply the Witt basis method in GA to reformulate the JWT in this framework and use this formulation to express various quantum gates. We then rewrite the general one and two-electron Hamiltonian and use it for building a quantum simulation circuit for the Hydrogen molecule. Finally, the quantum Ising Hamiltonian, widely used in quantum simulation, is reformulated in this framework.

Keywords: Geometric algebra, quantum computing, quantum simulation

1. Introduction

Analysis of large molecules is a great challenge in computational chemistry. Studying the Shrödinger equation in most cases does not lead to analytic solutions, and therefore requires one to rely on simulations. The major goal in computational chemistry is to find the state energy spectrum of many body interacting fermionic systems and to investigate its wavefunctions and structural properties. Classical chemical simulations permit one to tackle efficiently physical, chemical, and structural properties of molecules. Due to the increase in computational power over the past decades, direct simulations have been made possible; for example, Density Functional Theory and Molecular Dynamics methods have enabled calculations for systems of more than a thousand atoms [1,2], but these methods suffer from an exponentially growing computational time. Some alternative methods have been developed in order to ease the computations for complex molecules, such as quantum Monte Carlo [3], tensor networks [4], post Hartree Fock methods [5], Green’s function methods [6], many-body perturbation theory [7], etc. However, each method suffers from its own limitations; for example, up to now, tensor networks have been demonstrated to be efficient only for low entangled systems [8].

The general difficulty in simulating quantum mechanics with classical computers is linked to the exponential scaling of the Hilbert space dimension, with respect to the number of atoms in the molecule. In the 1980s, Richard Feynman [9] made the proposition to simulate quantum mechanics with a device capable of imitating the quantum rules rather than simulate it on a classical computer. This idea was taken further by David Deutsch and led to the concept of quantum computers [10]. Quantum computers and quantum simulation are today a major research subject, involving private companies such as IBM [11], Google [12], Quantinuum [13], and Pasqal [14], along with universities all around the world. The seeked goal is to provide an advantage over classical computers [15] and to create an efficient tool for simulating quantum physical systems [16].

In quantum simulation, the molecular Hamiltonian under the Born–Oppenheimer approximation (BOA), where the atomic nuclei are considered fixed, is represented in the second-quantized form [17], using fermionic annihilation and creation operators. These operators anticommute for distinct electrons in a molecule; this means that they do not behave as qubits in a quantum circuit . Quantum circuits use the operations of matrix product to apply consecutive gates and Kronecker products to compose different qubits. This leads to the usual quantum circuit diagram where the consecutive boxes (from left to right) represent the applied quantum gates and the horizontal parallel wires represent the composed qubits behaving as commuting bosons. This fact makes the translation from the Hamiltonian form to quantum gates not straightforward. To practically obtain a quantum circuit from a Hamiltonian, one uses specific transformations such as the Jordan–Wigner transformation (JWT) [17,18] or the Bravyi–Kitaev transformation [19,20], which reestablishes the correct commutation properties. Then the Suzuki–Trotter approximation [17] is used to build the entire equivalent circuit. It is then possible to extract the useful information about the Hamiltonian, ground energies, for example, using different quantum algorithms.

Although JWT is effective in going from one formalism to another, it is commonly applied in an heuristic ad-hoc way. One could wonder whether alternative mathematical formalisms could make the application of this transformation more natural. We will show here that Geometric Algebra (GA) is an interesting candidate.

GA combines the algebra of quaternions, discovered by W.H. Hamilton, permitting one to describe geometric operations such as rotations and Grassman algebra based on the notion of exterior product, used to create objects of higher dimensions such as areas and volumes. The synthesis and generalization was done by Clifford [21] by combining quaternions and Grassmann’s algebra into a single mathematical structure. Clifford himself named this structure “geometric algebra”, although the term Clifford Algebra (CA) is more often used in the literature.

It must be emphasized that for historical reasons most physicists did not adopt GA for calculations on vector spaces, preferring Gibbs vector analysis, which almost completely replaced quaternion algebra by the end of the 19th century. However, in the second half of the 20th century, some physicists, lead by David Hestenes [22], used GA methods in classical mechanics, electromagnetism, quantum physics, and special and general relativity [23].

GA now also has many other applications in applied sciences outside physics, such as robotics [24] and computer graphics [21]. More generally, GA has shown its potential for optimizing geometry-related problems [24]. Current research has also used GA in quantum computing [25,26,27,28]. Recently, a formalism for quantum computing was proposed built upon complex Clifford algebras using the Witt Basis (WB) [29].

In this paper, we provide a direct link between geometric algebra and quantum simulation, using both the WB and JWT. The goal here is to establish the equivalence between the algebra generated by the WB and the algebra generated by the creation and annihilation operators in the electronic Hamiltonians used in quantum simulation.

Section 2 recalls the basics of GA and then defines the concept of WB and of complex CA; it concludes with the spinor representation and the qubit analogy. The JWT is discussed in Section 3, and then the formulation of JWT in the framework of GA and WB is developed; the method is then applied to give the expressions of the usual 1-qubit and 2-qubit quantum gates and discusses the application on qubits in quantum circuits. Quantum simulation Hamiltonians in the BOA form are then expressed in the GA framework and a concrete example, the hydrogen molecule, is investigated in Section 4. In Section 5, an example of a general anisotropic XY Hamiltonian, which can be reduced to a quantum Ising Hamiltonian, commonly used as an ersatz in quantum simulation, is discussed in our framework.

2. Geometric Algebra (GA)

2.1. Clifford Algebra (CA)

A CA is defined using a real vector space, V, with a quadratic form, ϕ, over a field [30]. The algebra is produced by the quotient space T(V)/Iϕ(V), where T is the tensor product of vector spaces and Iϕ=vvϕ(v) is the ideal subset closed under multiplication.

For an orthonormal basis, {e1,,en}, spanning the vector space, V, the algebra is generated by the basis verifying

eiej+ejei=2ϕ(ei,ej). (1)

An intuitive definition of a CA can be given using a finite dimensional vector space, V, equipped with the “geometric product” defined as the sum of an inner product and an outer product, which both have a geometrical meaning [21,22], as shown below.

2.1.1. Outer Product and Blades

Definition 1.

Outer product

The outer product, noted by ∧, is an antisymmetric bilinear form giving the anticommutativity for the basis vectors:

eiej=ejei. (2)

The outer product of two vectors forms a new object, called a bivector.

Definition 2.

Blade

The blades are generated by the outer product of vectors of V. The grade of the blade is the number of vectors composing the blade:

ei1eir

is called an r-blade.

By definition, 0-blades are the scalars.

1-blades correspond to the basis vectors.

2-blades (also called bivectors) can be interpreted as oriented surfaces (as shown on Figure 1), 3-blades (or trivectors) as oriented volumes, etc…

Figure 1.

Figure 1

Representation of a bivector.

2.1.2. Inner Product

Definition 3.

Inner product

The inner product is a bilinear symmetric non-degenerate form defined on V.

For an orthonormal basis, {ei}, one has:

ei.ej=1ifi=j1,p1ifi=jp+1,n0otherwise, (3)

where pn. This characterizes the CA, noted Cp,q, with p+q=n. For a general signature, p denotes the numbers of positive norm basis vectors and q the number of negative norm basis vectors.

The definition of the inner product is extended to all blades by the formulae

(u.(a1ar))=k=1p(1)k(u.ck)a1ak1ak+1ar (4)
(a1ar).(b1bp)=(a1ar1).(ar.(b1bp)), (5)

where a1ar and b1bp are r- and p-blades, and u is a vector. Then, the inner product lowers the grade of a blade.

The subspace Span{ei|1ip} forms an euclidean space, and Span{ei|p+1in} forms an anti-euclidean space with signature 1.

A CA Cp,q is thus composed by p+q=dimCp,q possible unordered combinations of orthonormal basis vectors {ei:i=1,2,...,n}, obeying (1).

2.1.3. Geometric Product

Definition 4.

Geometric product

The geometric product is the sum of the outer and inner products:

xy=x.y+xy. (6)

In the case of a vector, the outer product is the antisymmetric part and the inner product is the symmetric part.

More generally, for an r-blade, Ar, and an p-blade, Bp, we have :

ArBp=(1)rpBpAr (7)
Ar.Bp=(1)r(p+1)Bp.Ar. (8)

Any combination made of non-linearly independent vectors vanishes because of the anticommutativity of the outer product. In this way, Cp,q can be represented as a direct sum of i-blade independent sub-spaces:

Cp,q=W0W1...Wi...Wp+q. (9)

The highest blade element has rank p+q=n and is unique and squares to 1; it is named the pseudoscalar. The rank n of the pseudo-scalar is interesting as it specifies the dimension of the vector space over which the algebra is defined.

Moreover, the number of independent blades of rank k{0,,n} is given by the binomial coefficient nk=n!k!(nk)!. Meaning that the generic CA Cp,q, with p+q=n, globally contains 2n independent blades.

This last fact shows that one can look for a correspondence between the 2n blades with a system of n Fermions (each Fermion possessing two degrees of freedom) or n qubits; this will be the object of the following paragraphs.

2.2. Mother Algebra and Witt Basis (WB)

The mother algebra is defined from the Euclidean vector space, V, and its dual V* [31]:

Rn,n=VV*. (10)

The corresponding CA is noted as Rn,n, called the mother algebra. If wi is a basis of V and wi* is a basis of V*, then Rn,n is the algebra generated by the blades:

wi1wikwj1*wj*,

with 1k,n.

The inner product on Rn,n is defined as follows:

wi.wj=0 (11)
wi*.wj*=0 (12)
wi.wj*=wj*.wi=12δi,j. (13)

Therefore, this set of vectors, {wi,wi*|1in}, forms a non-orthonormal basis of the mother algebra. This basis is called the Witt basis (WB).

We can use the following reversion/conjugation properties to transform a blade into its dual when using the WB:

Definition 5.

Reversion/Hermitian conjugation

On a real Clifford space, the Hermitian conjugation is the anti-automorphism of Cp,q, which maps vectors to their dual:

  • vV,v=v* and v*=v

  • x,yCp,q,(xy)=yx

  • x,yCp,q,a,bR,(ax+by)=ax+by

The WB verifies the relations:

wjwj*+wj*wj=1 (14)
wiwj+wjwi=0 (15)
wi*wj+wjwi*=0 (16)
wi*wj*+wj*wi*=0 (17)
(wj*)2=0 (18)
(wj)2=0. (19)

An orthonormal basis can be defined from the WB as:

ei=wi+wi* (20)
ϕ¯i=wiwi*, (21)

giving ei2=1 and ϕ¯i2=1.

Therefore, the mother algebra can be decomposed as a tensor product of two CA, one Euclidean, and the other anti-Euclidean:

Rn,n=RnR¯n, (22)

where Rn=C(e1,,en) and R¯n=C(ϕ¯1,,ϕ¯n). Here, the ei are Euclidean and the ϕ¯i are anti-Euclidean vectors.

2.3. Witt Basis as a Complex CA

The previous properties can be interpreted as a complex structure of the mother algebra [28,30]. Indeed, by defining the vectors ϕj=iϕ¯j, where i is the imaginary unit, we obtain the complex CA:

Rn,n=RniRn, (23)

with Rn=C(ϕ1,,ϕn), where now the vectors ϕi are Euclidean.

In this case, the WB can be written as:

wi=12(ei+iϕi) (24)
wi*=12(eiiϕi). (25)

As noted in [31], the anticommutation properties (14) to (19) of the WB are analogous to those of the creation operator, c, and annihilation operator, c, used in quantum physics for fermions, used to write Hamiltonians in the second quantization form.

For this reason, it will be more convenient in the following to use the fermion notation:

wi*=ci (26)
wi=ci. (27)

2.4. Spinors for Quantum Computing

The WB can be used to build spinor spaces and also to represent qubit states.

Definition 6.

Spinor space

A spinor space is a minimal left ideal of the CA generated by a hermitian idempotent element. It can be written using the mother algebra Rn,n of the WB [31]:

Sn=Rn,nI, (28)

where IRn,n, such that I=I and is an idempotent I=I2.

The following commuting self-adjoint idempotent operators [32] are then defined:

Ij=cjcj (29)
Kj=cjcj (30)

for j1,n.

The property (14) translates into the closure relation for a single particle:

Ij+Kj=1j. (31)

Then, the spinor ideals can be expressed:

S{i1,,it}{k1,,ks}=Rn,nIi1IitKk1Kks, (32)

where {i1,,it}{k1,,ks}=1,n are spinor spaces (the sets are disjoints).

The resolution of the identity is obtained for the entire vector space by using the complete set of idempotent operators:

1=i=1n(Ii+Ki)={i1,,it}{k1,,ks}=1,nIi1IitKk1Kks. (33)

This means that the entire algebra can be decomposed into a direct sum of 2n spinor spaces.

Quantum computations with n qubits can then be described using these complex CA Rn,n by means of the WB, as outlined in [29]; an n-qubit state vector becomes an element of a spinor.

As shown above in (34), the spinor space can be represented by one of the 2n projectors Ii1IitKk1Kks. In quantum physics, the natural choice is the empty spinor space, where the projector I=I1In represents the vacuum state |00.

Using the creation operators, ci, and the annihilation operators, ci, we have:

ciI1In=0 (34)
ciI1In=I1Ii1ciIi+1In. (35)

In this way, the n-qubit state can be represented in this spinor formulation :

|x1xn(c1)x1()(cn)xnI. (36)

In a more general formulation [32], one could equivalently consider the projector Ii1IitKk1Kks as the original spinor, corresponding now to a qubit state where i qubits are in state |0⟩ and k qubits are in state |1⟩. In this paper, we will adopt the representation of (36).

3. Reformulation of the Jordan–Wigner Transformation (JWT)

3.1. Second Quantization

Let us consider a system made of N fermions. The state of the system is described by the state vector

|ψ=|x1,,xj,,xn, (37)

where xj counts as the number of particles in the state j. Each xj is either 0 or 1 due to the Pauli exclusion principle.

The annihilation and creation operators, cj and cj, give the following relations when applied to ψ:

cj|x1,,xj,,xn=(1)k=1j1xkxj|x1,,1xj,,xn (38)
cj|x1,,xj,,xn=(1)k=1j1xk(1xj)|x1,,1xj,,xn, (39)

and they correspond to removing or adding a particle in the state j. These operators are not hermitian, so they do not correspond to observable quantities. The number operator

nj=cjcj (40)

is hermitian and returns the numbers 0 for no-particle and 1 if the particle is present in the state j.

The creation and annihilation operators verify the following properties:

cjcj|ψ=(1)k=1j1xkxjcj|ψxj1xj=xj(1xj)|ψ=0 (41)
cjcj|ψ=(1)k=1j1xkxjcj|ψxj1xj=xj(1xj)|ψ=0 (42)
cjcj|ψ=(1)k=1j1xk1xjcj|ψxj1xj=(1xj)|ψ. (43)

The two first equations give zero because of the Pauli exclusion principle (i.e., xj{0,1}). The last equation also signifies the closure that

{cj,cj}=cjcj+cjcj=1. (44)

Moreover, the annihilation/creation operators acting on different states always anticommute ij,

{ci,cj}={ci,cj}={ci,cj}=0. (45)

It is clear that one again finds the same commutation properties as in the case of the WB discussed above in the framework of GA, but here we started exclusively from the quantum theory; this analogy between the two methods justifies our approach.

This representation is called second quantization; it is useful for modeling the Hamiltonians of molecules, where the states represent the possible orbital states for electrons and their spins. This representation can then be used to simulate the molecule by translating this Hamiltonian into quantum gates and applying a quantum algorithm to extract the orbital energies.

Creation and annihilation operators act on fermion states, which is why they anticommute (see (45)), while quantum gates act on qubits, which are represented by wires in a quantum circuit and behave as bosons whose creation and annihilation operators, ai and aj, commute. Therefore, fermion creation and annihilation operators and qubit gates do not correspond to the same mathematical structure; this is the reason why a transformation is required to pass from one framework to the other [17].

3.2. Jordan–Wigner Transformation (JWT)

The Jordan–Wigner transformation (JWT) uses the following operators [17,33]:

Zj=12cjcj (46)
σj+=k=1j1(12ckck)cj (47)
σj=k=1j1(12ckck)cj, (48)

where the σj+ and σj are spin operators related to the 1-qubit Pauli gates Xj and Yj by

σj±=Xj±iYj2. (49)

The inverse transformation is given by:

cj=k=1j1Zkσj (50)
cj=k=1j1Zkσj+ (51)

One verifies that for even products of these operators one finds again the usual 1-qubit projection operators:

cjcj=1Zj2 (52)
cjcj=1+Zj2. (53)

The inverse Jordan–Wigner transformation therefore enables one to translate the Hamiltonian of the second quantized form, written with the ci and ci operators into a quantum circuit.

3.3. Permutation Properties of the JWT Operators

When using the WB formalism for the elementary 1-qubit operators cj,cj,cjcj,cjcj, the permutation of the operators and the qubits states is ruled by the following property:

Proposition 1.

For λj{cj,cj,cjcj,cjcj},

λ1|x1λn|xn=(1)j=1n|λj|k=1j1xkλ1λn|x1|xn, (54)

where |λj| is the number of Witt basis vectors contained in λj, (i.e., |cj|=1, |cjci|=2, …).

Proof. 

The aim here is to exchange the lambdas and the kets thanks to the anticommutation properties of the WB (44). Then, we only have to prove that

λj1|xj1λj=(1)|λj|xj1λj1λj|xj1. (55)

Depending of the values of λj1 and |xj1, the product λj1|xj1 takes the values presented in Table 1.

The WB vectors with different indices always anticommute; this means that, in the case of λj{cj,cj}, λj and |xj1 anticommute if xj1=1 and commute if xj1=0. In the case of λj{cjcj,cjcj}, λj always commutes with |xj1. This can be written as (55).

The formula (54) can then be found by exchanging the λj successively with all the previous |xk.

Let us recall that the operator nj given in (40) acts on the qubit state as

nj|x1xn=xj|x1xn,

which gives

(1)j=1n|λj|k=1j1nk|x1xn=(1)j=1n|λj|k=1j1xk|x1xn.

The above operator can be written using the property (1)k=1j1nk=j=1n(12cjcj).

Then, using (54), we finally get

λ1|x1λn|xn=j=1λj{cj,cj}nk=1j112ckckλ1λn|x1xn. (56)

Table 1.

Expression of the two-term product λj1|xj1 for all possible factors. In the left-most column are the four possible left factors, λj1, in the product, and in the upper-most line the two possible right factors, |xj1, in the product.

right factor cj1cj1 cj1
left factor
cj1 0 λj1cj1
cj1cj1 0 λj1cj1
cj1 λj1 0
cj1cj1 λj1 0

3.4. Reformulation of Quantum Gates

This result enables one to directly express quantum gates in the GA formalism using the JWT. The problem of sign change due to anticommutativity, which was thoroughly discussed in [29] for the translation of the tensor product of qubits in a GA framework, is here directly encoded inside the JWT.

The JWT applied to the basis matrices leads to:

|00|j=cjcj (57)
|11|j=cjcj (58)
|01|j=k=1j1ckckckckcj (59)
|10|j=k=1j1ckckckckcj, (60)

which can be easily inverted:

cj=k=1j1Zk|01|j (61)
cj=k=1j1Zk|10|j. (62)

Theorem 1.

JWT for 1-qubit gates

The Jordan–Wigner transformation using the Witt basis provides the following expressions for the Pauli 1-qubit gates:

Xj=|01|j+|10|j=k=1j1(12cjcj)(cj+cj) (63)
Yj=i|01|j+i|10|j=k=1j1(12cjcj)(icjicj) (64)
Zj=|00|j|11|j=12cjcj (65)

This means that, if j,Λj{Xj,Yj,Zj}, then we have

Λ1|x1Λn|xn=Λ1Λn|x1|xn. (66)

3.5. Two-Qubit Systems

Let us consider the case of a 2-qubit system; this means that we work in the CA R2,2. The WB elements reduce to (w1*,w1,w2*,w2), here noted as (c1,c1,c2,c2).

According to the preceding spinor formulation, the qubit states are represented by the following multivectors:

|0|0=|00I1I2=c1c1c2c2 (67)
|0|1=|00c2I1I2=c1c1c2 (68)
|1|0=|10c1I1I2=c1c2c2 (69)
|1|1=|11c1c2I1I2=c1c2 (70)

This shows that for 2-qubit states, the Kronecker product is equivalent to the geometric product in R2,2. In order to introduce the 1-qubit gates in a 2-qubit circuit, we use the JWT in R2,2. For the gates acting on the first qubit, the JWT simply returns:

X1=c1+c1 (71)
Y1=ic1ic1 (72)
Z1=c1c1c1c1 (73)

For the gates acting on the second qubit, however, the JWT adds a correction factor, c1c1c1c1, to the X and Y gates:

1X=(c1c1c1c1)(c2+c2) (74)
1Y=(c1c1c1c1)(ic2ic2) (75)
1Z=(c1c1c1c1)(c2c2c2c2). (76)

General 2-qubit gates can be written using the sums and products of the above 1-qubit gates. For instance, for the controlled-NOT, controlled-Z, and SWAP gates, we have, respectively:

CNOT=12(11+1X+Z1ZX) (77)
CZ=12(11+1Z+Z1ZZ) (78)
SWAP=12(11+XX+YY+ZZ), (79)

giving in our formulation in R2,2:

CNOT=c1c1c1c1(c2+c2)CZ=c1c1+c1c1(c2c2c2c2)SWAP=c1c1c2c2+c1c1c2c2+c1c2c1c2.

3.6. Controlled Gates

In particular, one can derive the expression of controlled gates in Rn,n. Let Ak be an arbitrary 1-qubit quantum gate acting on the qubit k. The controlled gate C(Ak)j (where j is the control qubit and k the target) is given by:

C(Ak)j=|00|j+|11|jAk (80)
=cjcj+cjcjAk (81)

4. Application to Quantum Simulation

4.1. Electronic Hamiltonians for Quantum Simulation

The aim of quantum simulation is to analyze the electronic structure and the associated energies of a molecule. The Born–Oppenheimer approximation (BOA) is commonly used where all nuclei of the molecule are assumed to stay at fixed positions since nuclei have a mass larger than electrons by a factor of 103. Therefore, the dynamics of the molecule is described by the electronic Hamiltonian, H, which is the sum of a single electron Hamiltonian, H(1), and a two-electron Hamiltonian, H(2). The wave function corresponding to the different energy levels, E (eigenvalues), of the molecule is an eigenfunction |ψ of the operator H given by the Shrödinger equation:

H|ψ=E|ψ (82)

The ground state, |ψg, corresponds to the lowest energy, Eg. To describe electrons in the second quantization, we use a basis of N orbital states, noted as |χj. Each wave function, χj, is a single electron wave function and is the tensor product of a spatial component, |ϕ, and a spin component, |↑⟩ or |↓⟩.

In the second quantization formalism, the single-electron and two-electron parts of the BOA Hamiltonians are based only on the relative electron dynamics and are expressed as:

H(1)=i,jhijcicj (83)
H(2)=i,j,k,hijkcicjckc. (84)

The first coefficient, hij, is the single-electron overlap integral; it consists of the kinetic energy and the potential energy for the one electron interaction from state i to state j. The coefficients hii correspond to the unperturbed self-energy of the state, |χi.

The second coefficient hijkl is the two-electron overlap integral which corresponds to the different interaction energies of a system of 2 electrons initially in states i and j ending up in states k and . The two-electron interaction comprises : the Coulomb (i=, j=k) and exchange (i=k, j=) interactions which represent respectively the interactions between electrons and between electrons and nuclei, the double excitation operator (ijk) corresponds to the excitation of both electrons in all four orbital exchanges.

hij=χi|H(1)|χj (85)
=Rχi*(x)22me2α=1AZαe24πϵ0xxαχj(x)dx (86)
hijk=χiχj|H(2)|χkχ (87)
=Rχi*(x1)χj*(x2)χk(x2)χ(x1)e24πϵ0x1x2dx1dx2 (88)

The coefficients hij and hijk for a given set of orbitals, {|χj}, can be computed classically by solving the Hartree–Fock equations [17].

4.2. Hamiltonian Operators in the WB

In order to simulate quantum systems using the WB, we express the different contributions to the molecular Hamiltonians; these are shown in Table 2 [20].

Table 2.

Usual operators of a molecular Hamiltonian.

Operator Second Quantized Form
Energy number operator Hni=hiicici
Coulomb/exchange operator Hcij=hijjicicjcjci
Excitation operator Hexij=hij(cicj+cjci)
Number-excitation operator Hnexijk=hijjk(cicjcjck+ckcjcjci)
Double excitation operator Hdexijk=hijk(cicjckc+cckcjci)

In quantum simulations, we are also interested in the exponential of these operators. We will compute them in the following sections. The decomposition of an exponential form is based on the following quantum gates:

Tj(θ)=100eiθ=|00|+eiθ|11|=cjcj+eiθcjcj (89)

and

Rj(θ)=eiθ00eiθ=eiθ|00|+eiθ|11|=eiθcjcj+eiθcjcj. (90)

The index corresponds to the position of the qubit affected by the operator.

4.2.1. Energy Number Operator

The energy number operator, Hni, gives the electron energy of the i-th state. It is the product of the number operator cicj by hii, which is the mean value of H with respect to |χi, as defined in Section 4.1.

Hni=hiicici (91)

The number operator is idempotent:

(cici)2=cici. (92)

Therefore, we have the exponential:

eiHnit=1+(eihiit1)cici=cici+cici+(eihiit1)cici=cici+eihiitcici=|00|+eihiit|11|=Ti(hiit).

The corresponding circuit is given in Figure 2.

Figure 2.

Figure 2

Quantum circuit for exponential of the number operator.

4.2.2. Coulomb Operator

The Coulomb operators describe Coulomb interactions between two electrons in states i and j. They are written as:

Hcij=hijjicicjcjci. (93)

The product of the two number operators cici and cjcj is still idempotent:

(cicjcjci)2=cicjcjci. (94)

It is then possible to decompose the operator into the sum of involutive operators to obtain

cicjcjci=cicicjcj=14(1Zi)(1Zj),

where Zj=cjcjcjcj. Then, we have the exponential:

eiHcijt=eihijji14(1Zi)(1Zj)t=ehijjit4cos(hijji4)+isin(hijji4)Zicos(hijji4)+isin(hijji4)Zjcos(hijji4)isin(hijji4)ZiZj

besides, we have

cos(hijjit4)+isin(hijjit4)Zj=cos(hijjit4)(cjcj+cjcj)+isin(hijjit4)(cjcjcjcj)=eihijjit4cjcj+eihijjit4cjcj=Rj(hijjit4)

and

cos(hijjit4)isin(hijjit4)ZiZj=cos(hijjit4)(cjcj+cjcj)(cici+cici)+isin(hijjit4)(cjcjcjcj)(cicicici)=eihijjit4(cjcjcici+cjcjcici)eihijjit4(cjcjcici+cjcjcici)=cicicici(cj+cj)eihijjit4cjcj+eihijjit4cjcjcicicici(cj+cj)=(CNOTij)(Rj(hijjit4))(CNOTij)

Thus, the exponential of the Coulomb operator is

eiHcijt=Ri(hijjit4)Rj(hijjit4)(CNOTij)(Rj(hijjit4))(CNOTij). (95)

The corresponding circuit is given in Figure 3.

Figure 3.

Figure 3

Quantum circuit for exponential of the Coulomb operator.

4.2.3. Excitation Operator

The excitation operator has the form:

Hexij=hij(cicj+cjci). (96)

Then, knowing that

(cicj+cjci)2=cicicjcj+cicicjcj (97)
(cicj+cjci)3=cicj+cjci, (98)

its exponential becomes

eiHexijt=1+cos(hijt)1cicicjcj+cicicjcjisin(hijt)cicj+cjci.

In order to express the Hamiltonians using known gates, we will use the JWT. For the sin part, assuming i<j, we obtain

cicj+cjci=k=0i1Zk(|10|i)k=0j1Zk(|01|j)k=0i1Zk(|01|i)k=0j1Zk(|10|j)=k=i+1j1Zk(|1001|ij)+|0110|ij),

since |10|iZi=|10|i and |01|iZi=|01|i.

For the cos part, we have

cicicjcj+cicicjcj=|1010|ij+|0101|ij,

which leads to the final form

eiHexijt=1+(cos(hijt)1)(|1010|ij+|0101|ij)isin(hijt)k=i+1j1Zk(|1001|ij+|0110|ij). (99)

If j=i+1 and hijt=π2, this operator is the swap gate applied to the qubits i and j, and a phase factor on two states. More generally, it is related to the exponential of the swap gate, as shown on Figure 4. If j>i+1, the phase inside the exponential can be transformed into its opposite depending on the state of the intermediate qubits due to the Z gates in the sin term of (99).

eiHexijt=1+(cos(hijt)1)(|1010|ij+|0101|ij)isin(hijt)(|1001|ij+|0110|ij)=eihijtSWAPijC(Tj(hijt))iXiXjC(Tj(hijt))iXiXj, (100)

where the controlled T gates come from the phase factor on the states |1001|ij and |0110|ij.

Figure 4.

Figure 4

Quantum circuit for exponential of the Excitation operator assuming j=i+1.

4.2.4. Number-Excitation Operators

The number-excitation operators are:

Hnexijk=hijjk(cicjcjck+ckcjcjci). (101)

They obey the same kind of relations as the excitation operator:

(cicjcjck+ckcjcjci)2=cicicjcjckck+cicicjcjckck (102)
(cicjcjck+ckcjcjci)3=cicjcjck+ckcjcjci. (103)

Similarly, the exponential gives:

eiHnexijkt=1+cos(hijt)1cicicjcjckck+cicicjcjckckisin(hijt)cicjcjck+ckcjcjci=1+cjcjcos(hijt)1cicickck+cicickckisin(hijt)cick+ckci=cjcj+cjcj1+cos(hijt)1cicickck+cicickckisin(hijt)cick+ckci

In this way, we obtain the gate of the excitation operator controlled by j:

eihijjk(cicjcjck+ckcjcjci)t=C(eiHexikt)j. (104)

This last result is quite natural, since the number-excitation operator results from the combination of the number operator on qubit j and the excitation operator between qubits i and k. The number operator returns the number of qubits in the state j, which is either 0 or 1, so it is the same as controlling the excitation operator by qubit j. Figure 5 represents the corresponding circuit in the case where j=i+1.

Figure 5.

Figure 5

Quantum circuit for exponential of the excitation-number operator.

4.2.5. Double Excitation Operators

The double excitation operators are:

Hdexijk=hijk(cicjckc+cckcjci). (105)

They obey the same kind of relations as the excitation operator:

(cicjckc+cckcjci)2=cicicjcjckckcc+cicicjcjckckcc (106)
(cicjckc+cckcjci)3=cicjckc+cckcjci. (107)

Similarly, assuming i<j<k<, the exponential gives:

eiHdexijkt=1+cos(hijkt)1cicicjcjckckcc+cicicjcjckckccisin(hijkt)cicjckc+cckcjci=1+cos(hijkt)1|11001100|ijk+|00110011|ijkisin(hijkt)p=i+1j1Zpp=k+11Zp|00111100|ijk+|11000011|ijk. (108)

If the condition i<j<k< is not verified, the Z gates do not simplify in the same way, but the global form of the operator remains the same; if hijkt=π2, similarly to the case of the simple excitation operator, we obtain a kind of 16×16 swap gate. Here again, it is possible to write the general form of (108) as a power of that matrix, with phase corrections applied to some states (either the 2 exchanged states or the 14 others). This matrix exchanges two composite sates (not two qubits).

4.3. Hydrogen Molecule

All the preceding results can be used to express the Hamiltonian of a hydrogen molecule, H2. In the BOA, the dynamics of the nuclei can be separated from the dynamics of the electrons. In this case, the wave function for each electron can be deduced from the system’s symmetries. If ϕ1 and ϕ2 are the spatial wave functions of one single hydrogen, then the system can be described through the symmetric and antisymmetric spatial wave functions ϕ+=ϕ1+ϕ2 and ϕ=ϕ1ϕ2 [17]. Taking spin into account, the four basis states are then:

|ξ1=|ϕ+|;|ξ2=|ϕ+|;|ξ2=|ϕ|;|ξ4=|ϕ|, (109)

The BOA Hamiltonian of the hydrogen molecule in the second quantization given in (83) and (84) can thus be written directly in the WB:

H=H(1)+H(2), (110)

where

H(1)=h11c1c1+h22c2c2+h33c3c3+h44c4c4 (111)
H(2)=h1221c1c2c2c1+h3443c3c4c4c3+h1441c1c4c4c1+h2332c2c3c3c2+(h1331h1313)c1c3c3c1+(h2442h2424)c2c4c4c2+(h1423)(c1c4c2c3+c3c2c4c1)+(h1243)(c1c2c4c3+c3c4c2c1)+(h1423)(c1c4c2c3+c3c2c4c1)+(h1243)(c1c2c4c3+c3c4c2c1). (112)

H(1) is the Hamiltonian for isolated electrons (kinetic energy and electron–proton interaction) and therefore only contains number operators. H(2) is the Hamiltonian for electron–electron interactions, so it uses the Coulomb and double excitation operators in H(2). Using the Trotter–Suzuki approximation, the results from Section 4.2 lead to the unitary:

eiHtj=14Tj(hjjΔt)1j<k4Rj(θjkΔt4)Rk(θjkΔt4)(CNOTjk)(Rk(θjkΔt4))(CNOTjk)D1423((h1423)t)D1243((h1243)t)D1423((h1423)t)D1243((h1243)t)tΔt, (113)

where θjk=hjkkjifj+koddhjkkjhjkjkifj+keven and Dijk is the exponential of the double excitation operator, given by (108). The expression in (113) represents the global operator in the form of a product of different quantum gates. The first part of the product in this expression is similar to the one obtained in [17]. The last part in the product is itself a product of the following gates:

D1243(ht)=1+cos(ht)1|11001100|+|00110011|isin(ht)|00111100|+|11000011| (114)
D1423(ht)=1+cos(ht)1|10011001|+|01100110|isin(ht)|10010110|+|01101001| (115)

The corresponding matrices of these two last unitaries are sparse matrices with four non-zero elements and can be easily implemented in practical quantum circuits. We want to emphasize that our method is direct because the Hamiltonians given in (111) and (112) as well as their exponential in (113) can be directly translated into quantum circuits without necessitating the intermediate stage employing the JWT (or the BKT). In our method, the fermionization obtained by the JWT is built in in the GA formalism.

5. GA Representation of the Quantum Ising and XY Hamiltonians

The quantum Ising Hamiltonian serves as a versatile and widely studied model in quantum simulation, providing valuable insights into the behavior of complex quantum systems and serving as a test bed for developing new simulation techniques and exploring emergent phenomena. While it may not capture all the complexities of real-world quantum systems, its simplicity, universality, and experimental feasibility make it an interesting tool for quantum simulation research [13,34,35].

Here we adopt a general approach, inspired from [34,35], considering a general anisotropic transverse Z field XY Hamiltonian, where the quantum Ising Hamiltonian with transverse Z field is a particular case (see hereafter). Both Hamiltonians include a term known as the transverse field, which introduces quantum mechanical effects. The general anisotropic transverse field XY Hamiltonian is given by:

H=12i=1n1((1+γ)XiXi+1+(1γ)YiYi+1)+λi=1nZi. (116)

The first sum accounts for the degree of anisotropy interaction energy, and the second one for the transverse Z field. γ is the anisotropic coefficient, and taking γ=±1 leads to the transverse Z field Ising Hamiltonian, while taking γ=0 leads to the isotropic XX model. The λ factor is the strength of the transverse Z field. Using the reverse JWT, we can write this Hamiltonian in the GA formalism as:

H=12i=1n1(1+γ)(ci+ci)(cicicici)(ci+1+ci+1)(1γ)(cici)(cicicici)(ci+1ci+1)+λi=1n(cicicici)=12i=1n1(1+γ)(cici)(ci+1+ci+1)(1γ)(ci+ci)(ci+1ci+1)+λi=1n(cicicici)=i=1n1(cici+1+ci+1ci)+γ(cici+1cici+1)+λi=1n(12cici)=i=1n1(cici+1+ci+1ci)+γi=1n1(cici+1cici+1)+nλ2λi=1ncici. (117)

Then, by taking eiHt, the first sum gives the excitation operators. The nλ term reduces to a global phase shift, which is meaningless. The last sum gives the number operators.

In the second sum (including the γ factor), we recognize an excitation operator that undergoes the transformation UXiUXi. Indeed, we have:

Xi(cici+1cici+1)Xi=j=0i1Zj(ci+ci)(cici+1cici+1)j=0i1Zj(ci+ci)=(ci+ci)(cici+1cici+1)(ci+ci)=(cicici+1cicici+1)(ci+ci)=ci+1ci+cici+1.

Then, the quantum circuit can be written by using:

eiHteinλi=1n1eiHexi,i+1Δti=1n1XieiHexi,i+1ΔtXii=1nTi(2λ)tΔt. (118)

where the eiHexi,i+1Δt has been calculated in (99).

The corresponding circuit diagram is given in Figure 6.

Figure 6.

Figure 6

Quantum circuit for the quantum anisotropic Ising model simulation given in (117).

6. Conclusions

In this article, we have shown that Geometric Algebra (GA) using the Witt basis (WB) approach is equivalent to the Jordan–Wigner Transformation (JWT) commonly used in quantum simulation. This shows that the formalism of GA can be used to perform operations on Hamiltonians expressed in the second quantized form and to translate them into quantum circuits.

The important issue of our method is to propose a direct computational method in quantum simulation using GA compared to other methods where the direct representations of the excitation operators using quantum circuits cannot be systematically derived, requiring work on each particular case.

GA provides a clear and intuitive framework for representing quantum states and operations and allows a geometric interpretation of quantum operations. This geometric perspective can provide deeper insights into the behavior of quantum systems and facilitate the design and analysis of quantum algorithms and circuits. Dirac notation is translated to GA in a natural way: all expressions are represented in a particular algebra and thus may be manipulated and implemented as algebra elements directly, without any need for matrix representation as is sometimes necessary within the Dirac notation formalism.

Further directions could be explored to improve the method, for example, by further investigating the relation between the geometric product of GA and the tensor product between quantum states in the context of quantum computing. Concerning the Witt Basis (WB) approach, the question rises: is there a more general physical meaning and why does the WB structure describe the fermion second quantization representation so well?

The advantages of GA in scaling compared to qubit methods may vary depending on the specific application and context. GA can lead to more efficient representations of quantum states and operations compared to traditional approaches, such as matrix representations. This reduced complexity can help mitigate the challenges associated with scaling quantum algorithms to larger systems, including computational overhead and resource constraints. Research in this area is ongoing, and further developments may uncover additional advantages of GA in quantum computing scalability.

While JWT has been widely used in quantum computing qubit gate models for simulating fermionic systems, it can introduce stability challenges due to its complexity and error-prone nature. Our approach naturally accommodates the representation of fermionic states and operators and thus offers a more direct, natural, and potentially more stable alternative for representing fermionic systems in quantum computing applications. Also, our method could be applied for a GA representation of the Bravyi–Kitaev transformation, which is also widely used in quantum simulation because it seems less consuming in quantum gate resources.

We plan in the future to investigate some algorithmic implementation of the method presented here, for example, for the determination of molecule ground states.

Author Contributions

Conceptualization, G.V. and Z.T.; methodology, G.V. and Z.T.; validation, G.V. and Z.T., formal analysis, G.V.; investigation G.V. and Z.T.; writing—original draft preparation, G.V. and Z.T.; writing—review and editing, G.V. and Z.T.; supervision, Z.T. All authors have read and agreed to the published version of the manuscript.

Institutional Review Board Statement

Not applicable.

Data Availability Statement

The data presented in this study are available on request from the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest.

Funding Statement

This research received no external funding.

Footnotes

Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

References

  • 1.Geerlings P., Chamorro E., Chattaraj P.K., De Proft F., Gazquez J.L., Liu S., Morell C., Toro-Labbe A., Vela A., Ayers P. Conceptual density functional theory: Status, prospects, issues. Theor. Chem. Accounts. 2020;139:36. doi: 10.1007/s00214-020-2546-7. [DOI] [Google Scholar]
  • 2.Bowler D.R., Miyazaki T. Methods in electronic structure calculations. Rep. Prog. Phys. 2012;75:036503. doi: 10.1088/0034-4885/75/3/036503. [DOI] [PubMed] [Google Scholar]
  • 3.Gubernatis J., Kawashima N., Werne P. Quantum Monte Carlo Methods: Algorithms for Lattice Models. Cambridge University Press; Cambridge, UK: 2016. [Google Scholar]
  • 4.Biamonte J., Bergholm V. Quantum Tensor Networks in a Nutshell. arXiv. 20171708.00006 [Google Scholar]
  • 5.Shikano Y., Watanabe H., Nakanishi K., Ohnishi Y.Y. Post-Hartree–Fock method in quantum chemistry for quantum computer. Eur. Phys. J. Spec. Top. 2021;230:1037–1051. doi: 10.1140/epjs/s11734-021-00087-z. [DOI] [Google Scholar]
  • 6.Venugopalan S.P., Nicola L., Müser M.H. Green’s function molecular dynamics: Including finite heights, shear, and body fields. Model. Simul. Mater. Sci. Eng. 2017;25:034001. doi: 10.1088/1361-651X/aa606b. [DOI] [Google Scholar]
  • 7.Hinchliffe A., Wilson S. Chemical Modelling: Applications and Theory. The Royal Society of Chemistry; London, UK: 2004. Many-body perturbation theory and its application to the molecular structure problem. [DOI] [Google Scholar]
  • 8.Vidal G. Efficient Classical Simulation of Slightly Entangled Quantum Computations. Phys. Rev. Lett. 2003;91:147902. doi: 10.1103/PhysRevLett.91.147902. [DOI] [PubMed] [Google Scholar]
  • 9.Feynman R.P. Simulating physics with computers. Int. J. Theor. Phys. 1982;21:467–488. doi: 10.1007/BF02650179. [DOI] [Google Scholar]
  • 10.Deutsch D. Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. R. Soc. Lond. 2005;400:97–115. [Google Scholar]
  • 11.Kim Y., Eddins A., Anand S., Wei K.X., Van Den Berg E., Rosenblatt S., Nayfeh H., Wu Y., Zaletel M., Temme K., et al. Evidence for the utility of quantum computing before fault tolerance. Nature. 2023;618:500–505. doi: 10.1038/s41586-023-06096-3. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 12.Arute F., Arya K., Babbush R., Bacon D., Bardin J.C., Barends R., Boixo S., Broughton M., Buckley B.B., Buell D.A., et al. Hartree-Fock on a superconducting qubit quantum computer. Science. 2020;369:1084–1089. doi: 10.1126/science.abb9811. [DOI] [PubMed] [Google Scholar]
  • 13.Mc Keever C., Lubasch M. Classically optimized Hamiltonian simulation. Phys. Rev. Res. 2023;5:023146. doi: 10.1103/PhysRevResearch.5.023146. [DOI] [Google Scholar]
  • 14.Henriet L., Beguin L., Signoles A., Lahaye T., Browaeys A., Reymond G.O., Jurczak C. Quantum computing with neutral atoms. Quantum. 2020;4:327. doi: 10.22331/q-2020-09-21-327. [DOI] [Google Scholar]
  • 15.Mermin N.D. Quantum Computer Science. Cambridge University Press; Cambridge, UK: 2007. [Google Scholar]
  • 16.Alán Aspuru-Guzik A.D., Dutoi P.J.L., Head-Gordon M., Dutoi P.J.L., Head-Gordon M. Simulated Quantum Computation of Molecular Energies. Science. 2005;309:1704–1707. doi: 10.1126/science.1113479. [DOI] [PubMed] [Google Scholar]
  • 17.Whitfield J.D., Biamonte J., Aspuru-Guzik A. Simulation of Electronic Structure Hamiltonians Using Quantum Computers. Mol. Phys. 2011;109:735–750. doi: 10.1080/00268976.2011.552441. [DOI] [Google Scholar]
  • 18.Nielsen M.A. The Fermionic Canonical Commutation Relations and the Jordan-Wigner Transform. 2005. [(accessed on 3 April 2024)]. Available online: https://futureofmatter.com/assets/fermions_and_jordan_wigner.pdf.
  • 19.Tranter A., Love P.J., Mintert F., Coveney P.V. A Comparison of the Bravyi-Kitaev and Jordan-Wigner Transformations for the Quantum Simulation of Quantum Chemistry. J. Chem. Theory Comput. 2018;14:5617–5630. doi: 10.1021/acs.jctc.8b00450. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 20.Seeley J.T., Richard M.J., Love P.J. The Bravyi-Kitaev transformation for quantum computation of electronic structure. J. Chem. Phys. 2012;137:224109. doi: 10.1063/1.4768229. [DOI] [PubMed] [Google Scholar]
  • 21.Vince J. Geometric Algebra for Computer Graphics. Springer; Berlin/Heidelberg, Germany: 2008. Chapter 7–8. [Google Scholar]
  • 22.Hestenes D. Space-Time Algebra. Birkhäuser; Basel, Switzerland: 1966. Chapter 1. [Google Scholar]
  • 23.Doran C., Lasenby A. Geometric Algebra for Physicists. Cambridge University Press; Cambridge, UK: 2003. [Google Scholar]
  • 24.Hildenbrand D. Foundations of geometric algebra computing. AIP Conf. Proc. 2012;1479:27–30. [Google Scholar]
  • 25.Cafaro C., Mancini S. A Geometric Algebra Perspective On Quantum Computational Gates And Universality In Quantum Computing. Adv. Appl. Clifford Algebr. 2010;21:493–519. doi: 10.1007/s00006-010-0269-x. [DOI] [Google Scholar]
  • 26.Havel T.F., Doran C.J.L. A Bloch-Sphere-Type Model for Two Qubits in the Geometric Algebra of a 6-D Euclidean Vector Space; Proceedings of Quantum Information and Computation II; Orlando, FL, USA. 12–16 April 2004; [DOI] [Google Scholar]
  • 27.Havel T.F., Doran C.J.L. Geometric Algebra in Quantum Information Processing. American Mathematical Society; Providence, RI, USA: 2000. [DOI] [Google Scholar]
  • 28.Vlasov A.Y. Clifford algebras and universal sets of quantum gates. Phys. Rev. A. 2001;63:054302. doi: 10.1103/PhysRevA.63.054302. [DOI] [Google Scholar]
  • 29.Hrdina J., Návrat A., vík P.V. Quantum computing based on complex Clifford algebras. Quantum Inf. Process. 2022;21:310. doi: 10.1007/s11128-022-03648-w. [DOI] [Google Scholar]
  • 30.Reynoso A. Probing Clifford Algebras through Spin Groups: A Standard Model Perspective. arXiv. 20232312.10071 [Google Scholar]
  • 31.Doran C., Hestenes D., Sommen F., Acker N.V. Lie groups as spin groups. J. Math. Phys. 1993;34:3642–3669. doi: 10.1063/1.530050. [DOI] [Google Scholar]
  • 32.Brackx F., Schepper H.D., Souček V. On the Structure of Complex Clifford Algebra. Adv. Appl. Clifford Algebr. 2011;21:477–492. doi: 10.1007/s00006-010-0270-4. [DOI] [Google Scholar]
  • 33.Coleman P. Introduction to Many-Body Physics. Cambridge University Press; Cambridge, UK: 2015. Chapter 4. [Google Scholar]
  • 34.Verstraete F., Cirac J.I., Latorre J.I. Quantum circuits for strongly correlated quantum systems. Phys. Rev. A. 2009;79:032316. doi: 10.1103/PhysRevA.79.032316. [DOI] [Google Scholar]
  • 35.Cervera-Lierta A. Exact Ising model simulation on a quantum computer. Quantum. 2018;2:114. doi: 10.22331/q-2018-12-21-114. [DOI] [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Data Availability Statement

The data presented in this study are available on request from the corresponding author.


Articles from Entropy are provided here courtesy of Multidisciplinary Digital Publishing Institute (MDPI)

RESOURCES