Efficient quantum programming using EASE gates on a trapped-ion quantum computer

Nikodem Grzesiak; Andrii Maksymov; Pradeep Niroula; Yunseong Nam

doi:10.22331/q-2022-01-27-634

Efficient quantum programming using EASE gates on a trapped-ion quantum computer

Nikodem Grzesiak¹, Andrii Maksymov¹, Pradeep Niroula^2,3, and Yunseong Nam^1,4

¹IonQ, College Park, MD 20740, USA
²Joint Center for Quantum Information and Computer Science, NIST/University of Maryland, College Park, MD 20742, USA
³Joint Quantum Institute, University of Maryland, College Park, MD 20742, USA
⁴Department of Physics, University of Maryland, College Park, MD 20742, USA

Published:	2022-01-27, volume 6, page 634
Eprint:	arXiv:2107.07591v2
Doi:	https://doi.org/10.22331/q-2022-01-27-634
Citation:	Quantum 6, 634 (2022).

Find this paper interesting or want to discuss? Scite or leave a comment on SciRate.

Abstract

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 an $n$-qubit Clifford circuit can be implemented using 6log($n$) EASE gates, an $n$-qubit multiply-controlled NOT gate can be implemented using 3$n$/2 EASE gates, and an $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.

Popular summary

Trapped-ion quantum computers are capable of exotic operations which entangle several qubits at once. One such powerful operation is the Efficient, Arbitrary, Simultaneously Entangling (EASE) gate. We show that EASE gates make it drastically easier to implement circuit elements for universal quantum computation: An n-qubit Clifford circuit can be applied in only 6log(n) EASE gates, an n-qubit multiply-controlled NOT gate in 3n/2 EASE gates, and an n-qubit permutation in only six EASE gates.

► BibTeX data

@article{Grzesiak2022efficientquantum,
  doi = {10.22331/q-2022-01-27-634},
  url = {https://doi.org/10.22331/q-2022-01-27-634},
  title = {Efficient quantum programming using {EASE} gates on a trapped-ion quantum computer},
  author = {Grzesiak, Nikodem and Maksymov, Andrii and Niroula, Pradeep and Nam, Yunseong},
  journal = {{Quantum}},
  issn = {2521-327X},
  publisher = {{Verein zur F{\"{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}},
  volume = {6},
  pages = {634},
  month = jan,
  year = {2022}
}

► References

[1] C. J. Hughes, Synthesis Lectures on Computer Architecture 10, 1 (2015).
https://doi.org/10.2200/S00647ED1V01Y201505CAC032

[2] N. Grzesiak, R. Blümel, K. Wright, K. M. Beck, N. C. Pisenti, M. Li, V. Chaplin, J. M. Amini, S. Debnath, J.-S. Chen, et al., Nature communications 11, 1 (2020).
https://doi.org/10.1038/s41467-020-16790-9

[3] D. Maslov and Y. Nam, New Journal of Physics 20, 033018 (2018).
https://doi.org/10.1088/1367-2630/aaa398

[4] K. Groenland, F. Witteveen, K. Schoutens, and R. Gerritsma, New Journal of Physics 22, 063006 (2020).
https://doi.org/10.1088/1367-2630/ab8830

[5] J. van de Wetering, New Journal of Physics 23, 043015 (2021).
https://doi.org/10.1088/1367-2630/abf1b3

[6] S.-L. Zhu, C. Monroe, and L.-M. Duan, Europhysics Letters (EPL) 73, 485–491 (2006).
https://doi.org/10.1209/epl/i2005-10424-4

[7] R. Duncan, A. Kissinger, S. Perdrix, and J. Van De Wetering, Quantum 4, 279 (2020).
https://doi.org/10.22331/q-2020-06-04-279

[8] Q. Wang, M. Li, C. Monroe, and Y. Nam, Quantum 5, 509 (2021).
https://doi.org/10.22331/q-2021-07-26-509

[9] C. Moore and M. Nilsson, SIAM Journal on Computing 31, 799 (2001).
https://doi.org/10.1137/S0097539799355053

[10] P. Niroula and Y. Nam, npj Quantum Information 7, 1 (2021).
https://doi.org/10.1038/s41534-021-00369-3

Cited by

[1] Sergey Bravyi, Dmitri Maslov, and Yunseong Nam, "Constant-Cost Implementations of Clifford Operations and Multiply-Controlled Gates Using Global Interactions", Physical Review Letters 129 23, 230501 (2022).

[2] Timothy Proctor, Stefan Seritan, Kenneth Rudinger, Erik Nielsen, Robin Blume-Kohout, and Kevin Young, "Scalable Randomized Benchmarking of Quantum Computers Using Mirror Circuits", Physical Review Letters 129 15, 150502 (2022).

[3] Pascal Baßler, Matthias Zipper, Christopher Cedzich, Markus Heinrich, Patrick H. Huber, Michael Johanning, and Martin Kliesch, "Synthesis of and compilation with time-optimal multi-qubit gates", Quantum 7, 984 (2023).

The above citations are from Crossref's cited-by service (last updated successfully 2023-06-05 09:31:40) and SAO/NASA ADS (last updated successfully 2023-06-05 09:31:41). The list may be incomplete as not all publishers provide suitable and complete citation data.

This Paper is published in Quantum under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. Copyright remains with the original copyright holders such as the authors or their institutions.