Generators and Relations for 2-Qubit Clifford+T Operators

• URL: http://arxiv.org/abs/2204.02217v3
• Date: Wed, 15 Nov 2023 11:01:41 GMT
• Title: Generators and Relations for 2-Qubit Clifford+T Operators
• Authors: Xiaoning Bian (Dalhousie University), Peter Selinger (Dalhousie University)
• Abstract summary: We give a presentation by generators and relations of the group of Clifford+T operators on two qubits. The proof relies on an application of the Reidemeister-Schreier theorem to an earlier result of Greylyn, and has been formally verified in the proof assistant Agda.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We give a presentation by generators and relations of the group of Clifford+T operators on two qubits. The proof relies on an application of the Reidemeister-Schreier theorem to an earlier result of Greylyn, and has been formally verified in the proof assistant Agda.

Related papers

• Goedel-Prover: A Frontier Model for Open-Source Automated Theorem Proving [72.8626512877667]
  We introduce Goedel-Prover, an open-source large language model (LLM) that achieves the state-of-the-art (SOTA) performance in automated formal proof generation for mathematical problems.
  arXiv  Detail & Related papers  (2025-02-11T15:27:35Z)
• Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis [50.020850767257095]
  We propose ProofAug, a novel theorem proving method that enjoys superior sample efficiency. Our method is validated on the miniF2F-test benchmark using the open-source deepseek-math-7b-base model and the Isabelle proof assistant.
  arXiv  Detail & Related papers  (2025-01-30T12:37:06Z)
• Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes [51.205673783866146]
  We propose and simulate a set of fault-tolerant and constant-depth logical gates on 2D toric codes. This set combines fold-transversal gates, Dehn twists and single-shot logical Pauli measurements and generates the full Clifford group.
  arXiv  Detail & Related papers  (2024-11-27T12:17:56Z)
• Clifford circuits over non-cyclic abelian groups [0.0]
  We show that every Clifford circuit can be efficiently classically simulated. We additionally provide circuits for a universal quantum computing scheme based on local two-qudit Clifford gates and magic states.
  arXiv  Detail & Related papers  (2024-02-21T18:26:25Z)
• The Clifford theory of the $n$-qubit Clifford group [0.0]
  Recent applications have made use of the representation theory of the Clifford group. We find an unexpected correspondence between irreducible characters of the $n$-qubit Clifford group and those of the $(n+1)$-qubit Clifford group.
  arXiv  Detail & Related papers  (2023-07-11T21:21:31Z)
• Generators and Relations for 3-Qubit Clifford+CS Operators [0.0]
  We give a presentation by generators and relations of the group of 3-qubit Clifford+CS operators. We show that the 3-qubit Clifford+CS group, which is of course infinite, is the amalgamated product of three finite subgroups.
  arXiv  Detail & Related papers  (2023-06-14T14:23:46Z)
• General ordering theorem [0.0]
  We prove the General Ordering Theorem (GOT), which establishes a relation among any pair of orderings. We show that it acts on operators satisfying generic (i.e. operatorial) commutation relations. Remarkably, it establishes a formal relation between these two theorems, and it provides compact expressions for them, unlike the notoriously complicated ones currently known.
  arXiv  Detail & Related papers  (2023-02-02T17:49:35Z)
• Duality theory for Clifford tensor powers [0.7826806223782052]
  The representation theory of the Clifford group is playing an increasingly prominent role in quantum information theory. In this paper, we provide a unified framework for the duality approach that also covers qubit systems.
  arXiv  Detail & Related papers  (2022-08-02T18:27:17Z)
• PRover: Proof Generation for Interpretable Reasoning over Rules [81.40404921232192]
  We propose a transformer-based model that answers binary questions over rule-bases and generates the corresponding proofs. Our model learns to predict nodes and edges corresponding to proof graphs in an efficient constrained training paradigm. We conduct experiments on synthetic, hand-authored, and human-paraphrased rule-bases to show promising results for QA and proof generation.
  arXiv  Detail & Related papers  (2020-10-06T15:47:53Z)
• Generative Language Modeling for Automated Theorem Proving [94.01137612934842]
  This work is motivated by the possibility that a major limitation of automated theorem provers compared to humans might be addressable via generation from language models. We present an automated prover and proof assistant, GPT-f, for the Metamath formalization language, and analyze its performance.
  arXiv  Detail & Related papers  (2020-09-07T19:50:10Z)
• Learning to Prove Theorems by Learning to Generate Theorems [71.46963489866596]
  We learn a neural generator that automatically synthesizes theorems and proofs for the purpose of training a theorem prover. Experiments on real-world tasks demonstrate that synthetic data from our approach improves the theorem prover.
  arXiv  Detail & Related papers  (2020-02-17T16:06:02Z)

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.