Papers
Topics
Authors
Recent
Search
2000 character limit reached

Noise-Aware Circuit Compilations for a Continuously Parameterized Two-Qubit Gateset

Published 2 Nov 2024 in quant-ph | (2411.01094v1)

Abstract: State-of-the-art noisy-intermediate-scale quantum (NISQ) processors are currently implemented across a variety of hardware platforms, each with their own distinct gatesets. As such, circuit compilation should not only be aware of, but also deeply connect to, the native gateset and noise properties of each. Trapped-ion processors are one such platform that provides a gateset that can be continuously parameterized across both one- and two-qubit gates. Here we use the Quantum Scientific Computing Open User Testbed (QSCOUT) to study noise-aware compilations focused on continuously parameterized two-qubit $\mathcal{ZZ}$ gates (based on the M{\o}lmer-S{\o}rensen interaction) using $\textbf{Superstaq}$, a quantum software platform for hardware-aware circuit compiler optimizations. We discuss the realization of $\mathcal{ZZ}$ gates with arbitrary angle on the all-to-all connected trapped-ion system. Then we discuss a variety of different compiler optimizations that innately target these $\mathcal{ZZ}$ gates and their noise properties. These optimizations include moving from a restricted maximally entangling gateset to a continuously parameterized one, swap mirroring to further reduce total entangling angle of the operations, focusing the heaviest $\mathcal{ZZ}$ angle participation on the best performing gate pairs, and circuit approximation to remove the least impactful $\mathcal{ZZ}$ gates. We demonstrate these compilation approaches on the hardware with randomized quantum volume circuits, observing the potential to realize a larger quantum volume as a result of these optimizations. Using differing yet complementary analysis techniques, we observe the distinct improvements in system performance provided by these noise-aware compilations and study the role of stochastic and coherent error channels for each compilation choice.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (11)
  1. C. Monroe and J. Kim, Scaling the ion trap quantum processor, Science 339, 1164 (2013).
  2. D. Kielpinski, C. Monroe, and D. J. Wineland, Architecture for a large-scale ion-trap quantum computer, Nature 417, 709 (2002).
  3. T. G. Draper, Addition on a quantum computer (2000), arXiv:quant-ph/0008033v1 [quant-ph] .
  4. Infleqtion, Superstaq documentation (2024), https://superstaq.readthedocs.io.
  5. A. Sørensen and K. Mølmer, Entanglement and quantum computation with ions in thermal motion, Phys. Rev. A 62, 022311 (2000).
  6. R. R. Tucci, An introduction to Cartan’s KAK decomposition for QC programmers (2005), arXiv:quant-ph/0507171 [quant-ph] .
  7. E. Pelofske, A. Bärtschi, and S. Eidenbenz, Quantum volume in practice: What users can expect from nisq devices, IEEE Transactions on Quantum Engineering 3, 3102119 (2022).
  8. S. Aaronson and L. Chen, Complexity-theoretic foundations of quantum supremacy experiments (2016), arXiv:1612.05903 [quant-ph] .
  9. J. Emerson, R. Alicki, and K. Życzkowski, Scalable noise estimation with random unitary operators, Journal of Optics B: Quantum and Semiclassical Optics 7, S347 (2005).
  10. E. Magesan, J. M. Gambetta, and J. Emerson, Scalable and robust randomized benchmarking of quantum processes, Physical Review Letters 106, 180504 (2011).
  11. M. N. H. Chow, Scalable Methods for Performant Control of Hyperfine Qubits in Atoms and Ions, Ph.D. thesis, University of New Mexico (2024).
Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.