In computer science, a holographic algorithm is an algorithm that uses a holographic reduction. A holographic reduction is a constant-time reduction that maps solution fragments many-to-many such that the sum of the solution fragments remains unchanged. These concepts were introduced by Leslie Valiant, who called them holographic because "their effect can be viewed as that of producing interference patterns among the solution fragments".[1] The algorithms are unrelated to laser holography, except metaphorically. Their power comes from the mutual cancellation of many contributions to a sum, analogous to the interference patterns in a hologram.
Holographic algorithms have been used to find polynomial-time solutions to problems without such previously known solutions for special cases of satisfiability, vertex cover, and other graph problems. They have received notable coverage due to speculation that they are relevant to the P versus NP problem[2] and their impact on computational complexity theory. Although some of the general problems are
problems, the special cases solved are not themselves #P-hard, and thus do not prove FP = #P.
Holographic algorithms have some similarities with quantum computation, but are completely classical.[3]
Holographic algorithms exist in the context of Holant problems, which generalize counting constraint satisfaction problems (#CSP). A #CSP instance is a hypergraph G=(V,E) called the constraint graph. Each hyperedge represents a variable and each vertex
v
fv.
\sum\sigma
fv
v
A Holant problem is like a #CSP except the input must be a graph, not a hypergraph. Restricting the class of input graphs in this way is indeed a generalization. Given a #CSP instance, replace each hyperedge e of size s with a vertex v of degree s with edges incident to the vertices contained in e. The constraint on v is the equality function of arity s. This identifies all of the variables on the edges incident to v, which is the same effect as the single variable on the hyperedge e.
In the context of Holant problems, the expression in (1) is called the Holant after a related exponential sum introduced by Valiant.[4]
A standard technique in complexity theory is a many-one reduction, where an instance of one problem is reduced to an instance of another (hopefully simpler) problem.However, holographic reductions between two computational problems preserve the sum of solutions without necessarily preserving correspondences between solutions.[1] For instance, the total number of solutions in both sets can be preserved, even though individual problems do not have matching solutions. The sum can also be weighted, rather than simply counting the number of solutions, using linear basis vectors.[5]
It is convenient to consider holographic reductions on bipartite graphs. A general graph can always be transformed it into a bipartite graph while preserving the Holant value. This is done by replacing each edge in the graph by a path of length 2, which is also known as the 2-stretch of the graph. To keep the same Holant value, each new vertex is assigned the binary equality constraint.
Consider a bipartite graph G=(U,V,E) where the constraint assigned to every vertex
u\inU
fu
v\inV
fv
Holant(G,fu,fv).
fu
| ⊗ |U| | |
| f | |
| u |
.
| ⊗ |V| | |
| f | |
| v |
.
fu
fv
| ⊗ |U| | |
| f | |
| u |
| ⊗ |V| | |
| f | |
| v |
.
Now for any complex 2-by-2 invertible matrix T (the columns of which are the linear basis vectors mentioned above), there is a holographic reduction between
Holant(G,fu,fv)
Holant(G,fuT ⊗ ,(T-1) ⊗ fv).
T ⊗ (T-1) ⊗
| ⊗ |U| | |
| f | |
| u |
| ⊗ |V| | |
| f | |
| v |
| ⊗ |U| | |
| f | |
| u |
| ⊗ |V| | |
| f | |
| v |
=
| ⊗ |U| | |
| f | |
| u |
T ⊗ (T-1) ⊗
| ⊗ |V| | |
| f | |
| v |
=\left(fuT ⊗ \right) ⊗ \left(fv(T-1) ⊗ \right) ⊗ .
Holant(G,fu,fv)
Holant(G,fuT ⊗ ,(T-1) ⊗ fv)
Let G be a graph. There is a 1-to-1 correspondence between the vertex covers of G and the independent sets of G. For any set S of vertices of G, S is a vertex cover in G if and only if the complement of S is an independent set in G. Thus, the number of vertex covers in G is exactly the same as the number of independent sets in G.
The equivalence of these two counting problems can also be proved using a holographic reduction. For simplicity, let G be a 3-regular graph. The 2-stretch of G gives a bipartite graph H=(U,V,E), where U corresponds to the edges in G and V corresponds to the vertices in G. The Holant problem that naturally corresponds to counting the number of vertex covers in G is
Holant(H,OR2,EQUAL3).
(1,0,0,0,0,0,0,1)T=\begin{bmatrix}1\ 0\end{bmatrix} ⊗ +\begin{bmatrix}0\ 1\end{bmatrix} ⊗
\begin{bmatrix}0&1\ 1&0\end{bmatrix},
| ⊗ |U| | |
| OR | |
| 2 |
| ⊗ |V| | |
| EQUAL | |
| 3 |
=(0,1,1,1) ⊗ \left(\begin{bmatrix}1\ 0\end{bmatrix} ⊗ +\begin{bmatrix}0\ 1\end{bmatrix} ⊗ \right) ⊗
=(0,1,1,1) ⊗ \begin{bmatrix}0&1\ 1&0\end{bmatrix} ⊗ \begin{bmatrix}0&1\ 1&0\end{bmatrix} ⊗ \left(\begin{bmatrix}1\ 0\end{bmatrix} ⊗ +\begin{bmatrix}0\ 1\end{bmatrix} ⊗ \right) ⊗
=\left((0,1,1,1)\begin{bmatrix}0&1\ 1&0\end{bmatrix} ⊗ \right) ⊗ \left(\left(\begin{bmatrix}0&1\ 1&0\end{bmatrix}\begin{bmatrix}1\ 0\end{bmatrix}\right) ⊗ +\left(\begin{bmatrix}0&1\ 1&0\end{bmatrix}\begin{bmatrix}0\ 1\end{bmatrix}\right) ⊗ \right) ⊗
=(1,1,1,0) ⊗ \left(\begin{bmatrix}0\ 1\end{bmatrix} ⊗ +\begin{bmatrix}1\ 0\end{bmatrix} ⊗ \right) ⊗
=
| ⊗ |U| | |
| NAND | |
| 2 |
| ⊗ |V| | |
| EQUAL | |
| 3 |
,
Holant(H,NAND2,EQUAL3),
As with any type of reduction, a holographic reduction does not, by itself, yield a polynomial time algorithm. In order to get a polynomial time algorithm, the problem being reduced to must also have a polynomial time algorithm. Valiant's original application of holographic algorithms used a holographic reduction to a problem where every constraint is realizable by matchgates,[1] which he had just proved is tractable by a further reduction to counting the number of perfect matchings in a planar graph.[6] The latter problem is tractable by the FKT algorithm, which dates to the 1960s.
Soon after, Valiant found holographic algorithms with reductions to matchgates for #7Pl-Rtw-Mon-3CNF and #7Pl-3/2Bip-VC.[7] These problems may appear somewhat contrived, especially with respect to the modulus. Both problems were already known to be #P-hard when ignoring the modulus and Valiant supplied proofs of #P-hardness modulo 2, which also used holographic reductions. Valiant found these two problems by a computer search that looked for problems with holographic reductions to matchgates. He called their algorithms accidental algorithms, saying "when applying the term accidental to an algorithm we intend to point out that the algorithm arises from satisfying an apparently onerous set of constraints." The "onerous" set of constraints in question are polynomial equations that, if satisfied, imply the existence of a holographic reduction to matchgate realizable constraints.
After several years of developing (what is known as) matchgate signature theory, Jin-Yi Cai and Pinyan Lu were able to explain the existence of Valiant's two accidental algorithms.[5] These two problems are just special cases of two much larger families of problems: #2k-1Pl-Rtw-Mon-kCNF and #2k-1Pl-k/2Bip-VC for any positive integer k. The modulus 7 is just the third Mersenne number and Cai and Lu showed that these types of problems with parameter k can be solved in polynomial time exactly when the modulus is the kth Mersenne number by using holographic reductions to matchgates and the Chinese remainder theorem.
Around the same time, Jin-Yi Cai, Pinyan Lu and Mingji Xia gave the first holographic algorithm that did not reduce to a problem that is tractable by matchgates.[4] Instead, they reduced to a problem that is tractable by Fibonacci gates, which are symmetric constraints whose truth tables satisfy a recurrence relation similar to one that defines the Fibonacci numbers. They also used holographic reductions to prove that certain counting problems are #P-hard. Since then, holographic reductions have been used extensively as ingredients in both polynomial time algorithms and proofs of #P-hardness.