New article preprint: Quantum circuits for maximally entangled states

Last April 16, Alba Cervera-Lierta, José Ignacio Latorre and Dardo Goyeneche published an arXiv preprint titled “Quantum circuits for maximally entangled states”

One of the main goals of this article is to propose simple quantum circuits (short depth and basic gates) that can be used to test and compare current quantum computers.

Quantum computers should be able to generate and hold highly entangled states. Otherwise, we have very sophisticated classical techniques (such as tensor networks) that can simulate efficiently slightly entangled states.

Following this idea, they proposed to construct circuits that generate Absolutely Maximally Entangled (AME) states. AME states are those pure states which maximally entangle all their bipartitions. A simple way to construct an AME state is by using graph states, that is, states that can be constructed from a graph. Each graph vertex corresponds with the operation F|0> (F = Fourier gate) and each edge is a CZ gate. For example, this circuit generates the AME(5,2) (5 qudits of dimension 2, that is, 5 qubits). For qubits, the operation F|0> is just H|0>.

The existence of AME states for any number of parties and any local dimension is an open problem. For more information, check Felix Huber table for a summary of known AME states:

For qubits, there only exist AME states for n=2 (Bell state), 3 (GHZ state), 5 and 6. This fact totally constraints the number of circuits that we can construct in current quantum computers… So they propose to “simulate” AME states of d>2 using qubits by implementing the mapping

|0> –> |00>,
|1> –> |01>,
|2> –> |10>,

With this mapping, one has “to adjust” the Fourier gates and the generalized CZ gates to multiqubit states. The explicit circuits and details about this mapping can be found in the main paper.

As a final remark, they also find an interesting property of these circuits. It turns out that AME (graph) state circuits majorize, that is, after applying each CZ gate (step), the entanglement of all bipartitions increases or remains equal, never decreases (entanglement measured with entropy S or eigenvalues of the reduced density matrix). In a sense, these circuits maximally entangle all their bipartitions in a very optimal way.

Can we use this property to find and construct highly entangled states, new AME states or simplify current quantum circuits? We will see.

Finally, they implement an AME(5,2) state in a current quantum computer: 3 H gates and 5 CZ gates. The results are not very encouraging… But one should take into account that this is a very hard test for a quantum computer, to force it to maximally entangle all its parts!

New publication by Alba Cervera-Lierta and José Ignacio Latorre

Quantic PhD student Alba Cervera-Lierta and our P.I. José Ignacio Latorre have published a new article on Journal of Physics A: Mathematical and Theoretical.

The article title is “Multipartite entanglement in spin chains and the hyperdeterminant” and the reference is J. Phys. A: Math. Theor. 51 505301 (2018) (arXiv: [quant-ph] 1802.02596).

In this work, they study the multipartite entanglement in spin chains, in particular in the Ising model, XXZ model and Haldane-Shastry model.

As a figure of merit to quantify multipartite entanglement they use the Cayley hyperdeterminant, which is a polynomial constructed with the components of the wave function which is invariant under local unitary transformation. For n=2 and n=3, the hyperdeterminant coincides with the concurrence and the tangle respectively, well known figures of merit for multipartite entanglement. For n=4, Hyperdeterminant is a polynomial of degree 24 that can be written in terms of more simple polynomials, S and T, of degree 8 and 12 respectively.

They observe that these polynomials are able to capture the phase transitions present in the models studied as well as a subclass of quadripartite entanglement present in the eigenstates.

Besides spin chains, they also study the quadripartite entanglement of random states, ground states of random matrix Hamiltonians in the Wigner-Syson Gaussian ensambles and the quadripartite entangled states defined by Vestraete et al in 2002.

This figure shows the hyperdeterminant for the ground state and second excited state of a n=4 Ising spin chain as a function of the transverse magnetic field λ. For an infinite chain, this model has a phase transition at λ=1. As can be seen, the hyperdeterminant peaks close to this phase transition.

Researchers’ night 2018

Pol Forn-Díaz and Alba Cervera-Lierta have participated in European Researchers’ Night 2018 by giving a talk at Cosmocaixa, Barcelona.

They gave a microtalk which consisted on 8 minutes talk about some scientific topic explained to a general audience. First, Alba presented what is a quantum computer and what are its aplications: to study new chemical reactions, to solve optimization problems or to simulate quantum systems. Second, Pol explained how it works and what is the appearence of its building blocks, qubits. In particular, he showed how is our quantum processor made of superconducting qubits.

 

Quantic team members are very active in scientific outreach activities. Follow us on twitter to stay informed about future events!