Among potential experimental realizations of scalable quantum computing (QC), superconducting qubits of various kinds have received the bulk of the public’s attention. In addition to their promise, this is largely because IBM and Google have both chosen to pour money and resources into developing superconducting devices for QC. As massive tech companies, they are both well-known to the public and have some experience in developing and scaling the fabrication methods used to make superconducting circuits. This expertise made superconducting their natural technology of choice and since then has stimulated rapid progress, another reason for so much press coverage.

Meanwhile, trapped ions, another candidate for scalable QC, has reached a similar level of maturity while receiving much less attention. Instead of the “artificial atoms” engineered in superconducting circuits, trapped ions do computation using the energy levels of an actual atom that has been ionized so that it can be trapped by electric (and/or magnetic, depending on your trap architecture) fields.

One example of such a qubit is the two hyperfine-split ground state levels of an Ytterbium-171 ion. Hyperfine splitting of an energy level is due to the interaction between the total electron angular momentum and the nuclear spin. Yb-171 has a nuclear spin of 1/2 so each of its energy levels, including the ground state, is split into two different levels, one for spin up and one for spin down. By labeling one of these states |0> and the other |1>, we have ourselves a qubit. I won’t talk much more about how these qubits are implemented and controlled here because hopefully I’ll cover that in future posts.

Instead, I figured there would be no better way to start off my QCJC contributions than by comparing trapped ions with superconducting qubits. Thus far, QCJC (at least the experimental posts) has predominantly been about superconducting qubits because, duh, Chunny works in a superconducting lab. Norbert Linke and Chris Monroe, on the other hand, do not. Instead, Chris Monroe is the PI of a trapped ion group at UMD and Norbert Linke is a research scientist in that group.

Last year, along with collaborators from inside and outside their group, they published a comparison of a five-qubit trapped-ion quantum computer that they built with the five-qubit superconducting quantum computer made publicly available online by IBM. Both systems are full-stack, fully-programmable universal quantum computers, but they are also both noisy. This means that their qubits decohere over time and their gates are not perfectly implemented.

To avoid decoherence, it is important that gate times are much shorter than the decoherence time so that all of the gates required for an algorithm can be performed without having to worry about the quality of the qubit degrading. Superconducting devices decohere through state relaxation (T1 = 60 us) and dephasing (T2* = 60 us) while trapped ions only decohere via dephasing (T2* = 0.5 s). Although superconducting qubits decohere much more quickly than hyperfine qubits do, they also have much faster gate times at 130 ns for one-qubit gates and between 250 and 450 ns for two-qubit gates compared to 20 us and 250 us for one- and two-qubit gates, respectively.

Gate time is not the only consideration for avoiding decoherence since different numbers of gates may be needed in each architecture due to different sets being available. Trapped ions can implement arbitrary rotations on single qubits and XX entangling gates on two qubits. IBM makes the Clifford+T gate set available in their interface and have a compiler that optimizes the actual implementation of whatever algorithm one gives. Using fewer gates decreases the total time needed for the calculation, thus preventing more decoherence, but it also decreases the impact of gate errors because there are less chances for them to occur.

The final important difference between the two architectures is their level of connectivity. Currently, not all superconducting qubits on the IBM chip are able to interact directly because they are confined to a planar geometry and a direct connection is need to apply a two-qubit gate. two non-connected qubits can still become entangled by using an intermediary qubit, but this requires the use of extra gates, which takes time and gives more opportunities for errors to creep in. In contrast, any two ions in the same trap can interact by using the collective motion of all the ions as an information bus (I need to read the paper that proposes this and write a QCJC submission on it in the future because I don’t really understand it).

With all of this in mind, Linke and his team first implemented a Margolus gate on both systems. This gate is the same as a Toffoli gate except that it introduces a phase on the |001> state and can be implemented with fewer elementary gates. In particular, the star-shaped connectivity graph of the superconducting system does not require any extra gates to implement it. The IBM system completed this circuit with a success probability of 74.1(7)% and the trapped ion system had a success probability of 90.1(2)%. For full Toffoli gates, the success probabilities were 52.6(8)% and 85.0(2)%. All of these figures are based on state tomography done after the gates were implemented.

Next, they ran an algorithm to find the *c* of a black box that implements a function *f(x) = x • c*. Known as the Bernstein-Vazirani problem, this requires multiple queries to the function oracle for classical systems but can be completed in one query by a quantum computer. This particular algorithm maps well onto the star-shaped connectivity architecture of the IBM chip. The success probabilities for completing this algorithm were 72.8(5)% for superconducting and 85.1(1)% for trapped ions.

Finally, the two systems were made to solve the hidden shift problem, in which an oracle calculates a known function *f(x)* but with a “hidden shift”:* f(x + s)*. The idea of the algorithm is to find this hidden shift *s*. This algorithm is not nearly so kind to IBM’s connectivity graph, resulting in a success probability of only 35.1(6)% compared to 77.1(2) for the trapped ion quantum computer.

Overall, this may seem like a victory for trapped ions, but we have no way of knowing how these comparisons will change as both systems are further developed and scaled up. Neither has hit any fundamental obstacles to scaling yet. Both are still promising technologies with their own strengths and weaknesses and there is a reason that Google and IBM have chosen to focus on superconducting circuits. With their expertise in fabrication and scaling technologies, rapid progress that outpaces trapped ions could be on the horizon. Or, it might be the case that using the two together, or one with some other technology, will prove to be the architecture of the future.

Source: Linke, N. M., *et al.* Experimental Comparison of Two Quantum Computing Architectures *PNAS ***114 **(13) 3305-3310 (2017)

That’s so cool! Great to see that this architecture is beating IBM’s superconducting qubits, and might be a viable competitor in the near future. (Also that 35.1(6)% success rate… ouch )

I’m really interested in this idea of an information bus for connectivity! It’s unclear to me how multiple ions in the same trap are able to “talk” to each other without interfering like crazy. Even if you could control and measure each one individually, would all the ions be completely connected with every other ion without a crazy amount of edge effects? Ie, if a trap has 10 ions in it, and you want to do a CNOT between 1 and 5, could you do that without accidentally influencing ions 2-4 and 6-10? Looking forwards to more info in the future :)

LikeLike