Expressiveness of Commutative Quantum Circuits: A Probabilistic Approach
arXiv:2404.19727 · doi:10.1109/TQE.2024.3488518
Abstract
This study investigates the frame potential and expressiveness of commutative quantum circuits. Based on the Fourier series representation of these 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. A central outcome of our work includes formulas to approximate the frame potential and expressiveness for any commutative quantum circuit, underpinned by convergence theorems in probability theory. We identify the lattice volume of the random walk as means to approximate expressiveness based on circuit architecture. In the specific case of commutative circuits involving Pauli- rotations, we provide theoretical results relating expressiveness and circuit structure. Our probabilistic representation also provide means for bounding and approximately calculating the frame potential of a circuit through sampling methods.
References in corpus (18)
- Quantum Computing in the NISQ era and beyond
- Variational Quantum Algorithms
- Supervised learning with quantum enhanced feature spaces
- An adaptive variational algorithm for exact molecular simulations on a quantum computer
- Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
- The effect of data encoding on the expressive power of variational quantum machine learning models
- Connecting ansatz expressibility to gradient magnitudes and barren plateaus
- The Expressive Power of Parameterized Quantum Circuits
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
- Average-case complexity versus approximate simulation of commuting quantum computations
- Quantum agents in the Gym: a variational quantum algorithm for deep Q-learning
- Instantaneous Quantum Computation
- Theory of overparametrization in quantum neural networks
- Quantum Algorithm Implementations for Beginners
- The Variational Power of Quantum Circuit Tensor Networks
- On the Universality of the Quantum Approximate Optimization Algorithm
- A Variational Quantum Algorithm for Preparing Quantum Gibbs States
- Multidimensional Fourier series with quantum circuits