Constant-cost implementations of Clifford operations and multiply controlled gates using global interactions

@article{Bravyi2022ConstantcostIO,
  title={Constant-cost implementations of Clifford operations and multiply controlled gates using global interactions},
  author={Sergey Bravyi and Dmitrii L. Maslov and Yun Seong Nam},
  journal={ArXiv},
  year={2022},
  volume={abs/2207.08691}
}
A frequent physical-level requirement for the ability to implement quantum operations simultaneously is their commutativity. In this work, we asked if quantum computation by commuting Ising-type entangling operations and “free” single-qubit gates can be advantageous compared to quantum computation by the two-qubit gates and “free” single-qubit gates. We focused on the elements of the Clifford group and the multiply controlled gates. It turned out that such circuits and composite gates can be… 

References

SHOWING 1-10 OF 25 REFERENCES

Constructing quantum circuits with global gates

The problem of converting a given circuit that uses 2-qubit gates to one that uses global gates is studied, and a general strategy to transform a global gate that targets all qubits into one that targets only a subset of the qubits is found.

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.

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 the

Elementary gates for quantum computation.

U(2) gates are derived, which derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two- and three-bit quantum gates, the asymptotic number required for n-bit Deutsch-Toffoli gates, and make some observations about the number of unitary operations on arbitrarily many bits.

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.

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

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

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.

Compiling quantum algorithms for architectures with multi-qubit gates

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.

Two-qubit entangling gates within arbitrarily long chains of trapped ions

Ion trap quantum computers are based on modulating the Coulomb interaction between atomic ion qubits using external forces. However, the spectral crowding of collective motional modes could pose a