Constructing quantum circuits with global gates

  title={Constructing quantum circuits with global gates},
  author={J. J. Van De Wetering},
  journal={New Journal of Physics},
There are various gate sets that can be used to describe a quantum computation. A particularly popular gate set in the literature on quantum computing consists of arbitrary single-qubit gates and two-qubit CNOT gates. A CNOT gate is however not always the natural multi-qubit interaction that can be implemented on a given physical quantum computer, necessitating a compilation step that transforms these CNOT gates to the native gate set. An especially interesting case where compilation is… 
Efficient quantum programming using EASE gates on a trapped-ion quantum computer
This work focuses on the recently invented efficient, arbitrary, simultaneously entangling EASE gates, available on a trapped-ion quantum computer, and shows their flexibility in selecting arbitrary pairs of qubits to be coupled with any degrees of entanglement, all in parallel.
Synthesis of and compilation with time-optimal multi-qubit gates
We develop a method to synthesize a class of entangling multi-qubit gates for a quantum computing platform with fixed Ising-type interaction with all-to-all connectivity. The only requirement on the
Phase gadget compilation for diagonal qutrit gates
Phase gadgets have proved to be an indispensable tool for reasoning about ZX-diagrams, being used in optimisation and simulation of quantum circuits and the theory of measurement-based quantum
Spin-networks in the ZX-calculus
This paper writes the spin-networks of loop quantum gravity in the ZX-diagrammatic language of quantum computation by writing the Yutsis diagrams, a standard graphical calculus used in quantum chemistry and quantum gravity, which captures the main features of SU(2) representation theory.


Signal processing techniques for efficient compilation of controlled rotations in trapped ions
Quantum logic gates with many control qubits are essential in many quantum algorithms, but remain challenging to perform in current experiments. Trapped ion quantum computers natively feature a
Parallel entangling operations on a universal ion-trap quantum computer
Parallel two-qubit entangling gates are realized in an array of fully connected trapped-ion qubits, achieving a full-adder operation on a quantum processor with an average fidelity of 83.3 per cent.
Decompositions of n-qubit Toffoli Gates with Linear Circuit Complexity
Toffoli gates are natural elements for the circuit model based quantum computation. We investigate general resource requirements for arbitrary n-qubit Toffoli gate. These resources consist of the
Demonstration of a small programmable quantum computer with atomic qubits
A five-qubit trapped-ion quantum computer that can be programmed in software to implement arbitrary quantum algorithms by executing any sequence of universal quantum logic gates, which provides the flexibility to implement a variety of algorithms without altering the hardware.
Compiling Quantum Algorithms for Architectures with Multi-qubit Gates (Open Access, Publisher's Version)
A numerical optimization protocol that minimizes the number of required multi-qubit entangling gates by design is demonstrated and adapted for state preparation, and quantum algorithms including in-sequence measurements.
Efficient arbitrary simultaneously entangling gates on a trapped-ion quantum computer
An exact protocol that simultaneously entangles arbitrary pairs of qubits on a trapped-ion quantum computer that demonstrates an exponential improvement in both classical and quantum resources over the current state of the art.
Efficient construction of three- and four-qubit quantum gates by global entangling gates
We present improved circuits for the Toffoli gate and the control-swap (Fredkin) gate using three and four global two-qubit gates, respectively. This is a nearly double speedup compared to the
An efficient quantum compiler that reduces T count
This work implemented several efficient quantum compilers for multi-qubit Clifford + $T$ circuits in C++ and benchmarked them on random circuits, from which it is determined that the TODD compiler yields the lowest number of gates in a circuit on average.
Automated optimization of large quantum circuits with continuous parameters
An automated methods for optimizing quantum circuits of the size and type expected in quantum computations that outperform classical computers are developed and implemented and a collection of fast algorithms capable of optimizing large-scale quantum circuits are reported.
A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
No knowledge of quantum error correction is necessary to understand the schemes in this paper, but only the concepts of qubits and measurements, which are based on surface-code patches.