{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T16:14:05Z","timestamp":1762272845811,"version":"3.40.5"},"reference-count":10,"publisher":"Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften","license":[{"start":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T00:00:00Z","timestamp":1643241600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["quantum-journal.org"],"crossmark-restriction":false},"short-container-title":["Quantum"],"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<\/mml:mi><\/mml:math>-qubit Clifford circuit can be implemented using 6log(n<\/mml:mi><\/mml:math>) EASE gates, an n<\/mml:mi><\/mml:math>-qubit multiply-controlled NOT gate can be implemented using 3n<\/mml:mi><\/mml:math>\/2 EASE gates, and an n<\/mml:mi><\/mml:math>-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.<\/jats:p>","DOI":"10.22331\/q-2022-01-27-634","type":"journal-article","created":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T13:55:26Z","timestamp":1643291726000},"page":"634","update-policy":"https:\/\/doi.org\/10.22331\/q-crossmark-policy-page","source":"Crossref","is-referenced-by-count":9,"title":["Efficient quantum programming using EASE gates on a trapped-ion quantum computer"],"prefix":"10.22331","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9016-2673","authenticated-orcid":false,"given":"Nikodem","family":"Grzesiak","sequence":"first","affiliation":[{"name":"IonQ, College Park, MD 20740, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8244-2851","authenticated-orcid":false,"given":"Andrii","family":"Maksymov","sequence":"additional","affiliation":[{"name":"IonQ, College Park, MD 20740, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8941-7774","authenticated-orcid":false,"given":"Pradeep","family":"Niroula","sequence":"additional","affiliation":[{"name":"Joint Center for Quantum Information and Computer Science, NIST\/University of Maryland, College Park, MD 20742, USA"},{"name":"Joint Quantum Institute, University of Maryland, College Park, MD 20742, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2742-3447","authenticated-orcid":false,"given":"Yunseong","family":"Nam","sequence":"additional","affiliation":[{"name":"IonQ, College Park, MD 20740, USA"},{"name":"Department of Physics, University of Maryland, College Park, MD 20742, USA"}]}],"member":"9598","published-online":{"date-parts":[[2022,1,27]]},"reference":[{"key":"0","doi-asserted-by":"publisher","unstructured":"C. J. Hughes, Synthesis Lectures on Computer Architecture 10, 1 (2015).","DOI":"10.2200\/S00647ED1V01Y201505CAC032"},{"key":"1","doi-asserted-by":"publisher","unstructured":"N. Grzesiak, R. Bl\u00fcmel, 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).","DOI":"10.1038\/s41467-020-16790-9"},{"key":"2","doi-asserted-by":"publisher","unstructured":"D. Maslov and Y. Nam, New Journal of Physics 20, 033018 (2018).","DOI":"10.1088\/1367-2630\/aaa398"},{"key":"3","doi-asserted-by":"publisher","unstructured":"K. Groenland, F. Witteveen, K. Schoutens, and R. Gerritsma, New Journal of Physics 22, 063006 (2020).","DOI":"10.1088\/1367-2630\/ab8830"},{"key":"4","doi-asserted-by":"publisher","unstructured":"J. van de Wetering, New Journal of Physics 23, 043015 (2021).","DOI":"10.1088\/1367-2630\/abf1b3"},{"key":"5","doi-asserted-by":"publisher","unstructured":"S.-L. Zhu, C. Monroe, and L.-M. Duan, Europhysics Letters (EPL) 73, 485\u2013491 (2006).","DOI":"10.1209\/epl\/i2005-10424-4"},{"key":"6","doi-asserted-by":"publisher","unstructured":"R. Duncan, A. Kissinger, S. Perdrix, and J. Van De Wetering, Quantum 4, 279 (2020).","DOI":"10.22331\/q-2020-06-04-279"},{"key":"7","doi-asserted-by":"publisher","unstructured":"Q. Wang, M. Li, C. Monroe, and Y. Nam, Quantum 5, 509 (2021).","DOI":"10.22331\/q-2021-07-26-509"},{"key":"8","doi-asserted-by":"publisher","unstructured":"C. Moore and M. Nilsson, SIAM Journal on Computing 31, 799 (2001).","DOI":"10.1137\/S0097539799355053"},{"key":"9","doi-asserted-by":"publisher","unstructured":"P. Niroula and Y. Nam, npj Quantum Information 7, 1 (2021).","DOI":"10.1038\/s41534-021-00369-3"}],"container-title":["Quantum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/quantum-journal.org\/papers\/q-2022-01-27-634\/pdf\/","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T13:55:30Z","timestamp":1643291730000},"score":1,"resource":{"primary":{"URL":"https:\/\/quantum-journal.org\/papers\/q-2022-01-27-634\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,27]]},"references-count":10,"URL":"https:\/\/doi.org\/10.22331\/q-2022-01-27-634","archive":["CLOCKSS"],"relation":{},"ISSN":["2521-327X"],"issn-type":[{"type":"electronic","value":"2521-327X"}],"subject":[],"published":{"date-parts":[[2022,1,27]]},"article-number":"634"}}