Lower bound on the dimensions or irreducible representations of symmetric groups and on the exponents of varieties of Lie algebras

Mishchenko, S. P.

doi:10.1070/sm1996v187n01abeh000101

Cited by 23 publications

(24 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Later, a similar result was derived for arbitrary finite-dimensional algebras [15]. Furthermore, for Lie algebras, it was shown that either {c n (A)} 2 n asymptotically, or {c n (A)} is polynomially bounded [16]. Integrality of a PI-exponent was also proved for an important class of soluble varieties with almost polynomial growth [17], and for all subvarieties of the unique known variety of almost overexponential growth [18].…”

Section: Introductionmentioning

confidence: 95%

See 1 more Smart Citation

Identities for Lie superalgebras with a nilpotent commutator subalgebra

Зайцев

Mishchenko²

2008

Algebra Logic

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 95%

“…This is an ordinary Lie algebra for which it is also true that exp(L 0 ) < 2. According to [16], L 0 is a Lie algebra with polynomial growth of codimensions, and by [30], it is decidable. Since L is finite-dimensional, the fact that L 0 is decidable implies being decidable for L (see [29]).…”

Section: Theoremmentioning

confidence: 99%

Identities for Lie superalgebras with a nilpotent commutator subalgebra

Зайцев

Mishchenko²

2008

Algebra Logic

View full text Add to dashboard Cite

“…Long before the problem of Amitsur was solved positively, it had been observed that codimensions of associative and Lie algebras do not admit intermediate growth [18,19]. Codimension sequences in these cases either are polynomially bounded (i.e., grow polynomially) or grow not slower than 2 n .…”

Section: Introductionmentioning

confidence: 96%

Identities of unitary finite-dimensional algebras

Зайцев

2011

Algebra Logic

View full text Add to dashboard Cite

“…✷ Another lower bound on the longest row or column of a low dimension representation (for a different range of parameters) was given by Mischenko [8].…”

Section: If ρ Is An Irreducible Representation With Both the First Romentioning

confidence: 99%

Computing with highly mixed states

Ambainis

Schulman

Vazirani

2006

J. ACM

View full text Add to dashboard Cite

We consider quantum computing in the one-qubit model where the starting state of a quantum computer consists of k qubits in a pure state and n − k qubits in a maximally mixed state. We ask the following question: is there a general method for simulating an arbitrary m-qubit pure state quantum computation by a quantum computation in the kqubit model? We show that, under certain constraints, this is impossible, unless m = O(k + log n). INTRODUCTIONIdeally, a quantum computation is a sequence of local unitary transformations applied to a register of qubits which are initially in the state |0 n ; followed by a measurement. Initializing the state of the quantum register is the biggest challenge in NMR quantum computing (which is perhaps the most advanced technology in terms of the scale of experiments performed to date [2]). The difficulty is that the register is actually initially in (approximately) the binomial distribution over pure states |x , in which each qubit is independently in the state |0 with probability ; the currently achievable polarization ǫ is quite small. There are currently two ways of implementing quantum computation in this technology. The first is used in current experiments [5; 3], but does not scale beyond several qubits -the output signal decreases exponentially in the number of qubits in the quantum register. The exponential decay in signal to noise ratio in any scheme that embeds virtual pure states on an n-qubit quantum computer with one clean qubit is unavoidable, due to the result [9].liquid NMR [11]. An intriguing third possibility was raised in [7]. Suppose we start with one qubit in the pure state |0 in tensor product with n − 1 qubits in a maximally mixed state (i.e. in a uniform distribution over basis states |x ). Is it possible to simulate general quantum computation by effecting a sequence of elementary quantum operations on this register? If the answer were affirmative, this would yield a procedure that would both scale and be currently feasible using the scalable initialization procedure to convert the initial binomial state to a state where the last n − 1 qubits are maximally mixed and the first bit has high polarization (the strength of the output signal is now proportional to this polarization). This is the question we focus on in this paper. It is easy to see that if all n qubits are in the maximally mixed state then no computation is possible. This is because applying any unitary transformation to this mixture leaves it invariant. This simple argument stands in striking contrast to the difficulty of the seemingly very similar case, in which just a single qubit is in a pure state, while all the others are maximally mixed. Since the initial state of the register is completely specified, the only real input in this model is the sequence of elementary quantum operations. So, given a quantum circuit C which we would like to simulate on an input x, we wish to know whether there is a sequence of elementary quantum operations on the n qubit register, which first prepares a...

show abstract

Lower bound on the dimensions or irreducible representations of symmetric groups and on the exponents of varieties of Lie algebras

Cited by 23 publications

References 3 publications

Identities for Lie superalgebras with a nilpotent commutator subalgebra

Identities for Lie superalgebras with a nilpotent commutator subalgebra

Identities of unitary finite-dimensional algebras

Computing with highly mixed states

Contact Info

Product

Resources

About