Arithmeticity, thinness and efficiency of qutrit Clifford+T gates

• URL: http://arxiv.org/abs/2401.16120v2
• Date: Tue, 12 Nov 2024 15:44:31 GMT
• Title: Arithmeticity, thinness and efficiency of qutrit Clifford+T gates
• Authors: Shai Evra, Ori Parzanchevski,
• Abstract summary: In this paper we study the analogue gate set for PU(3). We show that in PU(3) the group generated by the Clifford+T gates is not arithmetic - in fact, it is a thin matrix group, namely a Zariski-dense group of infinite index in its ambient S-arithmetic group. On the other hand, we study a recently proposed extension of the Clifford+T gates, called Clifford+D, and show that these do generate a full S-arithmetic subgroup of PU(3), and satisfy a slightly weaker almost-optimal covering property than that of Clifford+T in PU(2).
• Score: 0.0
• License:
• Abstract: The Clifford+T gate set is a topological generating set for PU(2), which has been well-studied from the perspective of quantum computation on a single qubit. The discovery that it generates a full S-arithmetic subgroup of PU(2) has led to a fruitful interaction between quantum computation and number theory, resulting in a proof that words in these gates cover PU(2) in an almost-optimal manner. In this paper we study the analogue gate set for PU(3). We show that in PU(3) the group generated by the Clifford+T gates is not arithmetic - in fact, it is a thin matrix group, namely a Zariski-dense group of infinite index in its ambient S-arithmetic group. On the other hand, we study a recently proposed extension of the Clifford+T gates, called Clifford+D, and show that these do generate a full S-arithmetic subgroup of PU(3), and satisfy a slightly weaker almost-optimal covering property than that of Clifford+T in PU(2). The proofs are different from those for PU(2): while both gate sets act naturally on a (Bruhat-Tits) tree, in PU(2) the generated group acts transitively on the vertices of the tree, and this is a main ingredient in proving both arithmeticity and efficiency. In the PU(3) Clifford+D case the action on the tree is far from being transitive. This makes the proof of arithmeticity considerably harder, and the study of efficiency by automorphic representation theory becomes more involved, and results in a covering rate which differs from the optimal one by a factor of $log_3(105)\approx 4.236$.

Related papers

• Permutation gates in the third level of the Clifford hierarchy [2.3010366779218483]
  We study permutations in the hierarchy: gates which permute the $2n$ basis states. We prove that any permutation gate in the third level, not necessarily semi-Clifford, must be a product of Toffoli gates.
  arXiv  Detail & Related papers  (2024-10-15T17:46:49Z)
• ATG: Benchmarking Automated Theorem Generation for Generative Language Models [83.93978859348313]
  Humans can develop new theorems to explore broader and more complex mathematical results. Current generative language models (LMs) have achieved significant improvement in automatically proving theorems. This paper proposes an Automated Theorem Generation benchmark that evaluates whether an agent can automatically generate valuable (and possibly brand new) theorems.
  arXiv  Detail & Related papers  (2024-05-05T02:06:37Z)
• Characterising semi-Clifford gates using algebraic sets [0.0]
  We study the sets of gates of the third-level of the Clifford hierarchy and their distinguished subsets of nearly diagonal' semi-Clifford gates. Semi-Clifford gates are important because they can be implemented with far more efficient use of these resource states.
  arXiv  Detail & Related papers  (2023-09-26T18:41:57Z)
• 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)
• 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)
• Proofs of network quantum nonlocality aided by machine learning [68.8204255655161]
  We show that the family of quantum triangle distributions of [DOI40103/PhysRevLett.123.140] did not admit triangle-local models in a larger range than the original proof. We produce a large collection of network Bell inequalities for the triangle scenario with binary outcomes, which are of independent interest.
  arXiv  Detail & Related papers  (2022-03-30T18:00:00Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Robustifying Algorithms of Learning Latent Trees with Vector Variables [92.18777020401484]
  We present the sample complexities of Recursive Grouping (RG) and Chow-Liu Recursive Grouping (CLRG) We robustify RG, CLRG, Neighbor Joining (NJ) and Spectral NJ (SNJ) by using the truncated inner product. We derive the first known instance-dependent impossibility result for structure learning of latent trees.
  arXiv  Detail & Related papers  (2021-06-02T01:37:52Z)
• Relevant OTOC operators: footprints of the classical dynamics [68.8204255655161]
  The OTOC-RE theorem relates the OTOCs summed over a complete base of operators to the second Renyi entropy. We show that the sum over a small set of relevant operators, is enough in order to obtain a very good approximation for the entropy. In turn, this provides with an alternative natural indicator of complexity, i.e. the scaling of the number of relevant operators with time.
  arXiv  Detail & Related papers  (2020-07-31T19:23:26Z)
• Un-Weyl-ing the Clifford Hierarchy [5.28387934064129]
  We study the structure of the second and third levels of the Clifford hierarchy. We show that every third level unitary commutes with at least one Pauli matrix. We discuss potential applications in quantum error correction and the design of flag gadgets.
  arXiv  Detail & Related papers  (2020-06-24T20:48:44Z)
• 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.