Take the 2-minute tour ×
Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers in related fields. It's 100% free, no registration required.

Given a finite set of quantum gates $\mathcal{G} = \{G_1, \dots, G_n\}$, is it decidable (in computation theoretic sense) whether $\mathcal{G}$ is a universal gate set? On one hand, "almost all" gate sets are universal, on the other, non-universal gate sets are still not well understood (in particular, of course, it is not known whether every non-universal gate set is classically simulatable), so I imagine giving an explicit algorithm for checking universality could be nontrivial.

share|improve this question
3  
Can you clarify the question? Joe's answer assumes you have a fixed number of qubits and all gates act on those, but for universality, we often assume gates can act on any subset of qubits. E.g., CNOT + all one-qubit gates are not universal if the one-qubit gates can only act on the first qubit, and CNOT is only from qubit 1 to qubit 2. In the latter case, we might want to extrapolate to many qubits to get universality. In that case, I think the anwer may be unknown. –  Daniel Gottesman Jan 23 '12 at 15:30
    
@DanielGottesman: I agree about the limitations of my answer. Indeed, I believe it is undecidable in the latter case as follows: Take a cellular automata on an infinite lattice of qubits and use it to encode the halting problem (call this update unitary $U_1$). Then take a second lattice with a universal QCA (with update unitary $U_2$). We can define a new unitary $CU_2 = |0\rangle\langle0|_H\otimes I + |1\rangle\langle1|\otimes U_2$, where the subscript $H$ denotes a qubit which is set to $|1\rangle$ iff the first cellular automata halts. –  Joe Fitzsimons Jan 31 '12 at 6:19
    
Thus the gate $CU_2 \times U_1$ is universal if and only if the first Turing machine halts, and is hence undecidable. –  Joe Fitzsimons Jan 31 '12 at 6:22
add comment

1 Answer

For the case of Hamiltonians, rather than gates the answer is trivially yes: you simply enumerate the independent elements of the Lie algebra. Since the Lie algebra is a vector space with the addition of the Lie bracket operator. Since the space is finite, it has a finite basis, and which can easily be checked as to whether it is closed or open under the Lie bracket operation. Simply checking the Lie bracket of all pairs of orthogonal operators can be done in time polynomial in the dimensionality of the space, and a suitable operator basis can be found by the Gram-Schmidt method.

For gates, you don't really have the same option to resort to infinitesimals straight off, and need to construct gates with irrational eigenvalues so that you can arbitrarily well approximate the required infinitesimal generators. I guess that there is a relatively simple way to do this, but it is not immediately obvious to me.

In any case, taking the log of the gates to obtain a set of operators which generate them when exponentiated and checking whether these generated the full Lie algebra would provide a simple necessary but not sufficient criteria for universality.

share|improve this answer
    
Why we should check only pairs? –  Alex 'qubeat' Jan 20 '12 at 20:40
    
@AlexV: Because the Lie bracket takes operates on 2 inputs. Every time you produce a new linearly independent operator you produce an orthogonal one and repeat until you get closure. –  Joe Fitzsimons Jan 21 '12 at 2:41
    
I meant you should consider $[\ldots[H_k,H_j],H_l],\ldots]$, but not only pairs, e.g. see my own paper arxiv.org/abs/quant-ph/0010071 –  Alex 'qubeat' Jan 21 '12 at 12:35
    
@AlexV: You don't need to. It's a vector space, so a vector is orthogonal to a given subspace if and only if it is orthogonal to any basis for that subspace. –  Joe Fitzsimons Jan 21 '12 at 14:25
    
Likely we are talking about different things - which vector space you are talking about? You do not know from very beginning the subalgebra generated by your gates - you need to construct that from given Hamiltonians to check if it whole Lie algebra. –  Alex 'qubeat' Jan 21 '12 at 15:54
show 7 more comments

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.