Probabilistic Representation of Commutative Quantum Circuit Models

• URL: http://arxiv.org/abs/2410.19173v1
• Date: Thu, 24 Oct 2024 22:02:44 GMT
• Title: Probabilistic Representation of Commutative Quantum Circuit Models
• Authors: Richard Yu, Jorge Ramirez, Elaine Wong,
• Abstract summary: In commuting quantum circuits, the Fourier series of the pairwise fidelity can be expressed as the characteristic function of random variables. We generalize this construction to any commuting set of Pauli operators.
• Score: 1.2733144214254712
• License:
• 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 has been successfully applied to the group composed only of Pauli-Z rotations, and we generalize this probabilistic strategy to any commuting set of Pauli operators. We utilize an efficient algorithm by van den Berg and Temme (2020) using 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.

Related papers

• A Fourier analysis framework for approximate classical simulations of quantum circuits [0.0]
  I present a framework that applies harmonic analysis of groups to circuits with a structure encoded by group parameters. I also discuss generalisations to homogeneous spaces, qudit systems and a way to analyse random circuits via matrix coefficients of irreducible representations.
  arXiv  Detail & Related papers  (2024-10-17T17:59:34Z)
• Expressiveness of Commutative Quantum Circuits: A Probabilistic Approach [1.0864391406042209]
  This study investigates the frame potential and expressiveness of commutative quantum circuits. We express quantum expectation and pairwise fidelity as characteristic functions of random variables, and expressiveness as the recurrence probability of a random walk on a lattice.
  arXiv  Detail & Related papers  (2024-04-30T17:22:33Z)
• Sampled Transformer for Point Sets [80.66097006145999]
  sparse transformer can reduce the computational complexity of the self-attention layers to $O(n)$, whilst still being a universal approximator of continuous sequence-to-sequence functions. We propose an $O(n)$ complexity sampled transformer that can process point set elements directly without any additional inductive bias.
  arXiv  Detail & Related papers  (2023-02-28T06:38:05Z)
• Field theory approach to eigenstate thermalization in random quantum circuits [0.0]
  We use field-theoretic methods to explore the statistics of eigenfunctions of the Floquet operator for a large family of quantum circuits. The correlation function of the quasienergy eigenstates is calculated and shown to exhibit random matrix circular unitary ensemble statistics.
  arXiv  Detail & Related papers  (2022-10-12T18:00:00Z)
• Efficient simulation of Gottesman-Kitaev-Preskill states with Gaussian circuits [68.8204255655161]
  We study the classical simulatability of Gottesman-Kitaev-Preskill (GKP) states in combination with arbitrary displacements, a large set of symplectic operations and homodyne measurements. For these types of circuits, neither continuous-variable theorems based on the non-negativity of quasi-probability distributions nor discrete-variable theorems can be employed to assess the simulatability.
  arXiv  Detail & Related papers  (2022-03-21T17:57:02Z)
• Classical shadows with Pauli-invariant unitary ensembles [0.0]
  We consider the class of Pauli-invariant unitary ensembles that are invariant under multiplication by a Pauli operator. Our results pave the way for more efficient or robust protocols for predicting important properties of quantum states.
  arXiv  Detail & Related papers  (2022-02-07T15:06:30Z)
• Learnability of the output distributions of local quantum circuits [53.17490581210575]
  We investigate, within two different oracle models, the learnability of quantum circuit Born machines. We first show a negative result, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable. We show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable.
  arXiv  Detail & Related papers  (2021-10-11T18:00:20Z)
• Bernstein-Greene-Kruskal approach for the quantum Vlasov equation [91.3755431537592]
  The one-dimensional stationary quantum Vlasov equation is analyzed using the energy as one of the dynamical variables. In the semiclassical case where quantum tunneling effects are small, an infinite series solution is developed.
  arXiv  Detail & Related papers  (2021-02-18T20:55:04Z)
• Hilbert-space geometry of random-matrix eigenstates [55.41644538483948]
  We discuss the Hilbert-space geometry of eigenstates of parameter-dependent random-matrix ensembles. Our results give the exact joint distribution function of the Fubini-Study metric and the Berry curvature. We compare our results to numerical simulations of random-matrix ensembles as well as electrons in a random magnetic field.
  arXiv  Detail & Related papers  (2020-11-06T19:00:07Z)
• Coherent randomized benchmarking [68.8204255655161]
  We show that superpositions of different random sequences rather than independent samples are used. We show that this leads to a uniform and simple protocol with significant advantages with respect to gates that can be benchmarked.
  arXiv  Detail & Related papers  (2020-10-26T18:00:34Z)
• Circuit optimization of Hamiltonian simulation by simultaneous diagonalization of Pauli clusters [1.0587959762260986]
  Quantum circuits for exact time evolution of single Pauli operators are well known, and can be extended trivially to sums of commuting Paulis. In this paper we reduce the circuit complexity of Hamiltonian simulation by partitioning the Pauli operators into mutually commuting clusters. We show that the proposed approach can help to significantly reduce both the number of CNOT operations and circuit depth for Hamiltonians arising in quantum chemistry.
  arXiv  Detail & Related papers  (2020-03-30T16:29:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.