Skip to main navigation Skip to search Skip to main content

Probabilistic Representation of Commutative Quantum Circuit Models

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In commuting parametric quantum circuits, the Fourier series of the pairwise fidelity can be expressed as the characteristic function of random variables. Furthermore, expressiveness can be cast as the recurrence probability of a random walk on a lattice. This construction had previously been applied to the group composed only of Pauli-Z rotations. In this paper, we generalize this probabilistic strategy to any commuting set of Pauli operators. To this end, we can leverage an algorithm that uses the tableau representation of Pauli strings to yield a unitary from the Clifford group that, under conjugation, simultaneously diagonalizes our commuting set of Pauli rotations. Furthermore, we fully characterize the underlying distribution of the random walk using stabilizer states and their basis state representations. This would allow us to tractably compute the lattice volume and variance matrix used to express the frame potential. Together, this demonstrates a scalable strategy to calculate the expressiveness of parametric quantum models.

Original languageEnglish
Title of host publicationKeynotes, Workshops, Posters, Panels, and Tutorials Program
EditorsCandace Culhane, Greg Byrd, Hausi Muller, Andrea Delgado, Stephan Eidenbenz
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages350-355
Number of pages6
ISBN (Electronic)9798331557362
DOIs
StatePublished - 2025
Event6th IEEE International Conference on Quantum Computing and Engineering, QCE 2025 - Albuquerque, United States
Duration: Aug 31 2025Sep 5 2025

Publication series

NameProceedings - IEEE Quantum Week 2025, QCE 2025
Volume2

Conference

Conference6th IEEE International Conference on Quantum Computing and Engineering, QCE 2025
Country/TerritoryUnited States
CityAlbuquerque
Period08/31/2509/5/25

Funding

This work was completed under the aegis of the DOE Science Undergraduate Laboratory Internship (SULI) program and the Graduate Research at ORNL (GRO) program. Support for this work partially came from the U.S. Department of Energy s Advanced Scientific Computing Research (ASCR) Accelerated Research in Quantum Computing (ARQC) Program under the FAR-QC and AIDE-QC (field work proposal ERKJ332). We would also like to thank Ryan Bennink for providing us resources on how phase sensitive Clifford circuit simulation can be leveraged to find the Fourier coefficients of PQCs in the noncommutative scenario.

Keywords

  • commutative circuit
  • probabilistic representation
  • quantum circuit model
  • quantum computing
  • quantum machine learning

Fingerprint

Dive into the research topics of 'Probabilistic Representation of Commutative Quantum Circuit Models'. Together they form a unique fingerprint.

Cite this