Enriched Categories for Parameterized Circuit Semantics

• URL: http://arxiv.org/abs/2501.12481v1
• Date: Tue, 21 Jan 2025 20:17:51 GMT
• Title: Enriched Categories for Parameterized Circuit Semantics
• Authors: Scott Wesley,
• Abstract summary: We show that the parameterized semantics studied in prior work can be understood through enrichment and internal constructions. We suggest how these semantics could be extended to classical circuit analysis and parameterized equivalence checking.
• Score: 0.0
• License:
• Abstract: It is well-known that combinatorial circuits are modeled mathematically by string diagrams in a monoidal category. Given a gate set $\Sigma$, the circuits over $\Sigma$ can be thought of as string diagrams in the free monoidal category generated by $\Sigma$. In this model, circuit semantics are then given by monoidal functors out of this free category. For quantum circuits, this functor is often valued in the category of unitary matrices. This model suffices for concrete quantum circuits, but fails to describe parameterized families of quantum circuits, such as those which arise in the analysis of ansatz circuits. Intuitively, this functor should be valued in parameterized families of unitary matices, though it is not immediately clear what this mean through a categorical lens. In this paper, we show that the parameterized semantics studied in prior work can be understood through enrichment and internal constructions. We determine sufficient conditions under which this construction yields a symmetric monoidal category, and suggest how these semantics could be extended to classical circuit analysis and parameterized equivalence checking.

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)
• Architectures and random properties of symplectic quantum circuits [0.0]
  Parametrized and random unitary $n$-qubit circuits play a central role in quantum information. We present a universal set of generators $mathcalG$ for the symplectic algebra $imathfraksp(d/2)$. We find that the operators in $mathcalG$ cannot generate arbitrary local symplectic unitaries. We then review the Schur-Weyl duality between the symplectic group and the Brauer algebra, and use tools from Weingarten calculus to prove that Pauli measurements can converge
  arXiv  Detail & Related papers  (2024-05-16T17:15:39Z)
• Low-overhead non-Clifford fault-tolerant circuits for all non-chiral abelian topological phases [0.7873629568804646]
  We propose a family of explicit geometrically local circuits on a 2-dimensional planar grid of qudits. These circuits are constructed from measuring 1-form symmetries in discrete fixed-point path integrals. We prove fault tolerance under arbitrary local (including non-Pauli) noise for a very general class of topological circuits.
  arXiv  Detail & Related papers  (2024-03-18T18:00:00Z)
• Enriching Diagrams with Algebraic Operations [49.1574468325115]
  We extend diagrammatic reasoning in monoidal categories with algebraic operations and equations. We show how this construction can be used for diagrammatic reasoning of noise in quantum systems.
  arXiv  Detail & Related papers  (2023-10-17T14:12:39Z)
• Tractable Bounding of Counterfactual Queries by Knowledge Compilation [51.47174989680976]
  We discuss the problem of bounding partially identifiable queries, such as counterfactuals, in Pearlian structural causal models. A recently proposed iterated EM scheme yields an inner approximation of those bounds by sampling the initialisation parameters. We show how a single symbolic knowledge compilation allows us to obtain the circuit structure with symbolic parameters to be replaced by their actual values.
  arXiv  Detail & Related papers  (2023-10-05T07:10:40Z)
• Quantum Current and Holographic Categorical Symmetry [62.07387569558919]
  A quantum current is defined as symmetric operators that can transport symmetry charges over an arbitrary long distance. The condition for quantum currents to be superconducting is also specified, which corresponds to condensation of anyons in one higher dimension.
  arXiv  Detail & Related papers  (2023-05-22T11:00:25Z)
• Deep Learning Symmetries and Their Lie Groups, Algebras, and Subalgebras from First Principles [55.41644538483948]
  We design a deep-learning algorithm for the discovery and identification of the continuous group of symmetries present in a labeled dataset. We use fully connected neural networks to model the transformations symmetry and the corresponding generators. Our study also opens the door for using a machine learning approach in the mathematical study of Lie groups and their properties.
  arXiv  Detail & Related papers  (2023-01-13T16:25:25Z)
• Building spatial symmetries into parameterized quantum circuits for faster training [0.0]
  We show that an ideal parameter structure naturally emerges when carefully considering spatial symmetries. Namely, we consider the automorphism group of the problem Hamiltonian, leading us to develop a circuit construction that is equivariant under this symmetry group. The benefits of our novel circuit structure, called ORB, are numerically probed in several ground-state problems.
  arXiv  Detail & Related papers  (2022-07-28T23:44:23Z)
• Adaptive constant-depth circuits for manipulating non-abelian anyons [65.62256987706128]
  Kitaev's quantum double model based on a finite group $G$. We describe quantum circuits for (a) preparation of the ground state, (b) creation of anyon pairs separated by an arbitrary distance, and (c) non-destructive topological charge measurement.
  arXiv  Detail & Related papers  (2022-05-04T08:10:36Z)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)

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.