Commuting Local Hamiltonian Problem on 2D beyond qubits
Abstract
We study the complexity of local Hamiltonians in which the terms pairwise commute. Commuting local Hamiltonians (CLHs) provide a way to study the role of non-commutativity in the complexity of quantum systems and touch on many fundamental aspects of quantum computing and many-body systems, such as the quantum PCP conjecture and the area law. Despite intense research activity since Bravyi and Vyalyi introduced the CLH problem two decades ago [BV03], its complexity remains largely unresolved; it is only known to lie in NP for a few special cases. Much of the recent research has focused on the physically motivated 2D case, where particles are located on vertices of a 2D grid and each term acts non-trivially only on the particles on a single square (or plaquette) in the lattice. In particular, Schuch [Sch11] showed that the CLH problem on 2D with qubits is in NP. Aharonov, Kenneth, and Vigdorovich [AKV18] then gave a constructive version of this result, showing an explicit algorithm to construct a ground state. Resolving the complexity of the 2D CLH problem with higher dimensional particles has been elusive. We prove two results for the CLH problem in 2D:
-
•
We give a non-constructive proof that the CLH problem in 2D with qutrits is in NP. As far as we know, this is the first result for the commuting local Hamiltonian problem on 2D beyond qubits. Our key lemma works for general qudits and might give new insights for tackling the general case.
-
•
We consider the factorized case, also studied in [BV03], where each term is a tensor product of single-particle Hermitian operators. We show that a factorized CLH in 2D, even on particles of arbitrary finite dimension, is equivalent to a direct sum of qubit stabilizer Hamiltonians. This implies that the factorized 2D CLH problem is in NP. This class of CLHs contains the Toric code as an example.
1 Introduction
Understanding the properties of ground states of local Hamiltonians is a central problem in condensed matter physics. Kitaev [Kit03a] famously formulated this problem as a decision problem, amenable to analysis from the perspective of computational complexity, by defining the local Hamiltonian problem (LHP), which asks whether the ground energy of a local Hamiltonian is below one threshold or greater than another. The LHP can be interpreted as the quantum generalization of the Boolean Satisfiability problem (SAT), where for SAT, all the terms are diagonal in the computational basis. Kitaev showed that the LHP is QMA-complete [KKR06], a quantum analog of the Cook–Levin theorem showing that SAT is NP-complete. Formally, a -local Hamiltonian is a Hermitian operator on qudits, where each term only acts on qudits. Given two parameters with , the LHP is to determine whether the ground energy of , namely the minimum eigenvalue, is smaller than or greater than .
It is widely believed that , which would imply that the LHP is strictly harder than the SAT. A natural question then to ask is what properties make quantum SAT (LHP) harder than classical SAT? Alternatively, what additional constraints can make LHP easier than QMA-complete? An intermediate model that sits in between classical and quantum Hamiltonians is the Commuting Local Hamiltonian problem (CLHP), in which the terms of the local Hamiltonian pairwise commute. Commuting local Hamiltonians form an important sub-class of Hamiltonians of physical interest and were first studied from the complexity perspective by Bravyi and Vyalyi [BV03]. Compared to the general LHP, the idea that CLHs should be more classical in nature stems from the intuition [FS97] in quantum physics, which suggests that it is the non-commutativity that makes the quantum world different from classical. Moreover, since all the terms of a CLH can be simultaneously diagonalized by a single basis, every eigenstate of the full Hamiltonian can be specified up to degeneracies by the corresponding eigenvalue for each term. The fact that the eigenstates have a classical specification suggests that the structure of the eigenbasis is more classical in nature. However, this fact is not enough to prove CLHP is in NP, since the eigenstates themselves can potentially be highly entangled, as is true for the famous example of Kitaev’s toric code [Kit03b]. Thus, a quantum witness for CLHP may still be beyond a classical description.
Commuting Hamiltonians provide a lens to study many fundamental aspects of quantum computing and many-body systems. For example, the stabilizer framework [Got97] is the basis for most error-correcting codes, and stabilizer codes can be seen as the ground states of commuting Hamiltonians. Commuting Hamiltonians are commonly used as a test ground for attacking difficult problems such as the quantum-PCP conjecture [AE11a, Has12b, Has13], NLTS conjecture [ABN22], Gibbs states preparation [KB16] and fast thermalization [BCG+23, CRF20]. In particular, commuting Hamiltonians could potentially provide insight into the area law and its connection to the efficient expressibility of ground states. The Area Law states that for ground states of gapped Hamiltonians on a finite-dimensional lattice, the entanglement entropy between two regions of ground states scales with the boundary between the regions as opposed to their volume. The area law is known to hold for 1D Hamiltonians and is known for 2D only under the assumption that the Hamiltonian is uniformly gapped [AAG22]. It is widely hoped that proving the area law will lead to insight into whether such ground states can be efficiently expressed or constructed by quantum circuits. As a subclass of LHP, it is well known that the area law holds for CLHs, and yet, even in 2D, we do not know whether the ground states of CLHs can be efficiently represented or constructed.
1.1 Previous Results
Despite two decades of study, the complexity of CLHP still remains open, with a few special cases known to be in NP ([BV03, AE13, AE11b, Sch11, AKV18, Has12a]). Bravyi and Vyalyi initiated this line of work, showing that qudit -local CLHP is in NP [BV03]. Their proof uses a decomposition lemma based on the theory of finite-dimensional -algebra representations. All subsequent work on the CLHP has made use of this framework.
Aharonov and Eldar [AE11b] extended the results to the -local case for qubits and qutrits. Specifically, they proved that 3-local qubit-CLHP is in NP. They also proved that 3-local qutrit CLHP is in NP on the Nearly Euclidean interaction graphs. All the above results are proved by showing that there is a trivial ground state, i.e. the ground state can be prepared by a constant depth quantum circuit. This constant depth circuit is the NP witness and the energy of this trivial ground state can be checked in classical polynomial time by a light-cone argument. However, for 4-local CLHP, even if the interaction graph is a 2D square lattice, there are systems like the Toric code which has no trivial ground states.
In this work, we mainly focus on 4-local CLHP on a 2D square lattice with qudits (abbreviated as qudit-CLHP-2D). Specifically, consider a 2D square lattice as in Fig. 1(a) with a qudit on each vertex and on each plaquette , there is a Hermitian term acting on the qudits on its four vertices. With some abuse of notations, we also use to denote the Hermitian term on the plaquette . The qudit-CLHP-2D is given an -qudit Hamiltonian where are commuting, two parameters where , decide whether the minimum eigenvalue of is smaller than or greater than . There is an alternate 2D setting in which qudits are placed on the edges and there are Hermitian terms on “plaquettes” and “stars”. The two settings, i.e. qudits on vertices or qudits on edges, are equivalent when the underlying graph is a 2D square lattice. ( See Appendix C.)
Along this line, Schuch [Sch11] first proved that the qubit-CLHP-2D is in NP. Schuch’s proof provides a witness showing that a low-energy state exists without giving an explicit description of the state. Indeed his proof leaves open the question of whether an explicit description of the state even exists. Aharonov, Kenneth, and Vigdorovich [AKV18] later gave a constructive proof, showing that after some transformation, the qubit-CLHP-2D is equivalent to the Toric code permitting boundaries. We say a proof is constructive if The NP prover shows that the ground energy is below by providing a circuit for preparing the ground state. A boundary roughly means a qubit where one of the four terms involving this qubit, i.e. in Fig. 1(b), acts trivially on . A Hamiltonian is equivalent to the Toric code permitting boundaries if after choosing an appropriate basis for each qubit, terms in the Hamiltonian act similarly as or on the non-boundary qubits. Both proofs [Sch11, AKV18] for the qubit-CLHP-2D heavily depend on the restrictions to the qubits, since the induced algebra of a term on a qubit can only have a very limited structure. The limited structure for the qubits case does not hold for higher dimensional particles, not even for qutrits.
Hastings [Has12a] proved a subclass of the qudit-CLHP-2D is in NP with some restrictive assumptions. Roughly speaking, he grouped all qudits on the same vertical line as a supersite, then viewed the 2D lattice as a 1D line, which reduced the qudit-CLHP-2D back to the “qudit” 2-local case [BV03]. However, the main problem is that those supersites are not really qudit of constant dimension. In fact, the dimension of the supersite is sub-exponential in the number of qudits. Thus Hastings further assumes that several technical conditions hold, like certain operators in the proof can be efficiently represented by matrix product operators of bounded dimension.
Besides the qudit-CLHP-2D, Bravyi and Vyalyi [BV03] also addressed the special case of the commuting Hamiltonian problem where all the terms are factorized (CHP-factorized). That is , and each term is a tensor product of single-qudit Hermitian operators. For example, the Toric code is an instance of CHP-factorized, since each term is or . In general, in CHP-factorized each is not necessarily local, and there are no constraints on the underlying interaction graph. Bravyi and Vyalyi give a non-constructive proof to show that the qubit-CHP-factorized is in NP. It is an open question whether their proof can be generalized to higher dimensional particles (qudit-CHP-factorized) or whether their proof for qubits can be made constructive.
All of the above results prove that subclasses of CLHP are in NP. On the other hand, Gosset, Mehta, and Vidick [GMV17] give a result that indicates CLHP might be harder than NP, or even as hard as the general LHP. They show that the ground space connectivity problem of commuting local Hamiltonian is QCMA-complete, which is as hard as the ground space connectivity problem for the general local Hamiltonian.
1.2 Main results and proof overview
1.2.1 Main results
In this work, we give two new results on the qudit-CLHP-2D. The family of Hamiltonians considered in both results contains the Toric code as a special case. Theorem 1 extends the results for the qubit-CLHP-2D [Sch11, AKV18] to qutrits.
Theorem 1
The qutrit-CLHP-2D is in NP.
As far as we know, Theorem 1 is the first result for CLHP on 2D lattice beyond qubits. As noted, the results for the qubit-CLHP-2D [Sch11, AKV18] heavily depend on the limited dimension of qubits — the induced algebras on qubits have a very limited structure — which does not hold for qutrits. Our key idea to circumvent this problem introduces a technique to decrease the dimension of qudits. Specifically, denote the qudit-CLHP-2D instance as and the Hilbert space of a qudit as . Under certain conditions, we observe that it suffices to consider a new instance of qudit-CLHP by (1) Restricting to a subspace of smaller dimension and (2) Constructing a new Hamiltonian by projecting all to the smaller subspace, and then rounding all non-1 eigenvalues of the projected terms to 0. Moreover, the new instance preserves the correct answer in that “no” instances are converted to “no” instances, and “yes” instances are converted to “yes” instances. Thus, we show that our “decrease dimension and rounding” method (Lemma 23) can be interpreted as a non-constructive self-reduction for the qudit-CLHP. Here self-reduction means we reduce the original qudit-CLHP to a new qudit-CLHP where some qudits have strictly smaller dimensions. We emphasize that the key lemma, Lemma 23, works for the qudit-CLHP rather than only for qutrits, even without 2D geometry. This lemma might be of independent interest and bring new insights to tackle the general CLHP. We will explain this in more detail in the proof overview.
We next consider the special case of qudit-CLHP-2D where all the terms are factorized (qudit-CLHP-2D-factorized). Our second result, namely Theorem 2, is a constructive proof showing that qudit-CLHP-2D-factorized is in NP. Although we do not give the details here, our proof could be considerably simplified to provide a non-constructive version based on the ideas of [BV03] and [Sch11]. Here we give a stronger constructive proof that characterizes the structure of the ground space.
Theorem 2 (Informal version of Theorem 46)
The Hamiltonian in the qudit-CLHP-2D-factorized is equivalent to a direct sum of qubit stabilizer Hamiltonian. In particular, a factorized 2D commuting local Hamiltonian always has a ground state which is equivalent to qubit stabilizer state. This implies qudit-CLHP-2D-factorized is in NP.
We first briefly explain terminologies in Theorem 2. We say a commuting Hamiltonian on space is equivalent to a qubit stabilizer Hamiltonian, if (1) For each , by choosing an appropriate basis, is factorized as a tensor of Hilbert spaces of dimension . Thus each can be interpreted as several qubits. We allow which corresponds to qubit. (2) Each term acts as a Pauli operator up to phases, with respect to the basis of those “qubits”. We say a subspace is simple, if is a tensor product of subspaces of each qudit, i.e. . We say a commuting Hamiltonian on -qudit space is equivalent to a direct sum of qubit stabilizer Hamiltonian, if the is a direct sum of simple subspaces , such that keeps each invariant, and is equivalent to qubit stabilizer Hamiltonian on .
Although one might conjecture that factorized commuting Hamiltonians (CHP-factorized) are equivalent to a direct sum of stabilizer Hamiltonians even when not restricted to 2D, this is still an open question even for the qubit case [BV03]. To illustrate the difficulty, consider two factorized terms acting on two qudits and : and . If and , then it must be the case that the factors in each individual qudit must commute or anti-commute which gives rise to a stabilizer-like structure. By contrast, if , then for any choice of . This means that and can have an arbitrary relationship to each other and the two commuting terms may look very different from stabilizers. This second possibility suggests, alternatively, that factorized CLHs in 2D could have a different topological order from stabilizer Hamiltonians. More precisely, one may conjecture that there is a factorized Hamiltonian, such that no ground state can be prepared by applying a constant depth quantum circuit to a stabilizer state. We show a negative answer to this conjecture, by proving that the qudit-CLHP-2D-factorized is equivalent to a direct sum of qubit stabilizer Hamiltonian.
1.2.2 Overview for Theorem 1.
We start by reducing the more general CLH problem to a slightly restricted case where the commuting terms are projections and the energy lower bound is equal to . We will argue that if the more restricted version is in NP then the more general CLHP is also in NP. Consider an instance of the more general problem with Hermitian terms and bounds and , where . The NP prover can provide a vector describing the energy eigenvalue for each individual term such that . Then the verifier can replace each term with , where is the projection onto the eigenspace of corresponding to eigenvalue . The new instance has a state where for all if and only if for all . Since the are all commuting projectors, the eigenvalues of the Hamiltonian are non-negative integers. Thus, the verifier can set the new to be equal to , resulting in a promise gap of . Therefore, when describing the proof of Theorem 1, we shall assume the terms are projections and that the question is whether there is a where for all (i.e. a frustration-free ground state). Note that this reduction does not work for the factorized case because even if the is factorized, the resulting is not necessarily factorized.
We start by introducing the framework of induced algebras. The basic ideas are sketched here and specified in more detail in Section 3. Denote as the set of all operators on a Hilbert space . A -algebra is any algebra which is also closed under the operations and includes the identity. Consider a Hermitian term acting . The operator can be decomposed as
The induced algebra of on space , denoted as , is the -algebra generated by . Note that the particular decomposition of is not critical other than the fact that the terms acting on are linearly independent. The key technique introduced by [BV03] is the Structure Lemma which decouples two commuting terms in their overlapping space: consider two terms sharing only one qudit . If , then the induced algebras, and , must commute, meaning that every operator in commutes with every operator in . Furthermore, can be decoupled in , in that is there exists a direct sum decomposition , where
-
•
each has a factorized structure:
-
•
and only acts non-trivially on and only acts non-trivially on .
Both proofs showing that the qubit-CLHP-2D is in NP [Sch11, AKV18] depend heavily on the properties of qubits. In particular, if is a qubit, then there are only two ways to have a direct sum decomposition of , namely as the direct sum of two -dimensional spaces or as a single -dimensional space. Note that we must also consider the case in which an induced algebra is trivial, meaning that which implies that the operator acts trivially on qubit . Using the Structure Lemma the following statement is true:
Fact 3
Any two commuting non-trivial induced algebras on a qubit must be diagonalizable in the same basis.
Note that Fact 3 is not true for qutrits. One may understand this statement intuitively by only basic linear algebra. In particular, if are Hermitian operators on a qubit, where is not proportional to the identity and both and commute with , then all three operators can be diagonalized in the same basis. This observation is not true for qutrits, as here exist operators on a qutrit with nontrivial, such that commutes with and , but the three operators cannot be diagonalized simultaneously.
Since the structure of our proof follows the same outline as Shuch’s proof, we briefly explain how [Sch11] used Fact 3 to prove qubit-CLHP-2D is in NP. Consider an arbitrary qudit-CLHP-2D instance . As argued above, we can assume are commuting projections, and the goal is to determine whether or . Note that in this setting, proving is equivalent to proving .
Now consider a qubit in a 2D lattice (as shown in Fig. 1(b)). We name the terms acting on as . We define the set of removable qubits (defined implicitly in [Sch11]) as follows:
-
•
: If the induced algebras of on can be diagonalized in the same basis; or this condition holds for .
The set is called removable since they can be effectively traced out. Specifically, suppose and assume can be diagonalized in basis . Then
Each quantity in the sum on the right is the trace of a product of two positive semi-definite Hermitian operators, and therefore, each quantity in the sum is non-negative. Thus, if and only if one of the two quantities in the sum is positive. The prover will then provide a or for qubit for which the trace is positive. Note that the proof is non-constructive because the ground state may not lie entirely within either the space spanned by the space spanned by or the space spanned by . Suppose that the witness for qubit is . The verifier must verify that
The other two terms that might act non-trivially on qubit are and . By Fact 3 we know either one of the induced algebras of on acts trivially on , or they can be diagonalized in the same basis. By considering each case separately, it can be argued that the qubit can be traced out of all the terms. This process can be applied simultaneously for all the removable qubits. The remaining Hamiltonian will only contain terms that operate non-trivially on qubits that are not removable.
Using Fact 3, we know that if is not removable (), then one of and one of act trivially on . Now consider a graph where each vertex represents a plaquette term and two terms are connected if they operate non-trivially on a common qubit. Schuch argues that if none of the qubits are removable then this graph cannot have a vertex with a degree larger than two, namely the graph is a set of disjoint chains and cycles. The trace of each chain or cycle can be computed in classical polynomial time by representing each term as a tensor and contracting the tensors along the chain.
When moving to qutrits, we need to address the fact that the Structural Lemma allows for more complex decompositions of the Hilbert space of a qutrit, and in particular, Fact 3 no longer holds. Our key observation to tackle the problem, is to introduce a new way to decrease the dimension of the particle — Decrease Dimension and Rounding (Lemma 23, Sec. 4.1), which can be applied to qudits that have a property which we call semi-separable.
We first describe the stronger condition of a separable qudit, which was introduced in [AE11b]. Consider a CLHP . A qudit is separable if there exists a non-trivial decomposition such that all the terms keep all subspaces invariant. Note that if there is a separable qudit and a solution (i.e. a frustration-free ground state) exists, then a ground state must lie entirely within one of the . Thus a prover can provide the projector onto the subspace of qudit which contains the solution. The verifier can replace each term with and the dimension of the problem has been reduced.
We now extend this notion and define a qudit to be semi-separable if we allow at most one term to not keep the decomposition invariant. Our key observation is that, for CLHP, even for a semi-separable qudit , an NP prover can similarly decrease the dimension of the qudit , in a non-constructive way. Specifically, the NP prover will choose a subspace and restrict all the terms in this subspace. Since there is one term (call it ) that is inconsistent with the decomposition, such restriction can not be done naturally. Instead, we project on the subspace and then round all the not-1-eigenvalue to 0. By doing this we claim that we again get a new CLHP instance with a smaller dimension in qudit . More importantly, we prove that the original CLHP has a frustration-free ground state iff there exists a such that the new CLHP also has a frustration-free ground state. The reduction is non-constructive because the ground state in the new instance may not be the same as the ground state in the original instance. The “semi-separable” technique is powerful especially for CLHP-2D where , since on 2D lattice as in Fig. 1(b), for any qudit , if we consider the decomposition of induced by the induced algebra of on , there are at most 2 terms, i.e. , which do not keep the decomposition invariant. This observation is also true for CLHP embedded on a planar graph.
By the above argument, to prove the qutrit-CLHP-2D is in NP, w.l.o.g we can assume that there are no semi-separable qutrits. We further prove that the condition — the qutrit-CLHP-2D without semi-separable qutrits — leads to strong restrictions on the form of the Hamiltonian. In particular, we show that for the qutrit-CLHP-2D without semi-separable qutrits, if we consider again the graph of plaquette terms where two terms are connected by an edge if they act non-trivially on a common qutrit, then this graph must also consist of disjoint chains or cycles. The trace of the -energy space can be computed as before in classical polynomial time by contracting 1D chains of tensors. The NP witness will be the indexes of subspaces chosen when removing all semi-separable qudits, and the subspaces for the removable qutrits.
1.2.3 Overview of Theorem 2
Recall that Theorem 2 is a constructive proof for the qubit-CLHP-2D-factorized, where factorized means each term is a tensor product of single-qudit Hermitian operators. As we mentioned in the main results section, finding a constructive proof that CHP-factorized is in NP is made difficult because if the product of two terms and is equal to , then their terms on individual qudits can have an arbitrary relationship. Namely, it is possible that . On the other hand, [BV03] showed that if all the terms are commuting obey the condition that for each qudit, then the Hamiltonian will be related to a qubit stabilizer Hamiltonian.
The key part to proving the Theorem 2, is to remove the possibility that for some , without changing the ground space, which will imply a constructive proof by showing a correspondence with stabilizer Hamiltonians. In general, this removal is hard to achieve. Even for the qubit-CHP-factorized, it is still an open question whether there exists a constructive proof. However surprisingly, we can give a constructive proof for qudit-CHP-factorized, when the underlying interaction graph is 2D, i.e. qudit-CLHP-2D-factorized. Specifically, by using proof of contradiction, firstly we prove that qudit-CLHP-2D-factorized, if there are no separable qudits, then all terms must commute in a regular way. With a slight clarification, we show that the qudit-CLHP-2D-factorized without separable qudits is equivalent to qubit stabilizer Hamiltonian. For the more general case where there are separable qudits, we then notice that there exists a partition of the -qudit space into simple subspaces, such that the restricted Hamiltonian on each subspace has no separable qudits. This partition is achieved by the following: when there is a separable qudit w.r.t decomposition , we partition the whole space according to this decomposition. We recursively perform this partition until for each subspace, the restricted Hamiltonian has no separable qudits.
1.3 Structure of the manuscript
The manuscript is structured as follows. In Sec. 2 we give notations and definitions which are used throughout this manuscript. In Sec. 3 we review the necessary definitions and techniques of -algebra and the Structure Lemma required for proving that the qutrit-CLHP-2D is in NP. In Sec. 4 and Sec. 5, we give proofs for the qutrit-CLHP-2D and the qudit-CLHP-2D-factorized respectively.
The manuscript is written in a way that several proofs can be read separately. In summary, for readers interested in Lemma 23 (The Decrease Dimension and Rounding Lemma), the suggested order is Sec. 2 and Sec. 4.1. For readers interested in the qutrit-CLHP-2D, the suggested order is Sec 2, Sec. 3, Sec. 4. For readers interested in the qudit-CLHP-2D-factorized, the suggested order is Sec 2, Sec. 5, and then Sec. 3 if necessary.
1.4 Conclusion and future work
In this manuscript, we give two new results of the qudit-CLHP-2D. First, we proved that qutrit-CLHP-2D is in NP, by introducing a non-constructive way of self-reduction for the qudit-CLHP, when there are semi-separable qudits. This self-reduction (proven in Lemma 23) works for qudit and might be of independent interest. Second, we prove that qudit-CLHP-2D-factorized is in NP, by showing that the Hamiltonian is equivalent to a direct sum of qubit stabilizer Hamiltonian.
One direct question is whether our proof for qutrit-CLHP-2D can be made to be constructive. That is whether one can prepare the ground state by polynomial-size quantum circuits. Aharonov, Kenneth and Vigdorovich [AKV18] proved that the qubit-CLHP-2D is equivalent to the Toric code permitting boundary. It is natural to ask whether qutrit-CLHP-2D, or general qudit-CLHP-2D, can have different ground space properties from the stabilizer Hamiltonians. Another question is whether our constructive proof for the qudit-CLHP-2D-factorized can be modified to prepare the ground states of the qubit-CHP (without 2D geometry). Recall that the qubit-CHP is in NP by a non-constructive method [BV03].
A further question is to extend the frontier of the complexity of CLHP. In particular, we conjecture that Lemma 23 can be used in more general settings. Recall that Lemma 23 works for qudit rather than only for qutrits, and it implies w.l.o.g we can assume that there are no semi-separable qudits. It is interesting to see whether one can prove that the qudit-CLHP-2D by combining Lemma 23 and other methods like [AKV18]. Another promising setting is considering 3-local qutrit-CLHP, without any geometry constraints. Recall that [AE11b] proved for 3-local qubit-CLHP is in NP, by showing that after removing all separable qubits, the resulting Hamiltonian can be viewed as a 2-local qudit-CLHP. It is possible that for 3-local qutrit-CLHP, if we remove all semi-separable qutrits, the Hamiltonian is again of a 2-local structure, which will imply 3-local qutrit-CLHP is in NP.
Most known results are trying to show that CLHP is in NP. On the other side, it will be very interesting to provide any evidence that CLHP might be harder than NP.
2 Preliminaries
2.1 Notation
Given a Hermitian operator , we use to denote its ground energy, i.e. minimum eigenvalue. For two operators, and , we use to denote its commutator . In particular, means are commuting. Two sets of operators, and , commute if For a set of Hermitian operators , we use to denote its common -eigenspace, i.e. . We say is non-trivial iff 111This means the zero vector. With some abuse of notations, we use both for real number zero, and zero vector. For ease of illustration, we also denote a Hermitian as a set . We say a Hermitian operator is a projection if . When are commuting projections, we have iff is non-trivial.
Let be a finite-dimensional Hilbert space. We use to denote the set of linear operators on . For Hermitian , we use to denote is positive semidefinite, that is all of its eigenvalues are non-negative. We use to denote the identity matrix. Let be a Hermitian operator on Hilbert space , we say keeps the decomposition invariant if keeps the subspace invariant, . We say the decomposition is non-trivial if .
In the following, we use to denote a qudit, and to denote the Hilbert space of the qudit . Consider an operator acting on qudits. We say that acts trivially on a qudit if acts as identity on . When acts non-trivially on only of the qudits, we will interchangeably view as an operator on qudits or a global operator on qudits. The meaning will be clear in the context. We use for tracing out the qudits in , and use for tracing out all the qudits. We use to denote the set of qudits outside .
2.2 Formal Problem Definitions
Commuting -Local Hamiltonian We say a Hermitian operator on qudits is a commuting -local Hamiltonian, if for , where each only acts non-trivially on qudits, and . We allow different qudits to have different dimensions. In particular, for qutrit -local commuting local Hamiltonian, we allow the dimension of each qudit to be either or .
2D and Factorized Variants Consider a 2D square lattice as in Fig. 1(a), on each vertex there is a qudit , and on each plaquette there is a Hermitian term acting on the qudits on its four vertices. With some abuse of notations, we also use to denote the Hermitian term on the plaquette . We say a commuting (4-local) Hamiltonian is on 2D if there is an underlying 2D square lattice and plaquettee terms defined as above such that and all are pairwise commuting.
We further say a commuting (4-local) Hamiltonian on 2D is factorized, if each is factorized on its vertices, that is for Hermitian terms acting on qudit , as shown in Fig. 1(a). We call factors. For the Toric code, .
Commuting -Local Hamiltonian problem Given a family of commuting -local Hamiltonian on qudits and parameters with . The commuting -local Hamiltonian problem w.r.t is a promise problem that decides whether or . We denote this problem as qudit-CLHP, abbreviated as qudit-CLHP when are clear in the context. Similarly, we abbreviate the 2D and 2D-factorized variants as qudit-CLHP-2D and qudit-CLHP-2D-factorized respectively.
We define a special case of the qudit-CLHP called qudit-CLHP-projection where each term is a projection, , and . Note that since are commuting projections, we know must be a non-negative integer. Thus in the No instance we use rather than . We define qudit-CLHP-2D-projection similarly.
2.3 More Definitions
Consider a commuting -local Hamiltonian on qudits with Hermitian terms . Although acts non-trivially only on qudits, in this section we view it as an operator on qudits. We will name the qudits as . When we refer to an arbitrary qudit, we name it as .
Definition 4 (Separable qudit)
A qudit is separable w.r.t Hermitian terms if there exists a non-trivial decomposition of its Hilbert space s.t all keep the decomposition invariant. Here non-trivial means . We use to denote the projection onto .
The definition of separable is first introduced by [AE11b]. Roughly speaking, it says all the Hermitian terms are block-diagonalized in the same way. We introduce the notion of semi-separable qudit, which will play a key role in the proof of the qutrit-CLHP-2D.
Definition 5 (Semi-separable qudit)
A qudit is semi-separable w.r.t Hermitian terms if there exists a non-trivial decomposition of its Hilbert space s.t all but one keeps the decomposition invariant. Here non-trivial means . We use as the projection onto . By convention when referring to a specific qudit, we will denote the term which does not keep the decomposition invariant as .
Semi-separable qudit is a relaxation of separable qudits, in the sense that we allow one term to be not block-diagonalized w.r.t the decomposition . Note that by the definition of semi-separable, is Hermitian and we have . We will repeatedly use this fact. It is also important to keep in mind that might not be equal to , since we allow not keeping invariant.
3 Review of -algebras and the Structure Lemma
This section is a review of -algebra and the Structure Lemma [BV03], which is the key tool to analyze the structures in the commuting local Hamiltonians. A more detailed proof on those techniques can be seen in Sec. 7.3 of [GHL+15]. The following notations and lemmas are rephrased from [AKV18] and Sec. 7.3 of [GHL+15].
3.1 Basics of -algebras
Definition 6 (-algebra)
Let be a finite dimensional Hilbert space, a -algebra is any algebra which is closed under the operations and includes the identity. We say that two -algebras, and , commute if
Definition 7 (Trivial operator and algebra)
Let be a finite-dimensional Hilbert space. We say an operator acting trivially on if for some constant . We say a -algebra on is trivial if every operators in is trivial, i.e. . If , we say acts trivially on if for .
Definition 8 (Center of -algebra)
The center of a -algebra is defined as the set of operators in which commutes with , that is
(1) |
Then we introduce the induced algebra, which connects a Hermitian operator and a -algebra.
Definition 9 (Induced algebra)
Let be a Hermitian operator acting on Hilbert space . Consider the decomposition
(2) |
where is an orthogonal basis of . The induced algebra of on , denoted as , is defined as the -algebra generated by . We abbreviate as when is clear in the context. We abbreviate as for qudit .
The induced algebra is independent of the chosen decomposition for Hermitian .
3.2 The Structure Lemma
The Structure Lemma [T+03] says that every finite-dimensional -algebra is a direct sum of algebras of all operators on a Hilbert space. See Sec. 7.3 of [GHL+15] for an accessible proof of the Structure Lemma. The following statement is taken from [AKV18].
Lemma 11 (The Structure Lemma: classification of finite dimensional -algebras )
Let be a -algebra where is finite dimensional. There exists a direct sum decomposition: and a tensor product structure such that
Furthermore, the center of is spanned by , where is the projection onto the subspace .
Given a -algebra , we denote the decomposition in Lemma 11 as the decomposition induced by . Note that here we do not argue whether the decomposition in Lemma 11 is unique or not. However, for clarity when we mention the decomposition induced by , we always refer to the same canonical decomposition. For example, we can set the canonical decomposition to be the one obtained by the proof in Sec. 7.3 of [GHL+15]. In the following we give some definitions of decompositions, and a further remark on Lemma 11.
Definition 12 (Trivial, Better decomposition)
Consider the decomposition of a finite-dimensional space . We say the decomposition is trivial if . We say one decomposition is better222Here we measure “better” only in terms of . We do not require any relationship between the subspaces of the better decomposition and the worse for . Note that even for two commuting algebras , the two decompositions of induced by might not be finer than each other. That’s why we use “better” rather than ”finer” here. We define in this way just to ease notations and make our proof more precise. than another if it has a bigger .
Lemma 11 implies all operators in keep the decomposition invariant. It is worth noting that the decomposition induced by might not be the best decomposition that keeps invariant. In particular, consider the -algebra generated by , i.e. . The decomposition of induced by is trivial, i.e. , but keeps any decomposition of invariant. Using Lemma 11, we can analyze how two induced algebras can commute with each other.
Corollary 13 (The Structure Lemma)
Let be a -algebra acting on a finite dimensional . Let , , is the decomposition induced by by Lemma 11. Consider another -algebra on which commutes with , we have
Especially, all operators in keep the decomposition invariant.
Proof.
In the following, we give a sufficient condition that implies the decomposition of space induced by the -algebra is non-trivial.
Lemma 14 (Non-trivial decomposition)
Let be a -algebra on a finite dimensional . Denote the decomposition induced by in Lemma 11 be . Consider another -algebra on which commutes with . If such that . Then the decomposition is non-trivial.
Proof.
With contradiction suppose the decomposition is trivial, i.e.
By Corollary 13 we have
Since , we have which leads to a contradiction. ∎
3.3 Partitions Inducted by Commuting Operators
The following definitions will be used throughout Sec. 5.
Definition 15
Let be two Hermitian terms acting on where . Suppose that acts trivially on , acts trivially on , , and at least one of acts non-trivially on . Let the decomposition be the better one induced by or . We say that commute in -way on if .
Note that by Corollary 13, have a tensor-product structure on . Since the dimension of any Hilbert space must be an integer, two terms on a qutrit of dimension can only commute in the following ways.
Lemma 16
Let be two Hermitian terms acting on where . If acts trivially on , acts trivially on , , and at least one of acts non-trivially on . Let the decomposition be the better one induced by or . then must commute on via one of the following ways
-
•
-way: , where .
-
•
-way: , .
-
•
-way: , . One of acts trivially on , and for another the induced algebra on is the full algebra .
Proof.
By corollary 13, we get a decomposition where . Since the dimension of a subspace must be an integer we get the above 3 possible ways. Further for the -way, by assumption the decomposition induced by both are . Since is a prime, which means it can only be a tensor product of a one-dimensional Hilbert space and a three-dimensional Hilbert space. Thus for both , they equal to either or . Since at least one of acts non-trivially on , we know one of the induced algebra are , w.l.o.g suppose . Again by corollary 13, should be , thus acts trivially on . ∎
Similar arguments for qubits are widely used in the proof of the qubit-CLHP-2D is in NP [Sch11][AKV18]. We summarize it as below:
Lemma 17
If we change to be in the statement of Lemma 16, then must commute on via one of the following ways
-
•
-way if where .
-
•
-way if where . One of acts trivially on , and for another the induced algebra on is the full algebra .
4 Qutrit Commuting Local Hamiltonian on 2D
In this section, we will prove that the qutrit-CLHP-2D is in NP. This proof is non-constructive. Note that if the qutrit-CLHP-2D-projection is in NP, then the qutrit-CLHP-2D is in NP. The proof of this statement is in Appendix. B. Thus in this section, w.l.o.g we assume that all the terms are projections and prove that the qutrit-CLHP-2D-projection is in NP.
The proof sketch is as follows. In Sec. 4.1 we prove that we can further assume that there are no semi-separable qudits. In Sec. 4.2 we prove that for the qutrit-CLHP-2D without semi-separable qudits, there are strong restrictions on the form of Hamiltonian. Finally, in Sec. 4.3 we prove that with such restrictions, we can use Schuch’s method [Sch11] again.
4.1 Self-reduction for CLHP with semi-separable qudits
Lemmas in this section work for qudit-CLHP-projection333W.l.o.g we can assume that all terms are projections by Lemma 48., that is we do not assume that each particle is a qutrit, or the Hamiltonian is on 2D. Recall that qudit-CLHP-projection is: Consider a qudit-CLHP where are -local projections for some constant , for . The question is to determine whether or . Note that iff all the commuting projections have a common -eigenvector, i.e. is non-trivial. When , the common -eigenvectors of are the ground states of . We also denote the Hamiltonian as .
The key lemma in this section, Lemma 23, is to prove that when there is a semi-separable qudit, the prover can perform a non-constructive self-reduction for the qudit-CLHP-projection. Here self-reduction means reducing the qudit-CLHP-projection to another qudit-CLHP-projection, where the Hilbert space of the qudit has a smaller dimension. Before going into the formal proofs, in the following, we intuitively explain how Lemma 23 works. Specifically, temporarily assume that thus we are in the Yes instance and try to prove . We begin with the example when there is a separable qudit, then generalize this idea to the case of semi-separable qudit, and after that we give the formal proofs.
When there is a separable qudit , the prover can easily perform a constructive self-reduction. Suppose is a separable qudit, by definition, there exists a non-trivial decomposition such that all the terms keep the decomposition invariant. Then there must be a subspace which contains a common -eigenstate of . Denote the projector onto as . The prover can give the decomposition and the index . The verifier checks that is a separable qudit, then restricts the space of from to , and restricts all terms to , and ask the prover to prove that has a common -eigenstate. By definition of separable, the decomposition is non-trivial, thus the new instance is strictly simpler in the sense that we strictly decrease the dimension of the qudit . Note that this method is constructive — the common -eigenstate of the new instance is also the common -eigenstate of the original instance .
Our key observation is, for qudit-CLHP-projection, even for semi-separable qudit, the NP prover is able to perform a similar self-reduction, via a non-constructive way. If we follow the intuition of the separable qudit case, one might try restricting , and transform every term to be . The problem is that since does not keep invariant, and does not commute with , the is no longer a projection. One may also doubt whether the resulting Hamiltonian is commuting. A more serious problem is that, unlike the case for separable qudit, since does not keep invariant, it is not clear how to connect the ground states of the original Hamiltonian to the ground states of the new Hamiltonian. We circumvent the problems by slightly changing the construction — rounding to its -eigenspace.
Definition 18 (Reduced Hamiltonian)
Consider a semi-separable qudit w.r.t commuting projections and a non-trivial decomposition , where is the projection onto . For any , we define its -th reduced Hamiltonian to be , or written as , where
-
•
, for .
-
•
is the projection onto the -eigenspace of . Assign to be when the -eigenspace is empty. It is equivalent to interpret is obtained by rounding all the strictly-smaller-than-1-eigenvalues of to 0.
-
•
We restrict the space of from to . Note that all terms including keeps invariant, thus this restriction of space is well-defined. In summary, the original Hamiltonian acts on , the -th reduced Hamiltonian acts on .
Note that the construction of reduced Hamiltonian is consistent with our previous intuition for the separable qudit — If is separable and also keeps invariant, then is a projection thus . It is worth noting that the reduced Hamiltonian keeps the “geometry” of the original Hamiltonian:
Lemma 19
In Def. 18, if acts trivially on qudit w.r.t space , then acts trivially on qudit w.r.t space if or if . Especially, If is -local (or on 2D), so does the -th reduced Hamiltonian .
Proof.
We prove that if acts trivially on qudit , then so does , the proof for is similar. By assumption, acts trivially on , thus for some projection . Recall that is the semi-separable qudit in Def. 18. If , then
(4) | ||||
(5) |
is a projection and acts trivially on . If , , the 1-eigenspace of is also of form thus acts trivially on . ∎
Besides, the terms in the reduced Hamiltonian are commuting projections.
Lemma 20
If in Def. 18, are commuting projections, then for any , the -th reduced Hamiltonian are commuting projections.
Proof.
Notice that, by the definition of semi-separable, we have . It is also important to keep in mind that might not equal .
Firstly we can check that all terms are projections. Notice that is a projection by definition. For , since is a projection, and , we know is a projection444The most direct way to understand this is imagining are diagonal matrix, since they are commuting they can be diagonalized simultaneously.. In summary, all the terms are projections.
Then we prove that all terms are commuting. Notice that for any , for any , where can be , we have
(6) | ||||
(7) | ||||
(8) | ||||
(9) |
where Eq. (6) is from , Eq. (7) is from and , Eq. (8) is from . Note that we never assume that commutes with .
From the Eq. (9), we know if . Besides, we know for , . Thus keeps the -eigenspace555We emphasize it is the space spanned by all -eigenvector, rather than one of the eigenvector. of invariant. Since is Hermitian, this implies commutes with the projection onto this 1-eigenspace of , thus . In summary, all terms are commuting. ∎
In summary, we have
Corollary 21 (of Lemma 19 and Lemma 20)
If are -local (or on 2D) qudit commuting projections, then so does the -th reduced Hamiltonian .
In addition, we give a cute lemma – Lemma 22. In the lemma description, the right side of Eq. (10) is just rounding all non-zero coefficients to . This Lemma is simple itself but captures the key idea of “rounding” used in Lemma 23. It will explain why we can round all non- eigenvalue of to , and only use the -eigenspace.
Lemma 22
Let be a non-negative function. Then
(10) |
Proof.
Since is non-negative. It suffices to notice that both the left and the right inequalities are equivalent to s.t. . ∎
Now we are prepared to state our key lemma, which connects the original Hamiltonian to the reduced Hamiltonians. Inspired by Schuch’s idea [Sch11], we will decompose a non-negative term into summation over many non-negative terms. However, our method here uses very different decomposition rules, and has key differences from his, which will be discussed in more detail after the proof.
Lemma 23 (Decrease dimension and rounding)
Consider an instance of qudit-CLHP-projection on qudits, where the Hamiltonian is denoted as for commuting projections . Suppose there is a semi-separable qudit w.r.t. and non-trivial decomposition . For every , define the -th reduced Hamiltonian as in Definition 18. Then
(11) |
Proof.
Denote the -qudit space as . Define . For clarity, in this proof, we use for the identity on . When using we always view as an operator on , and we project out all the qudits, i.e. where is the computational basis for . Especially, we view as an operator in , while view as an operator in .
Note that are commuting projections, proving is equivalent to show that
(12) |
Since are commuting, the relative order in the above formula is unimportant. Recall that is the projection onto . By assumption , keeps invariant, thus
(13) | ||||
(14) | ||||
(15) |
Eq (13) is from , and for , is Hermitian and keeps invariant thus . Eq (14) is from are orthogonal from each other. Besides, since and for arbitrary , we have
(16) | ||||
(17) | ||||
(18) |
Eq. (18) if from . Note that is an -qudit Hermitian operator, thus it can be diagonalized by a unitary matrix. Consider its eigenvalue decomposition, denote the eigenvalues and projections onto the corresponding eigenspace as , . That is
(19) |
Note that it might be possible that acts non-trivially on some as long as acts non-trivially on . Besides, by definition of we have
(20) |
(21) | ||||
(22) |
Define
(23) |
Since are commuting projections, we know and is Hermitian. Note that and is Hermitian. Since the trace of the product of two positive semi-definite Hermitian matrices is non-negative666Let to be arbitrary two Hermitian matrices where . Since are Hermitian, consider the eigenvalue decompositions , . Then . , we have is non-negative,
(24) |
By Lemma 22, is equivalent to rounding all the non-zero coefficients in Eq. (22) to 1, that is equivalent as showing that
(25) | ||||
(26) | ||||
(27) | ||||
(28) | ||||
(29) |
Eq. (27) is from Eq. (20) and the definition of . Eq. (28) is from Note that Eqs. (25-29) and Eq. (24) imply that
(30) | ||||
(31) |
Thus we further have
(32) | ||||
(33) |
where in Eq. (33), the notation means now we restrict the space of qudit from , and the trace is over . Note that Eq. (33) is well defined since keeps invariant.
Corollary 24
If qudit-CLHP-projection without semi-separable qudit is in NP, then qudit-CLHP-projection is in NP.
Proof.
Lemma 23 says when there is a semi-separable qudit, an NP prover can efficiently reduce the qudit-CLHP-projection to a new qudit-CLHP-projection by strictly decreasing the dimension of . Since is a constant, an NP prover can reach to a qudit-CLHP-projection without semi-separable qudit by repeatedly performing Lemma 23 in time. ∎
To help better understand Lemma 23, let us discuss the differences between Lemma 23 and the method used in Schuch’s paper [Sch11]. We both decompose some of the terms and get a summation of non-negative quantities, but we do such decomposition and projection in different ways. The key difference is that in our method, we guarantee all the quantities still correspond to a commuting local Hamiltonian problem. Our method is more like self-reduction, and we can perform such self-reduction sequentially until this are no semi-separable qudits. On the contrary, in Schuch’s method, the two projections he used for each qudit777Schuch wrote his proof in terms of the qubit, but the first decomposition part also works for qudit., are not commuting with each other, and the quantity does not correspond to commuting local Hamiltonian anymore, thus this decomposition technique can only be performed once rather than sequentially.
4.2 Restrictions on the qutrit-CLHP-2D without semi-separable qudit
From now on we will consider the 2D geometry and start our proof for the qutrit-CLHP-2D-projection is in NP. Recall that we allow qudits in the qutrit-CLHP-2D-projection to have different dimensions, i.e. either 1,2 or 3. By Corollary 24, we can assume that there are no semi-separable qudits. This “no semi-separable qudits condition”, combined with the 2D geometry, will lead to strong restrictions on the form of the Hamiltonian, i.e. Lemma 26.
We define some notations. As shown in Fig. 2, when considering the qutrit-CLHP-2D-projection, for a qudit , we use to denote the two plaquette projections in the diagonal direction, to denote the two plaquettes projections in the anti-diagonal direction. In the whole Sec. 4.2, the relative positions of will always obey Fig. 2. We give the following definitions.
Definition 25
Consider a qutrit-CLHP-2D-projection instance, for any qutrit of dimension , use the notations in Fig. 2. For , we say that acting on via -way, if commute in -way888See Definition 15. More specifically, denote the set of qudits that acting non-trivially on as , then in Definition 15 . on , and commute in -way on ; or verse visa, i.e. commute in -way on , and commute in -way on .
Note that only overlap on one qudit – – thus the above sentence “ commute in A-way on ” is well-defined. Same for . On the other hand, overlap on two qudits, thus we cannot say commute in some way on . Another clarification is, that it is possible that some of the terms are identity, eg. , then the situation does not belong to Definition 25. Those cases will be considered separately and solved easily in the related proofs.
Recall that by Corollary 24, we can assume that there are no semi-separable qudits. This will imply certain ways of commuting cannot exist for the qutrit-CLHP-2D-projection.
Lemma 26 (Legal ways of commuting)
Consider a qutrit-CLHP-2D-projection Hamiltonian , if there is no semi-separable qudit, then there is no qutrit with such that terms acting on via -way or -way.
Proof.
To ease notations, in this proof we use to denote the Hilbert space of , instead of using . With contradiction, assume that there is a qudit with such that
-
•
commute via -way on . The decomposition w.r.t is , where , 999One may wonder how could written as in the Structure Lemma. Conceptually one can interpret , and as a one-dimensional space as scalars . for some , and , . Since is a prime and , by definition the decomposition is induced by or , and , by Corollary 13, one can check that one of must acts trivially on . W.l.o.g assume that , and acts trivially on .
-
•
For , consider the following cases:
-
(a)
commute via -way. In this case one of must act trivially on . W.l.o.g assume that is the term.
-
(b)
commute via -way. Similarly as above notaions for we have , and define , similarly. And similarly assume that acts trivially on .
-
(a)
Case (a): We will prove is semi-separable, which leads to a contradiction. Consider the decomposition from -way for , that is . Since acts trivially on , it keeps those subspaces invariant as well. In summary, all terms but keep the decomposition invariant. Since the decomposition is non-trivial, by definition is semi-separable.
Case (b): Consider term , by definition, is Hermitian, keeps invariant and acts trivially on . We can write
(34) |
Here is the identity on . And (might be 0) act non-trivially at most on the remaining three qudits , as in Fig. 2. Rewriting , we have
(35) |
Since is Hermitian, we know are Hermitian. Similarly, we can write
(36) |
where are Hermitian and act non-trivially at most on . If then acts trivially on . Using similar argument as case (a) we conclude is semi-separable. The case for is similar. So w.l.o.g, we assume that
(37) |
In the following, we are going to prove that either or is semi-separable, which will lead to a contradiction. W.l.o.g assume that both are unit vectors.
-
•
If for some : then by definition, keep invariant. Thus is separable.
-
•
If : then one can verify that both keeps invariant, since also keeps invariant. By definition we know is semi-separable.
-
•
If : notice that
(38) (39) Since , there exists s.t . By we have , thus
(40) -
•
Since , there exists such that . By Eq. (40) and we have
(41) -
•
Similarly to the above point, we have
(42) - •
In summary, we showed that
-
(i)
are Hermitian.
-
(ii)
commute with ,.
-
(iii)
.
To ease the notations, we abbreviate the induced algebra of Hermitian term on , i.e. , as . Intuitively the above say that , should commute with each other, and some elements are orthogonal to each other. We will show that this implies is semi-separable. In the following we write down a careful proof, especially because are operators which might act non-trivially on three qudits instead of only on .
Let be the computational basis for , for . Consider the decomposition of , we rewrite as
where are linearly independent. Since are linearly independent, we know are linearly independent. By lemma 10, is generated by . Define similar notations for , we will have is generated by .
Note that and are disjoint, the fact that implies the two sets , commute. Similarly, (ii) implies the generators of and commute, thus and commute. If we name the terms on as as in Fig.2. Let be the Hilbert space of , consider the decomposition induced by the induced algebra of on , i.e. . By Corollary 13 we know all , keeps the decomposition invariant. Thus all terms expect that keeps the decomposition invariant.
Furthermore, implies , . By Eq. (37) we assume that , thus . Consider Lemma 14, let , , we know the previous decomposition induced by is non-trivial.
Combining the implications of , we conclude is semi-separable, which leads to a contradiction. ∎
4.3 Schuch’s method and its extensions
Schuch [Sch11] proved that the qubit-CLHP-2D-projection is in NP. In this section, we illustrate that his idea can be generalized to prove that a subclass of qudit-CLHP-2D-projection is in NP, see Theorem 31. In the next section, i.e. Sec. 4.4, we will show that the qutrit-CLHP-2D-projection without semi-separable qudits falls into this subclass.
The proof for Theorem 31 is similar to [Sch11]. The main difference is that we generalize the definitions of removable qudits from Lemma 29 to Lemma 28. This generalization brings some subtlety so we write the proof in detail even though the proof proceeds in a similar way as [Sch11].
Definition 27 (Removable qudit)
For qudit-CLHP-2D-projection, consider a qudit and terms acting on it, as shown in Fig. 2. Denote as . Suppose there exists a decomposition such that both keep the decomposition invariant. Let be the projection onto . Similarly define the decomposition and for for . We say a qudit is removable if one of the following holds:
-
(i)
, at most one of acts non-trivially on , at most one of acts non-trivially on , and 101010The rank is w.r.t viewing as local operators in ..
-
(ii)
act trivially on . Besides, has a tensor-product structure as , such that , . Or similar conditions hold when exchanging the name of with .
We give some examples of removable qudits.
Lemma 28
For qudit-CLHP-2D-projection, for any qudit , if commute in -way on , commute in -way on where is a prime, . Then is removable.
Proof.
Denote . Let be the decomposition w.r.t to and -way. Let be the decomposition w.r.t to and -way. , are the projections onto . By Definition 15, the way of commuting is obtained by the Structure Lemma, by Corollary 13, we know has a tensor-product structure as , where
(46) | ||||
(47) |
Since is a prime, we know that at most one of acts non-trivially on . Similarly, since is a prime, at most one of acts non-trivially on . Furthermore, note that , . Thus . ∎
Lemma 29
For the qubit-CLHP-2D-projection, for any qubit , if one of or commute in -way on , then is removable.
Proof.
We name those qudits as removable since we will “remove” them in the proof of Theorem 31. Before proving Theorem 31, we summarize [Sch11]’s result as below. Although written in terms of qubit, [Sch11]’s proof directly works for the following lemma for qudits.
Lemma 30 (One-dimensional structure [Sch11])
Consider a qudit-CLHP-2D-projection Hamiltonian on qudits. Let be the set of qudits where , there exist and , such that both the induced algebra of on are the full algebra . Then for any quantum channels , the product has a one-dimensional structure thus can be computed in classical polynomial time.
Here means applying on , which can be interpreted as tracing out qudits in .
Theorem 31
Consider a qudit-CLHP-2D-projection instance, if for each qudit , either (a) is removable, or (b) there exists and such that both the induced algebra of on are the full algebra , then the corresponding qudit-CLHP-2D-projection instance is in NP.
Proof.
The proof follows the idea in [Sch11]. The main difference is that we generalize the definitions of removable qudits from Lemma 29 to Lemma 28. This generalization brings some subtlety so we write the proof in detail even though the proof proceeds in a similar way as Schuch’s.
Imagine the 2D grid as a chess board and color the plaquettes as black and white. Denote the set of the black plaquettes as , the white plaquettes as . Use same notations as Definition 27, for any removable qudit , w.l.o.g assume that are black, are white. If satisfies Definition 27 (i), one can notice that
(48) | |||
(49) | |||
(50) |
Note that by definition of removable qudit (i), at most one of acts non-trivially on , w.o.l.g assume that it is . This means is tensor some operator. Formally,
(51) | ||||
(52) |
Similarly, we assume that acts non-trivially on . We have
(53) | |||
(54) | |||
(55) |
Note that for any . Further, by definition of (i), there exist un-normalized vectors on such that . Then:
(56) | |||
(57) |
Recall that are commuting projections. In summary, the above calculations show two things:
- •
- •
- •
If satisfies Definition 27 (ii), we can also “tracing out ”. Denote as the dimension of . Interpret as two qudits w.r.t , we have
(58) | |||
(59) |
Eqs. (48)-(59) illustrate how to project out a single removable qudit. Similarly, when calculating we can project out all the removable qudits. Specifically, we first perform Eq. (48)-Eq. (50) simultaneously for all removable qudits, and then perform Eq. (53)-(59) to project out all removable qudits. It is worth noting that we should be careful about the relative orders of each — To perform the calculations in Eq. (48)-Eq. (50), one requires that for each , terms are put in the left, and in the right.111111If we begin with the above method doesn’t work since this quantity might be negative. To perform such decomposition for all removable qudits simultaneously, it suffices to put all the black terms on the left and all the white terms on the right. Denote the set of removable qudits as , we have
(60) | ||||
(61) |
Then for each removable qudit , we perform similar operations as Eq. (53)-(59) to project out .
Finally for the quantity in Eq. (61), we project out all removable qudits for every . All the remaining qudits originally correspond to type (b) in the Theorem description. By Lemma 30 we know the quantity in Eq. (61) can be computed in polynomial time.
In summary, proving is equivalent to proving that one of the quantity in Eq. (61) is , where the quantity is tracing a product which has a one-dimensional structure, thus can be computed in classical polynomial time. Thus we conclude the qudit-CLHP-2D-projection which satisfies Theorem 31’s conditions is in NP. ∎
4.4 Qutrit-CLHP-2D is in NP
Finally, to prove that the qutrit-CLHP-2D is in NP, it suffices to notice that the qutrit-CLHP-2D-projection without semi-separable qudit satisfying conditions in Theorem 31.
Lemma 32
For any qutrit-CLHP-2D-projection instance without semi-separable qudit, every qudit satisfies one of the two conditions in Theorem 31.
Proof.
Consider any qudit . If , it is removable due to Definition 27 (i). W.l.o.g. assume . If act trivially on , since is not semi-separable, we know must commute via -way or -way. Furthermore, by the Structure Lemma, i.e. Corollary 13, we know there is a tensor product structure of such that , , thus is removable due to Definition 27 (ii). A similar argument works when act trivially on . Thus w.l.o.g, we assume that at least one of , and one of act non-trivially on . Then
- •
- •
∎
Corollary 33
The qutrit-CLHP-2D problem is in NP.
5 Factorized commuting local Hamiltonian on 2D
In this section, we give a constructive proof to show that qudit-CLHP-2D-factorized is in NP, by proving that qudit-CLHP-2D-factorized is equivalent to a direct sum of qubit stabilizer Hamiltonian (see Theorem 46). Note that in this section we do not assume that are projections. The reason for this is that if we start with an arbitrary qudit-CLHP-2D-factorized Hamiltonian, such as the Toric code, and replace each term with a projection that preserve the kernel (as in Lemma 48), then the new Hamiltonian is not guaranteed to be a factorized projection. For example, if we take a Toric code term such as and replace with , the resulting term is no longer factorized. By contrast, for the qutrit-CLHP-2D, where we do not require that the terms be factorized, the assumption that the terms are projections does not weaken the results due to Corollary 49.
The structure of this section is as follows. In Sec. 5.1 we give notations and definitions. In Sec. 5.2 we prove that if there are no separable qudits, then the Hamiltonian is equivalent to a direct sum of qubit stabilizer Hamiltonian. Finally in Sec. 5.3 we prove Theorem 46.
5.1 Notations, definitions and lemmas
Notation. Let be a Hermitian operator on Hilbert space . Let be a subspace of and suppose keeps invariant. We define and . For two orthogonal subspaces , their direct sum are defined as . For two Hermitian operators , we write if either or . We say an -qudit Hermitian term is factorized if where is Hermitian, . When a factorized Hermitian , we always rewrite to be tensor of zeros, i.e. .
We say a Hilbert space is equivalent to -qubit space, denoted as , if there exists tensor-product structure where . When considering Hilbert space we define Pauli groups as the group of operators generated by , with respect the basis which makes factorized as . We denote elements in the Pauli group as Pauli operators. First, we formally define what it means for a Hamiltonian to be equivalent to a qubit stabilizer Hamiltonian or a direct sum of qubit stabilizer Hamiltonians.
Definition 34 (Equivalence to qubit stabilizer Hamiltonian)
Consider a commuting (but not necessarily local) Hamiltonian acting on space . We say is equivalent to a qubit stabilizer Hamiltonian on , if (1) For all , for some integer . (2) Each acts as a Pauli operator up to phases on , with respect to the basis which makes .
In the above definition, we allow , where , and all acts as up to phases on .
Definition 35 (Simple subspace)
Consider an n-qudit space . We say a subspace of is simple, if is a tensor product of subspace of each qudit, i.e. where is a subspace of .
Definition 36 (Equivalence to direct sum of qubit stabilizer Hamiltonian)
Given a commuting Hamiltonian acting on space . We say is equivalent to a direct sum of qubit stabilizer Hamiltonians, if there exists a set of simple subspace such that (1) are pairwise orthogonal, and ; (2) , keeps invariant, keeps invariant, and is equivalent to qubit stabilizer Hamiltonian when restricted to
Remark 37 (Terminology of “Equivalent to qubit stabilizer state” used in Theorem 2)
Use notations in Definition 36, if an -qudit Hamiltonian is equivalent to a direct sum of qubit stabilizer Hamiltonians, there exists a simple subspace which contains a ground state of , denoted as . Since is equivalent to qubit stabilizer Hamiltonian on , we know can be chosen to be a qubit stabilizer state w.r.t to the basis which makes in Definition 34. In this sense we say has a ground state which is equivalent to qubit stabilizer state. The notion of “equivalent to qubit stabilizer state” is only used for intuitively explaining how we prove that qudit-CLHP-2D-factorized is in NP in Theorem 2. To avoid ambiguity, we will not use this notion further in the following context.
We now give the definitions and lemmas for commuting in a singular/regular way. For technical reasons, our definition is slightly different from [BV03]121212[BV03] defines the case where and as commuting in a singular way. We define this case as commuting in a regular way..
Definition 38
[Singular/regular way] Consider two factorized Hermitian terms acting on qudits, with .
-
•
We say commute in a regular way, if , .
-
•
We say commute in a singular way if there qudit , .
Recall that when , we always rewrite to be tensor of zeros. Thus if commute in a singular way, then . We say a set of factorized Hermitian terms commute in a regular way if , the commute in a regular way. In the following, we introduce a lemma which states how factorized terms can commute with each other.
Lemma 39 (Rephrase of Lemma 9 in [BV03])
Consider two factorized Hermitian terms acting on qudits, with . If they only share one qudit , then . If they share two qudits , then one of the following holds: (1) . In this case and . (2) . In this case one of , or equals to 0.
Corollary 40
Consider two factorized Hermitian terms acting on qudits, with . If share two qudits , and commute in a singular way, then one of , or equals to 0. For the other one qudit, denoted as , we have .
We also prove some useful lemmas.
Lemma 41
Consider two Hermitian terms acting on a Hilbert space . If for some , then keeps invariant.
Proof.
It suffices to notice that , we have . This implies that . ∎
Lemma 42
Consider a qudit and Hermitian terms and acting on . Suppose that , , and furthermore there exists such that , and Then is separable with respect to .
Proof.
Define . Since both are non-zero and , we know and This implies the decomposition is non-trivial. By lemma 41, we know that all operators in keep invariant. Since they are Hermitian, they also keep invariant. Thus is separable. ∎
5.2 A weaker version without separable qudits
In this section we prove in Theorem 45 that if there are no separable qudits, then qudit-CLHP-2D-factorized is equivalent to qubit stabilizer Hamiltonian. In particular, we prove that in this situation, all the terms must commute in a regular way.
Lemma 43
Consider qudit-CLHP-2D-factorized Hamiltonian acting on qudits. If there are no separable qudits, then all the terms commute in a regular way. Moreover, for any qudit and any term acting on , as shown in Fig. 3 (a), we have (1) for some constant . (2) . (3) The -algebra generated by is the whole algebra .
Proof.
We first define some notations to help the illustration. To match the notations in Definition 34, we denote the Hilbert space of qudit as , the -qudit space as . As shown in Fig. 3 (a), Consider a qudit , we denote the terms acting on as . Recall that all the terms are factorized, thus we can use to represent the factor of on . Use similar notations for other terms. For any two terms , we use symbols to represent the relationship between .
-
•
“”: If , and commute in a regular way.
-
•
“”: If , and commute in a singular way.
-
•
“”: If , and commute in a singular way.
Using the above symbols, we will draw a graph to represent the relationship of on qudit . For example, the graph in Fig. 3 (f) means: The relationship between and is “”. That is , and commute in a regular way. Similar for and . The relationship between and is “”. That is , commute in a singular way. Similar for and . The relationship for is “”. That is , and commute in a singular way. Similar for and . We use to represent the number of in the graph for , and similar for symbol “”. For example, in Fig. 3 (f), we have
For each , we draw such a graph and assign to each pair . For in the boundary131313Here we mean the physical boundary of the lattice, not the (virtual) boundary defined in [AKV18]. of the lattice, some terms might be missing. We draw the graph for the existing terms similarly. We use to represent the total number of when considering all qudits, that is . Similarly for . Note that by Corollary 40, we have . Now we are prepared to prove Lemma 43. We first prove:
Claim 1: There is no qudit such that two of the terms acting on , i.e. two of in Fig. 3(a), can commute in a singular way. With contraction suppose there are such qudits, then . Then there must be a qudit such that of . We will prove that is separable thus leading to a contradiction. Here we suppose is in not on the boundary, thus there are four terms acting on . The case where is on the boundary and some terms are missing can be analyzed similarly.
Note that we always have since only shares one qudit. Similar for and . One can check that up to rotating the lattice, the relationships of terms on must be related to one of the graphs in Fig. 3 (b-f). Please read the captions of Fig. 3 for a precise description of the classification. Note that if two terms on satisfies , by definition of commuting in a singular way, we have , thus .
For Fig. 3 (b-e), let , . By Lemma 42, we know is separable. For Fig. 3 (f), let to be the -algebra generated by , to be the -algebra generated by . By Lemma 14 we know is separable.
Claim 2: The conditions (1)(2)(3) in Lemma 43 hold. Consider arbitrary qudit , let be the -algebra generated by . Since is not separable, by lemma 11, we know the the center of , i.e., must be trivial. Besides, lemma 11 also implies , . Since is not separable, we must further have is of dimension , thus (condition (3)). Otherwise is again separable by considering where is a basis of .
Since Claim 1 is true, all terms are commuting in a regular way. This means all factors are either anti-commuting or commuting (condition (2)), thus term , commute with every factor, i.e. . Since we already argued that must be trivial, we have for some constant (condition (1)). ∎
[BV03] showed that for qudit-factorized-CHP141414Recall that CHP represents commuting Hamiltonian problem where the Hamiltonian might not be local., if all terms commute in a regular way, then one can transform the Hamiltonian into a qubit stabilizer Hamiltonian. Especially, they proved the following lemma.
Lemma 44 (Lemma 12 of [BV03])
Let be a Hilbert space, be Hermitian operators such that
and such that the algebra generated by coincides with . Then there exists an integer , a tensor product structure and a unitary operator such that is a tensor of Pauli operators and the identity (up to sign) for all . Here may be equal to .
Finally, we are prepared to prove the main theorem in this section.
Theorem 45
Consider a qudit-CLHP-2D-factorized Hamiltonian on -qudit space. If there are no separable qudits, then is equivalent to qubit stabilizer Hamiltonian on .
Proof.
To match the notations in Definition 34, we denote the Hilbert space of qudit as , the -qudit space as . Consider a qudit-CLHP-2D-factorized . W.o.l.g assume that all are non-zero. Note that since is Hermitian, if , then . Consider arbitrary qudit , use notations in Lemma 43 we know . For every , define be a normalized version of , that is where . For any qudit , view as . By Lemma 43, one can check that satisfies the condition of Lemma 44. Thus by choosing appropriate basis of each qudit, will have a factorized structure as for integer , and are tensor of Pauli operators up to sign. Thus acts as a Pauli operator on this basis, up to phases. Thus is equivalent to qubit stabilizer Hamiltonian by definition.
∎
5.3 The full version
Finally, we remove the constraints of no separable qudits in Theorem 45 and prove the following.
Theorem 46
Any qudit-CLHP-2D-factorized Hamiltonian is equivalent to a direct sum of qubit stabilizer Hamiltonian.
Proof.
Denote the space that acting on as . Recall that if a qudit is separable with respect to decomposition , for any chosen index we can restrict all terms on this subspace, and get a new instance of qudit-CLHP-2D-factorized. If we repetitively perform this restriction whenever this is a separable qudit, after polytime we will reach the case with no separable qudits.
To prove theorem 46, it suffices to imagine the restricting process as a decision tree. Specifically, we write down a root node and define the space of the root node as , and repeat the following process: Transverse all the leaf nodes. Denote the leaf node considered currently as , and its space as . If restricting on has separable qudits, choose an arbitrary such separable qudit. Denote this qudit as and the corresponding decomposition as . For every , we build a child node to , and define the space of as restricting to in . We repeat this process until for every leaf node, there are no separable qudits. In the final tree, every leaf node corresponds to a simple subspace . By the definition of the tree, we know are orthogonal to each other and . By Theorem 45, is equivalent to qubit stabilizer Hamiltonian on . Thus we prove that is equivalent to a direct sum of qubit stabilizer Hamiltonian. ∎
Corollary 47
Qudit-CLHP-2D-factorized is in NP.
Proof.
Consider a qudit-CLHP-2D-factorized problem with Hamiltonian and parameters . By Theorem 46 we know there exists a , where is a simple subspace, such that there is a ground state lies in , and is equivalent to qubit stabilizer Hamiltonian on . The NP prover is supposed to provide the subspace , and provide the qudit unitary in Theorem 44 for each . Using that information, the verifier firstly checks that all terms keep the subspaces invariant. Then the verifier uses polynomial time to transform to be tensor of qubit space, i.e., and transform on to be a summation of Pauli operators up to phases, denoted as . Here is a Pauli operator.
Then the verifier is going to verify . Since are commuting, there is a ground state which is the common eigenstate of every , denote the corresponding eigenvalue as . The prover is supposed to provide such . The verifier verifies that , and verifies there is a state which is the common 1-eigenstate of commuting Pauli operators . The common 1-eigenstate verification can be done in polynomial time by standard stabilizer formalism. Note that although we describe the prover in an interactive way, he can in fact send all the witnesses at the same time. ∎
Appendix A Acknowledgement
Thanks Thomas Vidick and Daniel Ranard for helpful discussion.
Appendix B Relationship between general case and projection case
Lemma 48
If qudit-CLHP-2D-projection is in NP, then qudit-CLHP-2D is in NP.
Proof.
Consider a qudit-CLHP-2D, where , and . Denote the ground energy . Since are commuting with each other, there exists a ground state and such that , and . Let be the projection onto the -eigenspace of . Let , . Since are commuting, we know that are also commuting.
The NP prover is supposed to list such , then the verifier can check and compute and . Then the prover is supposed to prove qudit-CLHP-2D-projection is a Yes instance — that is proving there exists such that . Thus if qudit-CLHP-2D-projection is in NP, then qudit-CLHP-2D is in NP. ∎
Corollary 49
If the qutrit-CLHP-2D-projection is in NP, then the qutrit-CLHP-2D is in NP.
Appendix C Qudits on the vertexs or on the edges
In this manuscript, we consider commuting local Hamiltonian on a 2D square lattice, where qudits are on the vertices and Hermitian terms are on the plaquettes. There is another setting that put qudits on the edges, and Hermitian terms on ”plaquettes” and ”stars”. Specifically, as shown in Fig. 4 for each plaquette , there is a Hermitian term acting on the qudits on its edges, i.e. . For each vertex , consider the star consisting of and edges adjacent to , there is a Hermitian term acting on qudits on its edges, i.e. . The Hamiltonian is . We abbreviate this setting as “qudits on 2D edges” and the setting in Sec. 2 as “qudits on 2D vertices”. In the following we will show that the two settings are equivalent.
(1) “qudits on 2D edges” “qudits on 2D vertices”. Begin from “qudits on 2D edges”, as shown in Fig. 5, the qudits on the edges can in fact be viewed as qudits on the vertices of another 2D square lattice defined by the dash lines. The terms and will correspond to plaquette terms in the dashed lattice. Thus our techniques directly apply to the setting for qudits on the edges.
(1) “qudits on 2D vertices” “qudits on 2D edges”. Begin from “qudits on 2D vertices”, as shown in Fig. 6, the qudits on the vertices can in fact be viewed as qudits on the edges of another 2D square lattice defined by the dash lines. The plaquette terms will correspond to plaquette and star terms in the dashed lattice.
References
- [AAG22] Anurag Anshu, Itai Arad, and David Gosset. An area law for 2d frustration-free spin systems. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. ACM, jun 2022.
- [ABN22] Anurag Anshu, Nikolas Breuckmann, and Chinmay Nirkhe. Nlts hamiltonians from good quantum codes. arXiv preprint arXiv:2206.13228, 2022.
- [AE11a] Dorit Aharonov and Lior Eldar. On the complexity of commuting local hamiltonians, and tight conditions for topological order in such systems. In 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pages 334–343, 2011.
- [AE11b] Dorit Aharonov and Lior Eldar. On the complexity of commuting local hamiltonians, and tight conditions for topological order in such systems. In 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pages 334–343. IEEE, 2011.
- [AE13] Dorit Aharonov and Lior Eldar. The commuting local hamiltonian on locally-expanding graphs is in np. arXiv preprint arXiv:1311.7378, 2013.
- [AKV18] Dorit Aharonov, Oded Kenneth, and Itamar Vigdorovich. On the complexity of two dimensional commuting local hamiltonians. arXiv preprint arXiv:1803.02213, 2018.
- [BCG+23] Ivan Bardet, Ángela Capel, Li Gao, Angelo Lucia, David Pérez-García, and Cambyse Rouzé. Rapid thermalization of spin chain commuting hamiltonians. Physical Review Letters, 130(6):060401, 2023.
- [BV03] Sergey Bravyi and Mikhail Vyalyi. Commutative version of the k-local hamiltonian problem and common eigenspace problem. arXiv preprint quant-ph/0308021, 2003.
- [CRF20] Ángela Capel, Cambyse Rouzé, and Daniel Stilck França. The modified logarithmic sobolev inequality for quantum spin systems: classical and commuting nearest neighbour interactions. arXiv preprint arXiv:2009.11817, 2020.
- [FS97] Gerald B Folland and Alladi Sitaram. The uncertainty principle: a mathematical survey. Journal of Fourier analysis and applications, 3:207–238, 1997.
- [GHL+15] Sevag Gharibian, Yichen Huang, Zeph Landau, Seung Woo Shin, et al. Quantum hamiltonian complexity. Foundations and Trends® in Theoretical Computer Science, 10(3):159–282, 2015.
- [GMV17] David Gosset, Jenish C Mehta, and Thomas Vidick. Qcma hardness of ground space connectivity for commuting hamiltonians. Quantum, 1:16, 2017.
- [Got97] Daniel Gottesman. Stabilizer codes and quantum error correction. California Institute of Technology, 1997.
- [Has12a] Matthew B Hastings. Matrix product operators and central elements: Classical description of a quantum state. Geometry & Topology Monographs, 18(115-160):276, 2012.
- [Has12b] Matthew B Hastings. Trivial low energy states for commuting hamiltonians, and the quantum pcp conjecture. arXiv preprint arXiv:1201.3387, 2012.
- [Has13] Matthew B. Hastings. Trivial low energy states for commuting hamiltonians, and the quantum pcp conjecture. Quantum Info. Comput., 13(5–6):393–429, may 2013.
- [KB16] Michael J Kastoryano and Fernando GSL Brandao. Quantum gibbs samplers: The commuting case. Communications in Mathematical Physics, 344:915–957, 2016.
- [Kit03a] A Yu Kitaev. Fault-tolerant quantum computation by anyons. Annals of physics, 303(1):2–30, 2003.
- [Kit03b] A.Yu. Kitaev. Fault-tolerant quantum computation by anyons. Annals of Physics, 303(1):2–30, jan 2003.
- [KKR06] Julia Kempe, Alexei Kitaev, and Oded Regev. The complexity of the local hamiltonian problem. Siam journal on computing, 35(5):1070–1097, 2006.
- [Sch11] Norbert Schuch. Complexity of commuting hamiltonians on a square lattice of qubits. arXiv preprint arXiv:1105.2843, 2011.
- [T+03] Masamichi Takesaki et al. Theory of operator algebras II, volume 125. Springer, 2003.