• Register
PhysicsOverflow is a next-generation academic platform for physicists and astronomers, including a community peer review system and a postgraduate-level discussion forum analogous to MathOverflow.

Welcome to PhysicsOverflow! PhysicsOverflow is an open platform for community peer review and graduate-level Physics discussion.

Please help promote PhysicsOverflow ads elsewhere if you like it.


New features!

Please do help out in categorising submissions. Submit a paper to PhysicsOverflow!

... see more

Tools for paper authors

Submit paper
Claim Paper Authorship

Tools for SE users

Search User
Reclaim SE Account
Request Account Merger
Nativise imported posts
Claim post (deleted users)
Import SE post

Users whose questions have been imported from Physics Stack Exchange, Theoretical Physics Stack Exchange, or any other Stack Exchange site are kindly requested to reclaim their account and not to register as a new user.

Public \(\beta\) tools

Report a bug with a feature
Request a new functionality
404 page design
Send feedback


(propose a free ad)

Site Statistics

123 submissions , 104 unreviewed
3,600 questions , 1,219 unanswered
4,601 answers , 19,547 comments
1,470 users with positive rep
423 active unimported users
More ...

Decidability/algorithm for checking universality of a quantum gate set

+ 8 like - 0 dislike

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.

This post has been migrated from (A51.SE)
asked Jan 20, 2012 in Theoretical Physics by Marcin Kotowski (405 points) [ no revision ]
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.

This post has been migrated from (A51.SE)
@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.

This post has been migrated from (A51.SE)
Thus the gate $CU_2 \times U_1$ is universal if and only if the first Turing machine halts, and is hence undecidable.

This post has been migrated from (A51.SE)

1 Answer

+ 4 like - 0 dislike

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.

This post has been migrated from (A51.SE)
answered Jan 20, 2012 by Joe Fitzsimons (3,555 points) [ no revision ]
Most voted comments show all comments
Why we should check only pairs?

This post has been migrated from (A51.SE)
@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.

This post has been migrated from (A51.SE)
I meant you should consider $[\ldots[H_k,H_j],H_l],\ldots]$, but not only pairs, e.g. see my own paper http://arxiv.org/abs/quant-ph/0010071

This post has been migrated from (A51.SE)
@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.

This post has been migrated from (A51.SE)
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.

This post has been migrated from (A51.SE)
Most recent comments show all comments
@AlexV: I should point out, however, that there is often a polynomial time algorithm. Daniel Burgarth and Alastair Kay have both done a fair amount of work on this problem for restricted types of Hamiltonians.

This post has been migrated from (A51.SE)
I did not see a work of Daniel Burgarth and Alastair Kay on the particular theme, but in works of other authors most often appear the same $spin(n)$ theme, but it is necessary some time, to check the isomorphism. Anyway, in many classical problems we should consider $n \to \infty$ to lost decidability.

This post has been migrated from (A51.SE)

Your answer

Please use answers only to (at least partly) answer questions. To comment, discuss, or ask for clarification, leave a comment instead.
To mask links under text, please type your text, highlight it, and click the "link" button. You can then enter your link URL.
Please consult the FAQ for as to how to format your post.
This is the answer box; if you want to write a comment instead, please use the 'add comment' button.
Live preview (may slow down editor)   Preview
Your name to display (optional):
Privacy: Your email address will only be used for sending these notifications.
Anti-spam verification:
If you are a human please identify the position of the character covered by the symbol $\varnothing$ in the following word:
Then drag the red bullet below over the corresponding character of our banner. When you drop it there, the bullet changes to green (on slow internet connections after a few seconds).
To avoid this verification in future, please log in or register.

user contributions licensed under cc by-sa 3.0 with attribution required

Your rights