scholarly journals Classical simulations of Abelian-group normalizer circuits with intermediate measurements

2014 ◽  
Vol 14 (3&4) ◽  
pp. 181-216
Author(s):  
Juan Bermejo-Vega ◽  
Maarten Van den Nest
Keyword(s):  
Fourier Transform ◽  
Abelian Group ◽  
Probability Distribution ◽  
Normal Form ◽  
Abelian Groups ◽  
Finite Abelian Group ◽  
Quadratic Functions ◽  
Quantum Circuits ◽  
Quantum Fourier Transform ◽  
Finite Abelian Groups

Quantum normalizer circuits were recently introduced as generalizations of Clifford circuits: a normalizer circuit over a finite Abelian group G is composed of the quantum Fourier transform (QFT) over G, together with gates which compute quadratic functions and automorphisms. In \cite{VDNest_12_QFTs} it was shown that every normalizer circuit can be simulated efficiently classically. This result provides a nontrivial example of a family of quantum circuits that cannot yield exponential speed-ups in spite of usage of the QFT, the latter being a central quantum algorithmic primitive. Here we extend the aforementioned result in several ways. Most importantly, we show that normalizer circuits supplemented with intermediate measurements can also be simulated efficiently classically, even when the computation proceeds adaptively. This yields a generalization of the Gottesman-Knill theorem (valid for n-qubit Clifford operations) to quantum circuits described by arbitrary finite Abelian groups. Moreover, our simulations are twofold: we present efficient classical algorithms to sample the measurement probability distribution of any adaptive-normalizer computation, as well as to compute the amplitudes of the state vector in every step of it. Finally we develop a generalization of the stabilizer formalism relative to arbitrary finite Abelian groups: for example we characterize how to update stabilizers under generalized Pauli measurements and provide a normal form of the amplitudes of generalized stabilizer states using quadratic functions and subgroup cosets.

EXTREMAL CAYLEY DIGRAPHS OF FINITE ABELIAN GROUPS

2011 ◽  
Vol 12 (01n02) ◽  
pp. 125-135 ◽  
Author(s):  
ABBY GAIL MASK ◽  
JONI SCHNEIDER ◽  
XINGDE JIA
Keyword(s):  
Abelian Group ◽  
Positive Integer ◽  
Communication Networks ◽  
Abelian Groups ◽  
Finite Abelian Group ◽  
Finite Abelian Groups ◽  
Element Subset ◽  
Cayley Digraph ◽  
Positive Integers ◽  
Element Set

Cayley digraphs of finite abelian groups are often used to model communication networks. Because of their applications, extremal Cayley digraphs have been studied extensively in recent years. Given any positive integers d and k. Let m*(d, k) denote the largest positive integer m such that there exists an m-element finite abelian group Γ and a k-element subset A of Γ such that diam ( Cay (Γ, A)) ≤ d, where diam ( Cay (Γ, A)) denotes the diameter of the Cayley digraph Cay (Γ, A) of Γ generated by A. Similarly, let m(d, k) denote the largest positive integer m such that there exists a k-element set A of integers with diam (ℤm, A)) ≤ d. In this paper, we prove, among other results, that [Formula: see text] for all d ≥ 1 and k ≥ 1. This means that the finite abelian group whose Cayley digraph is optimal with respect to its diameter and degree can be a cyclic group.

scholarly journals EXPLICIT cocycle formulas on finite abelian groups with applications to braided linear Gr-categories and Dijkgraaf–Witten invariants

2019 ◽  
Vol 150 (4) ◽  
pp. 1937-1964 ◽  
Author(s):  
Hua-Lin Huang ◽  
Zheyan Wan ◽  
Yu Ye
Keyword(s):  
Abelian Group ◽  
Abelian Groups ◽  
Finite Abelian Group ◽  
Finite Abelian Groups ◽  
Bar Resolution ◽  
Chain Map ◽  
A Chain

AbstractWe provide explicit and unified formulas for the cocycles of all degrees on the normalized bar resolutions of finite abelian groups. This is achieved by constructing a chain map from the normalized bar resolution to a Koszul-like resolution for any given finite abelian group. With a help of the obtained cocycle formulas, we determine all the braided linear Gr-categories and compute the Dijkgraaf–Witten Invariants of the n-torus for all n.

scholarly journals The Number of Subgroup Chains of Finite Nilpotent Groups

Symmetry ◽  
2020 ◽  
Vol 12 (9) ◽  
pp. 1537 ◽  
Author(s):  
Lingling Han ◽  
Xiuyun Guo
Keyword(s):  
Abelian Group ◽  
Abelian Groups ◽  
Finite Abelian Group ◽  
Recursive Formula ◽  
Nilpotent Groups ◽  
Classification Problem ◽  
Finite Abelian Groups ◽  
Counting Problem ◽  
Cyclic Groups ◽  
Fuzzy Subgroups

In this paper, we mainly count the number of subgroup chains of a finite nilpotent group. We derive a recursive formula that reduces the counting problem to that of finite p-groups. As applications of our main result, the classification problem of distinct fuzzy subgroups of finite abelian groups is reduced to that of finite abelian p-groups. In particular, an explicit recursive formula for the number of distinct fuzzy subgroups of a finite abelian group whose Sylow subgroups are cyclic groups or elementary abelian groups is given.

ON A PARTITION PROBLEM OF FINITE ABELIAN GROUPS

2015 ◽  
Vol 92 (1) ◽  
pp. 24-31
Author(s):  
ZHENHUA QU
Keyword(s):  
Abelian Group ◽  
Abelian Groups ◽  
Finite Abelian Group ◽  
Partition Problem ◽  
Finite Abelian Groups ◽  
Disjoint Sets ◽  
Ordered Pairs

Let$G$be a finite abelian group and$A\subseteq G$. For$n\in G$, denote by$r_{A}(n)$the number of ordered pairs$(a_{1},a_{2})\in A^{2}$such that$a_{1}+a_{2}=n$. Among other things, we prove that for any odd number$t\geq 3$, it is not possible to partition$G$into$t$disjoint sets$A_{1},A_{2},\dots ,A_{t}$with$r_{A_{1}}=r_{A_{2}}=\cdots =r_{A_{t}}$.

scholarly journals Dynamics of Endomorphism of Finite Abelian Groups

2017 ◽  
Vol 2017 ◽  
pp. 1-7
Author(s):  
Zhao Jinxing ◽  
Nan Jizhu
Keyword(s):  
Fixed Point ◽  
Abelian Group ◽  
Dynamical Systems ◽  
Automorphism Group ◽  
Abelian Groups ◽  
Finite Abelian Group ◽  
Point System ◽  
Finite Abelian Groups

We study the dynamics of endomorphisms on a finite abelian group. We obtain the automorphism group for these dynamical systems. We also give criteria and algorithms to determine whether it is a fixed point system.

scholarly journals Unextendible Sequences in Finite Abelian Groups

10.37236/899 ◽  
2008 ◽  
Vol 15 (1) ◽  
Author(s):  
Jujuan Zhuang
Keyword(s):  
Abelian Group ◽  
Abelian Groups ◽  
Finite Abelian Group ◽  
Minimal Length ◽  
Finite Abelian Groups ◽  
Zero Sum

Let $G=C_{n_1}\oplus \ldots \oplus C_{n_r}$ be a finite abelian group with $r=1$ or $1 < n_1|\ldots|n_r$, and let $S=(a_1,\ldots,a_t)$ be a sequence of elements in $G$. We say $S$ is an unextendible sequence if $S$ is a zero-sum free sequence and for any element $g\in G$, the sequence $Sg$ is not zero-sum free any longer. Let $L(G)=\lceil \log_2{n_1}\rceil+\ldots+\lceil \log_2{n_r}\rceil$ and $d^*(G)=\sum_{i=1}^r(n_i-1)$, in this paper we prove, among other results, that the minimal length of an unextendible sequence in $G$ is not bigger than $L(G)$, and for any integer $k$, where $L(G)\leq k \leq d^*(G)$, there exists at least one unextendible sequence of length $k$.

scholarly journals Invariant subrings which are complete intersections, I: (Invariant subrings of finite Abelian groups)

1980 ◽  
Vol 77 ◽  
pp. 89-98 ◽  
Author(s):  
Keiichi Watanabe
Keyword(s):  
Abelian Group ◽  
Complete Intersection ◽  
Polynomial Ring ◽  
Abelian Groups ◽  
Finite Abelian Group ◽  
Finite Subgroup ◽  
Complete Intersections ◽  
Complex Numbers ◽  
Finite Abelian Groups

Let G be a finite subgroup of GL(n, C) (C is the field of complex numbers). Then G acts naturally on the polynomial ring S = C[X1, …, Xn]. We consider the followingProblem. When is the invariant subring SG a complete intersection?In this paper, we treat the case where G is a finite Abelian group. We can solve the problem completely. The result is stated in Theorem 2.1.

scholarly journals ON THE MAXIMUM SIZE OF A (k,l)-SUM-FREE SUBSET OF AN ABELIAN GROUP

2009 ◽  
Vol 05 (06) ◽  
pp. 953-971 ◽  
Author(s):  
BÉLA BAJNOK
Keyword(s):  
Abelian Group ◽  
Cyclic Group ◽  
Abelian Groups ◽  
Finite Abelian Group ◽  
Maximum Size ◽  
Finite Abelian Groups ◽  
Free Subset ◽  
Free Set ◽  
Free Sets

A subset A of a given finite abelian group G is called (k,l)-sum-free if the sum of k (not necessarily distinct) elements of A does not equal the sum of l (not necessarily distinct) elements of A. We are interested in finding the maximum size λk,l(G) of a (k,l)-sum-free subset in G. A (2,1)-sum-free set is simply called a sum-free set. The maximum size of a sum-free set in the cyclic group ℤn was found almost 40 years ago by Diamanda and Yap; the general case for arbitrary finite abelian groups was recently settled by Green and Ruzsa. Here we find the value of λ3,1(ℤn). More generally, a recent paper by Hamidoune and Plagne examines (k,l)-sum-free sets in G when k - l and the order of G are relatively prime; we extend their results to see what happens without this assumption.

CHARACTERIZATIONS OF SOME WREATH PRODUCTS OF GROUPS BY THEIR ENDOMORPHISM SEMIGROUPS

2008 ◽  
Vol 18 (02) ◽  
pp. 243-255 ◽  
Author(s):  
PEETER PUUSEMP
Keyword(s):  
Abelian Group ◽  
Wreath Product ◽  
Cyclic Group ◽  
Abelian Groups ◽  
Finite Abelian Group ◽  
Wreath Products ◽  
Endomorphism Semigroup ◽  
Finite Abelian Groups ◽  
Products Of Groups

Let A be a cyclic group of order pn, where p is a prime, and B be a finite abelian group or a finite p-group which is determined by its endomorphism semigroup in the class of all groups. It is proved that under these assumptions the wreath product A Wr B is determined by its endomorphism semigroup in the class of all groups. It is deduced from this result that if A, B, A0,…, An are finite abelian groups and A0,…, An are p-groups, p prime, then the wreath products A Wr B and An Wr (…( Wr (A1 Wr A0))…) are determined by their endomorphism semigroups in the class of all groups.

NONQUASI-PERIODIC FACTORIZATIONS FOR CERTAIN FINITE ABELIAN GROUPS

2007 ◽  
Vol 17 (04) ◽  
pp. 837-849
Author(s):  
ARTHUR D. SANDS ◽  
SÁNDOR SZABÓ
Keyword(s):  
Abelian Group ◽  
Abelian Groups ◽  
Finite Abelian Group ◽  
Finite Abelian Groups ◽  
Small Family ◽  
Counter Example

Hajós [2] asked if each factorization of a finite abelian group is quasi-periodic. Sands [5] exhibited a counter-example. We will show that a sizeable family of finite abelian groups admits nonquasi-periodic factorizations. We also describe a small family whose members have only quasi-periodic factorizations.

Sign in / Sign up

Export Citation Format

Share Document