No Arabic abstract
Efficiently entangling pairs of qubits is essential to fully harness the power of quantum computing. Here, we devise an exact protocol that simultaneously entangles arbitrary pairs of qubits on a trapped-ion quantum computer. The protocol requires classical computational resources polynomial in the system size, and very little overhead in the quantum control compared to a single-pair case. We demonstrate an exponential improvement in both classical and quantum resources over the current state of the art. We implement the protocol on a software-defined trapped-ion quantum computer, where we reconfigure the quantum computer architecture on demand. Together with the all-to-all connectivity available in trapped-ion quantum computers, our results establish that trapped ions are a prime candidate for a scalable quantum computing platform with minimal quantum latency.
Quantum computing is currently limited by the cost of two-qubit entangling operations. In order to scale up quantum processors and achieve a quantum advantage, it is crucial to economize on the power requirement of two-qubit gates, make them robust to drift in experimental parameters, and shorten the gate times. In this paper, we present two methods, one exact and one approximate, to construct optimal pulses for entangling gates on a pair of ions within a trapped ion chain, one of the leading quantum computing architectures. Our methods are direct, non-iterative, and linear, and can construct gate-steering pulses requiring less power than the standard method by more than an order of magnitude in some parameter regimes. The power savings may generally be traded for reduced gate time and greater qubit connectivity. Additionally, our methods provide increased robustness to mode drift. We illustrate these trade-offs on a trapped-ion quantum computer.
Parallel operations in conventional computing have proven to be an essential tool for efficient and practical computation, and the story is not different for quantum computing. Indeed, there exists a large body of works that study advantages of parallel implementations of quantum gates for efficient quantum circuit implementations. Here, we focus on the recently invented efficient, arbitrary, simultaneously entangling (EASE) gates, available on a trapped-ion quantum computer. Leveraging its flexibility in selecting arbitrary pairs of qubits to be coupled with any degrees of entanglement, all in parallel, we show a $n$-qubit Clifford circuit can be implemented using $6log(n)$ EASE gates, a $n$-qubit multiply-controlled NOT gate can be implemented using $3n/2$ EASE gates, and a $n$-qubit permutation can be implemented using six EASE gates. We discuss their implications to near-term quantum chemistry simulations and the state of the art pattern matching algorithm. Given Clifford + multiply-controlled NOT gates form a universal gate set for quantum computing, our results imply efficient quantum computation by EASE gates, in general.
A global race towards developing a gate-based, universal quantum computer that one day promises to unlock the never before seen computational power has begun and the biggest challenge in achieving this goal arguably is the quality implementation of a two-qubit gate. In a trapped-ion quantum computer, one of the leading quantum computational platforms, a two-qubit gate is typically implemented by modulating the individual addressing beams that illuminate the two target ions, which, together with others, form a linear chain. The required modulation, expectedly so, becomes increasingly more complex, especially as the quantum computer becomes larger and runs faster, complicating the control hardware design. Here, we develop a simple method to essentially remove the pulse-modulation complexity at the cost of engineering the normal modes of the ion chain. We demonstrate that the required mode engineering is possible for a three ion chain, even with a trapped-ion quantum computational system built and optimized for a completely different mode of operations. This indicates that a system, if manufactured to target specifically for the mode-engineering based two-qubit gates, would readily be able to implement the gates without significant additional effort.
A quantum algorithm can be decomposed into a sequence consisting of single qubit and 2-qubit entangling gates. To optimize the decomposition and achieve more efficient construction of the quantum circuit, we can replace multiple 2-qubit gates with a single global entangling gate. Here, we propose and implement a scalable scheme to realize the global entangling gates on multiple $yb$ ion qubits by coupling to multiple motional modes through external fields. Such global gates require simultaneously decoupling of multiple motional modes and balancing of the coupling strengths for all the qubit-pairs at the gate time. To satisfy the complicated requirements, we develop a trapped-ion system with fully-independent control capability on each ion, and experimentally realize the global entangling gates. As examples, we utilize them to prepare the Greenberger-Horne-Zeilinger (GHZ) states in a single entangling operation, and successfully show the genuine multi-partite entanglements up to four qubits with the state fidelities over $93.4%$.
We present a general theory for laser-free entangling gates with trapped-ion hyperfine qubits, using either static or oscillating magnetic-field gradients combined with a pair of uniform microwave fields symmetrically detuned about the qubit frequency. By transforming into a `bichromatic interaction picture, we show that either ${hat{sigma}_{phi}otimeshat{sigma}_{phi}}$ or ${hat{sigma}_{z}otimeshat{sigma}_{z}}$ geometric phase gates can be performed. The gate basis is determined by selecting the microwave detuning. The driving parameters can be tuned to provide intrinsic dynamical decoupling from qubit frequency fluctuations. The ${hat{sigma}_{z}otimeshat{sigma}_{z}}$ gates can be implemented in a novel manner which eases experimental constraints. We present numerical simulations of gate fidelities assuming realistic parameters.