Designing scalable quantum logic gates using "soft" continuous pulses

Andrei Galiautdinov, Michael R. Geller

Superconducting qubits with tunable coupling are ideally suited for fast and accurate implementation of quantum logic. Here we present a simple approach, based on Weyl chamber steering, to CNOT gate design for inductively coupled phase qubits with tunable coupling strength g. In the presence of simultaneous rf pulses on the individual qubits that appropriately track the coupling strength as it is varied, we show that an infinite family of switching sequences preserving the time integral or "area" of g can be used to generate CNOT logic. We demonstrate our approach by considering time-dependencies most likely to be used in actual implementations: trapezoidal, sine, and soft quartic (also known as Landau's hat).

Joseph Emerson

Pinaki Sengupta, Leonid P. Pryadko

We present a scalable scheme to design optimized soft pulses and pulse sequences for coherent control of interacting quantum many-body systems. The scheme is based on the cluster expansion and the time-dependent perturbation theory implemented numerically. This approach offers a dramatic advantage in numerical efficiency, and it is also more convenient than the commonly used Magnus expansion, especially when dealing with higher-order terms. We illustrate the scheme by designing 2nd-order self-refocusing pi pulses and a 6th-order 8-pulse refocusing sequence for a chain of qubits with nearest-neighbor couplings. We also discuss the performance of soft-pulse refocusing sequences in suppressing decoherence due to low-frequency environment.

Nadia Nedjah, Sérgio Raposo, Luiza de Macedo Mourelle

Selçuk Çakmak, Murat Kurt, Azmi Gençten

Abstract This study proposes and construct a primitive quantum arithmetic logic unit (qALU) based on the quantum Fourier transform (QFT). The qALU is capable of performing arithmetic ADD (addition) and logic NAND gate operations. It designs a scalable quantum circuit and presents the circuits for driving ADD and NAND operations on two‐input and four‐input quantum channels, respectively. By comparing the required number of quantum gates for serial and parallel architectures in executing arithmetic addition, it evaluates the performance. It also execute the proposed quantum Fourier transform‐based qALU design on real quantum processor hardware provided by IBM. The results demonstrate that the proposed circuit can perform arithmetic and logic operations with a high success rate. Furthermore, it discusses in detail the potential implementations of the qALU circuit in the field of computer science, highlighting the possibility of constructing a soft‐core processor on a quantum processing unit.

J. Wilson Staples, Winston Fu, Jeff D. Thompson

The large overhead imposed by quantum error correction is a critical challenge to the realization of quantum computers, and motivates searching for alternative error correcting codes and fault-tolerant circuit constructions. Postselection is a powerful tool that builds large programs out of probabilistically generated sub-circuits, and has been shown to increase the threshold of quantum error correction based on fusing fixed-size resource states or concatenated codes. In this work, we present an approach to lower the overhead of quantum computing using scalable postselection, based on directly postselecting sub-circuits with a size extensive in the code distance using decoder soft information. We introduce a metric, the partial gap, that estimates what the logical gap of a resource state will be after it is consumed, and show that postselection based on the partial gap leads to scalable improvements in the logical error rate. In the specific context of implementing logical gates via teleportation through a cluster state, we demonstrate that scalable postselection provides a $4\times$ reduction in the overhead per logical gate, at the same logical error probability.