--- title: Permutation-Preserving Ansatz url: https://www.emergentmind.com/topics/permutation-preserving-problem-inspired-ansatz type: topic --- # Permutation-Preserving Ansatz Searching arXiv for the primary paper and closely related work on permutation-preserving ansätze. Permutation-preserving problem-inspired ansatz denotes a class of variational constructions in which the circuit architecture is tailored to permutation-structured feasible sets, so that the ansatz acts directly on valid permutations, tours, schedules, or closely related combinatorial objects rather than on a larger constrained space that must later be penalized. In the quantum-variational setting, the most explicit use of this phrase appears in QuPer, introduced for permutation-based combinatorial optimization such as quadratic assignment and graph isomorphism [2505.05981]. Closely related constructions arise in compactly encoded traveling-salesman solvers [2605.00739, 2508.21730], graph-controlled feasibility-preserving mixers for scheduling [2311.04100], and permutation-invariant circuit families exploiting symmetry reduction [2312.14909]. Across these works, the common design principle is that permutation structure is not treated as an afterthought: it determines the encoding, the elementary generators, the mixer or variational blocks, and often the post-processing map to the final discrete solution. ## 1. Concept and defining characteristics In QuPer, the optimization target is written as \[ \min_{P\in\Pi_n}\; f(P), \] where \(\Pi_n\) is the set of all \(n\times n\) permutation matrices and \(f:\Pi_n\to\mathbb R\) is an arbitrary cost [2505.05981]. The ansatz is problem-inspired because its circuit is derived from group-theoretical structure specific to permutations rather than from a generic hardware-efficient template. It is permutation-preserving in the sense that its elementary gates span a subgroup of permutation unitaries, and, with ancilla augmentation, generate convex combinations of such permutations represented as doubly-stochastic matrices before classical projection back to \(\Pi_n\) [2505.05981]. A related but stricter meaning of permutation-preserving appears in compact TSP formulations. In the Lehmer-factorial encoding of tours, every computational-basis state corresponds to exactly one valid tour, so “there is no need for additional penalty terms or one-hot constraints” [2508.21730]. In the resource-efficient TSP framework, the ansatz is built from controlled register-swaps acting on whole city registers; because these blocks “never produce invalid codes or duplicate-city configurations,” the evolution remains confined to the valid permutation subspace [2605.00739]. For scheduling-type problems, the same principle is implemented at the mixer level rather than in the encoding. Graph-controlled Permutation Mixers in CM-QAOA perform small permutations of assignment bits only when a Boolean feasibility predicate certifies that the move remains in the feasible set [2311.04100]. This preserves constraints by construction rather than by adding energetic penalties. These variants suggest a useful taxonomy. One branch preserves permutations by **exact encoding**, another by **feasibility-preserving dynamics**, and another by **symmetry-preserving parameter tying**. A plausible implication is that the phrase encompasses a family of techniques rather than a single circuit template. ## 2. Group-theoretical and encoding foundations QuPer starts from amplitude encoding with \(n=2^q\), where a \(q\)-qubit register in state \(\sum_{i=0}^{2^q-1}\alpha_i\ket i\) encodes an \(n\)-dimensional vector [2505.05981]. The relevant gate-generated group is \[ LX_q=\langle X_q\cup CX_q\rangle, \] with \[ X_q\cong\mathbb Z_2^q,\qquad CX_q\cong GL_q(\mathbb F_2), \] and every \(U\in LX_q\) uniquely factorized as \[ U=U_XU_{CX},\quad U_X\in X_q,\;U_{CX}\in CX_q. \] The paper then invokes the Bruhat factorization \[ GL_q(\F_2)=BWB, \] where \(B\) is the Borel subgroup of invertible upper-triangular matrices and \(W\cong S_q\) is the Weyl subgroup of permutation matrices [2505.05981]. This decomposition directly induces the three-block circuit structure of the ansatz. In the TSP compact-encoding literature, the foundation is different but analogous. The Lehmer-factorial map sends a tour \(\pi\in S_n\) to an integer \[ P(\pi)=\sum_{k=1}^n \ell_k\cdot (n-k)!, \] represented on \[ m=\lceil\log_2(n!)\rceil = \sum_{k=1}^n \lceil\log_2 k\rceil = O(n\log n) \] qubits [2508.21730]. Since each basis state decodes to a unique tour, the encoding itself implements the combinatorial admissibility condition. The resource-efficient TSP framework instead fixes one city and stores the remaining \(M=n-1\) tour positions in \(k=\lceil\log_2 M\rceil\)-qubit registers: \[ |\pi\rangle = |a_0\rangle\otimes|a_1\rangle\otimes\cdots\otimes|a_{M-1}\rangle. \] Adjacent transpositions are realized by register-swap unitaries \(T_{i,i+1}\), which act as generators of \(S_M\) on valid codes [2605.00739]. Here, the group action is explicit at the circuit level. For permutation-invariant quantum circuits, the symmetric group \(S_n\) is identified with SWAPs on \(n\) qubits, and the associated Lie-algebra generators \(P_{ij}\) yield continuous families \[ U_{ij}(\theta)=e^{\,i\,\theta\,P_{ij}}. \] The parameter count of the fully permutation-invariant subalgebra scales as \[ \dim\bigl(\pi\mathfrak{su}(2^n)\bigr)=\binom{n+3}{3}-1=\mathcal O(n^3), \] which quantifies symmetry-induced reduction in variational degrees of freedom [2312.14909]. ## 3. Canonical circuit constructions The clearest canonical form is the QuPer system ansatz \[ \mathscr P_{\rm sys}(\theta) \;=\; \mathscr C_X(\theta_X)\;\Bigl[B(\theta_B)\;W(\theta_W)\;B(\theta'_B)\Bigr], \] where the \(X\)-block is built from parallel single-qubit \(\mathtt{Rx}\) gates, the \(B\)-blocks from parametrized \(\mathtt{CX}_{j,k}(\phi)\) gates corresponding to upper-triangular transvections, and the \(W\)-block from parametrized adjacent \(\mathtt{SWAP}(\phi)\) gates implementing simple reflections [2505.05981]. The resulting circuit has depth \(O(q)\) and parameter count \[ \ell=q+3\binom q2=O(q^2), \] and spans exactly \[ |LX_q| =2^q\prod_{k=0}^{q-1}(2^q-2^k) =2^{O(q^2)}\ll n! \] permutation unitaries without ancillas [2505.05981]. The same work augments this base circuit with \(m\) ancilla qubits. After Hadamards on the ancillas, ancilla-controlled applications of \(\mathscr P_{\rm sys}\), and uncomputation, the output matrix becomes \[ \hat P = \sum_{r=1}^R \lambda_r^2\,[P_r],\qquad R\le\min\{2^{2m},\,|LX_q|\}, \] so the ansatz represents a convex combination of base permutations rather than a single one [2505.05981]. This is the “quantum boost” mechanism that enlarges the reachable region of the permutation polytope. In the resource-efficient TSP formulation, a single adjacent-link variational block is \[ U_{\rm swap}^{(i,i+1)}(\theta) = R_y^{(\rm aux)}(2\theta)\;\cdot\; S_{i,i+1}^{(\rm aux)}\;\cdot\; R_y^{(\rm aux)}(-2\theta), \] with \(S_{i,i+1}^{(\rm aux)}\) the ancilla-controlled swap of all \(k\) qubits in two neighboring registers [2605.00739]. A layer applies these blocks in ascending order: \[ U_{\rm layer}\bigl(\boldsymbol\theta^{(\ell)}\bigr) = \prod_{i=0}^{M-2} U_{\rm swap}^{(i,i+1)}\bigl(\theta_{\ell,i}\bigr), \] and the full ansatz of depth \(L\) is \[ |\Psi(\boldsymbol\theta)\rangle = \Bigl[\prod_{\ell=1}^L U_{\rm layer}\bigl(\boldsymbol\theta^{(\ell)}\bigr)\Bigr] \bigl(|0\rangle_{\rm aux}\otimes|\pi_0\rangle\bigr), \] with \(N_{\rm param}=L(M-1)=L(n-2)\) parameters [2605.00739]. In “Freeze and Conquer,” the ansatz is not derived from explicit group decompositions but from a discrete search over 675 topologies of the form \[ (P_1,E_2,P_3,E_4,P_5), \] with rotation axes \(P_i\in\{x,y,z\}\) and entanglement patterns \(E_j\in\{\text{linear, rev-lin, full, circ, SCA}\}\), under the alternating \(R\)–\(E\)–\(R\)–\(E\)–\(R\) constraint [2508.21730]. The fixed five-block circuit \[ \mathcal A(\Theta) = U_R^{(5)}(\Theta^{(5)})\cdot U_E^{(4)}\cdot U_R^{(3)}(\Theta^{(3)})\cdot U_E^{(2)}\cdot U_R^{(1)}(\Theta^{(1)}) \] is applied directly to the compact permutation encoding, so the gates “preserve the permutation encoding automatically” [2508.21730]. ## 4. Feasibility preservation, invariance, and expressivity The central technical question is whether the ansatz preserves the feasible combinatorial subspace and whether it can adequately traverse that subspace. For graph-controlled permutation mixers, feasibility is formalized with a constraint graph \(G=(V,E)\) whose edges encode assignment-clash, precedence-clash, and machine-clash relations in the flexible job-shop problem [2311.04100]. A permutation \(\pi\in S_N\) is allowed on a bit string \(x\) only when the Boolean predicate \[ \chi_\pi(x)=\bigwedge_{j=1}^N \chi_\pi^j(x) \] holds, with \[ \chi_\pi^j(x)=\neg x_j\;\vee\;\bigwedge_{\ell\in nbhd(\pi(j))}\neg x_{\pi^{-1}(\ell)}. \] The controlled mixer \[ B_\pi(\beta)\coloneqq \Lambda_{\chi_\pi}\bigl[|0\rangle\langle0|_c\otimes I+|1\rangle\langle1|_c\otimes U_\pi(\beta)\bigr] \] moves amplitude from \(|x\rangle\) to \(|\pi(x)\rangle\) only when \(\pi(x)\in F\), and Theorem 4.1 shows that the full CM-QAOA state remains inside the feasible subspace \(\mathcal F\) at every step [2311.04100]. Theorem 4.2 then establishes connectivity by showing that any two feasible schedules can be linked by a sequence of allowed transpositions. In the resource-efficient TSP ansatz, feasibility is preserved more simply. Because the building blocks are controlled swaps of whole registers containing valid city codes, they “never produce invalid codes or duplicate-city configurations” and therefore keep the state within the valid permutation subspace [2605.00739]. The state can be expanded as \[ |\Psi(\boldsymbol\theta)\rangle = \sum_{\pi\in S_M}\sum_{\alpha=0}^1 c_{\pi,\alpha}(\boldsymbol\theta)\,|\alpha\rangle_{\rm aux}\otimes|\pi\rangle, \] with marginal tour probabilities \[ P(\pi;\boldsymbol\theta)=\sum_{\alpha\in\{0,1\}} \left| \langle \alpha|_{\rm aux}\langle\pi|\Psi(\boldsymbol\theta)\rangle \right|^2. \] This is exact feasible-subspace evolution rather than approximate penalty suppression [2605.00739]. Permutation-invariant circuits address a different property: invariance under relabeling. The invariance condition \[ S_{kl}\,\mathcal U(\vec\theta)\,S_{kl}=\mathcal U(\vec\theta)\qquad \forall\,(k,l) \] is enforced by symmetrizing parameters over orbits of \(S_n\), for example through blocks such as \[ U^{(1)}(\alpha)=e^{\,i\alpha\sum_i Z_i},\qquad U^{(2)}(\beta)=\exp\!\bigl[i\beta\sum_{i