Condensed Encodings of Projective Clifford Operations in Arbitrary Dimension

• URL: http://arxiv.org/abs/2407.16861v1
• Date: Tue, 23 Jul 2024 22:04:10 GMT
• Title: Condensed Encodings of Projective Clifford Operations in Arbitrary Dimension
• Authors: Sam Winnick, Jennifer Paykin,
• Abstract summary: We provide a careful analysis of the structure theorem for the $n$-qudit projective Clifford group and various encoding schemes for its elements. Our results apply to all integers $dgeq2$, most notably the even case.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We provide a careful analysis of the structure theorem for the $n$-qudit projective Clifford group and various encoding schemes for its elements. In particular, we derive formulas for evaluation, composition, and inversion. Our results apply to all integers $d\geq2$, most notably the even case.

Related papers

• A complete theory of the Clifford commutant [0.2796197251957244]
  The Clifford group plays a central role in quantum information science. It is the building block for many error-correcting schemes and matches the first three moments of the Haar measure over the unitary group. At the heart of understanding many properties of the Clifford group lies the Clifford commutant.
  arXiv  Detail & Related papers  (2025-04-16T17:21:34Z)
• Targeted Clifford logical gates for hypergraph product codes [61.269295538188636]
  We construct explicit targeted logical gates for hypergraph product codes. As a concrete example, we give logical circuits for the $[[18,2,3]]$ toric code.
  arXiv  Detail & Related papers  (2024-11-26T02:32:44Z)
• Alchemy: Amplifying Theorem-Proving Capability through Symbolic Mutation [71.32761934724867]
  This work proposes Alchemy, a framework for data synthesis that constructs formal theorems through symbolic mutation. For each candidate theorem in Mathlib, we identify all invocable theorems that can be used to rewrite or apply to it. As a result, our method increases the number of theorems in Mathlib by an order of magnitude, from 110k to 6M.
  arXiv  Detail & Related papers  (2024-10-21T08:04:21Z)
• Qudit Quantum Programming with Projective Cliffords [0.0]
  This paper introduces a novel abstraction for programming quantum operations, specifically projective Cliffords, as functions over the qudit Pauli group. We define a categorical semantics for projective Cliffords based on Pauli encodings in terms of $mathbbZ_d$-linear maps. We then introduce a type system and calculus for both $mathbbZ_d$-linear maps and projective Cliffords, and prove that these type systems have a sound denotational semantics in terms of relevant categories.
  arXiv  Detail & Related papers  (2024-07-23T19:02:55Z)
• The operadic theory of convexity [0.0]
  We characterize convexity in terms of algebras over a PROP, and establish a tensor-product-like symmetric monoidal structure on the category of convex sets. We apply this construction to the categorical characterization of entropy of Baez, Fritz, and Leinster, and to the study of quantum contextuality in the framework of simplicial distributions.
  arXiv  Detail & Related papers  (2024-03-26T21:01:39Z)
• Clifford Group Equivariant Neural Networks [14.260561321140976]
  We introduce Clifford Group Equivariant Neural Networks, a novel approach for constructing $mathrmO(n)$- and $mathrmE(n)$-equivariant models. We demonstrate, notably from a single core implementation, state-of-the-art performance on several distinct tasks.
  arXiv  Detail & Related papers  (2023-05-18T17:35:35Z)
• A graph-state based synthesis framework for Clifford isometries [0.0]
  We tackle the problem of synthesizing a Clifford isometry into an executable quantum circuit. We propose a simple framework for synthesis that exploits the elementary properties of the Clifford group and one equation of the symplectic group. We report an improvement of the two-qubit depth necessary for the execution of a Clifford circuit on an LNN architecture.
  arXiv  Detail & Related papers  (2022-12-13T22:50:24Z)
• Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
  We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes. Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
  arXiv  Detail & Related papers  (2021-08-10T15:00:20Z)
• An Algebraic Framework for Multi-Qudit Computations with Generalized Clifford Algebras [0.0]
  We develop a framework of axioms which abstracts various high-level properties of multi-qudit representations of generalized Clifford algebras. This framework opens the way for developing a graphical calculus for multi-qudit representations of generalized Clifford algebras.
  arXiv  Detail & Related papers  (2021-03-29T04:32:59Z)
• A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz [68.8204255655161]
  We describe a compilation strategy for Variational Quantum Eigensolver (VQE) algorithms. We use the Unitary Coupled Cluster (UCC) ansatz to reduce circuit depth and gate count.
  arXiv  Detail & Related papers  (2020-07-20T22:26:16Z)
• A General Framework for Consistent Structured Prediction with Implicit Loss Embeddings [113.15416137912399]
  We propose and analyze a novel theoretical and algorithmic framework for structured prediction. We study a large class of loss functions that implicitly defines a suitable geometry on the problem. When dealing with output spaces with infinite cardinality, a suitable implicit formulation of the estimator is shown to be crucial.
  arXiv  Detail & Related papers  (2020-02-13T10:30:04Z)
• A refinement of Reznick's Positivstellensatz with applications to quantum information theory [72.8349503901712]
  In Hilbert's 17th problem Artin showed that any positive definite in several variables can be written as the quotient of two sums of squares. Reznick showed that the denominator in Artin's result can always be chosen as an $N$-th power of the squared norm of the variables.
  arXiv  Detail & Related papers  (2019-09-04T11:46:26Z)

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.