Papers
Topics
Authors
Recent
Search
2000 character limit reached

Strongly Entangling Layer (SEL)

Updated 31 May 2026
  • SEL is a quantum circuit subroutine that maximizes entanglement by using specialized two-qudit gates to achieve the largest entropy increase.
  • Its design leverages rigorous criteria like Cohen’s theorem and group expansion to ensure a maximally entangling capacity across bipartitions.
  • Practical SEL implementation balances optimal entanglement generation with hardware constraints, including connectivity, ancilla allocation, and noise tradeoffs.

A Strongly Entangling Layer (SEL) is a quantum circuit subroutine whose purpose is to maximize the entangling capacity across designated bipartitions of a multi-qudit register. SELs are constructed from two-qudit gates that are themselves maximally entangling: they achieve the largest possible increase in entropy of entanglement when applied to appropriately chosen product–ancilla inputs. The structure of SELs, their mathematical criteria, and their implementation tradeoffs form a foundation for maximizing entanglement generation in quantum computation and quantum information processing (Cohen, 2011).

1. Maximally Entangling Unitaries and Entangling Capacity

Let U:HA⊗HB→HA⊗HBU:\mathcal{H}_A\otimes\mathcal{H}_B \to \mathcal{H}_A\otimes\mathcal{H}_B be a bipartite unitary operator, where Alice and Bob each control systems AA (dimension dAd_A) and BB (dimension dB≥dAd_B\ge d_A) respectively. Ancillary systems aa (Alice) and bb (Bob) of dimensions dad_a and dbd_b may be appended, with da=dAd_a=d_A, db=dBd_b=d_B providing optimality.

The entangling capacity of UU is defined as

E(U)=sup⁡∣Vin⟩[E(∣Vout⟩)−E(∣Vin⟩)],E(U) = \sup_{|V_{\rm in}\rangle}\left[E(|V_{\rm out}\rangle)-E(|V_{\rm in}\rangle)\right],

where ∣Vout⟩=(Ia⊗Ib⊗U)∣Vin⟩|V_{\rm out}\rangle=(I_a\otimes I_b\otimes U)|V_{\rm in}\rangle, and E(∣Ψ⟩)E(|\Psi\rangle) is the entropy of entanglement across the (Aa)∣(Bb)(Aa)\mid (Bb) partition.

The maximal entangling capacity is known to satisfy E(U)≤2log⁡dAE(U)\le 2\log d_A, achievable if and only if UU is maximally entangling. For maximally entangling UU, a canonical input achieving E(U)E(U) is ∣Φ+⟩Aa⊗∣ξ⟩Bb|\Phi^+\rangle_{Aa}\otimes|\xi\rangle_{Bb}, where ∣Φ+⟩Aa=1dA∑k=0dA−1∣k⟩A∣k⟩a|\Phi^+\rangle_{Aa}=\frac{1}{\sqrt{d_A}}\sum_{k=0}^{d_A-1}|k\rangle_{A}|k\rangle_{a}.

2. Cohen's Theorem: Characterization by Group Expansion

Cohen (2011) provides a necessary and sufficient condition for a bipartite unitary UU to be maximally entangling:

Let GG be any finite group of order ∣G∣=dA2|G|=d_A^2 with an irreducible (possibly projective) representation {T(f)}f∈G\{T(f)\}_{f\in G} on HA\mathcal{H}_A. Any unitary UU can be expanded as

U=∑f∈GT(f)⊗W(f),U = \sum_{f\in G} T(f) \otimes W(f),

where T(f)T(f) may be chosen as generalized Pauli operators T(m,n)=ωmnXmZnT(m,n)=\omega^{mn}X^mZ^n with ω=e2πi/dA\omega = e^{2\pi i/d_A}.

Theorem 1: UU is maximally entangling if and only if there exists a positive semi-definite operator MM on HB\mathcal{H}_B such that, for all f,g∈Gf, g \in G,

$\Tr[ W(f) M M^\dagger W(g)^\dagger ] = \frac{1}{d_A^2} \delta_{f,g}.$

The optimal ancilla input state on BbBb is the purification of MM†M M^\dagger.

Equivalently, in the operator Schmidt decomposition, UU must have Schmidt rank dA2d_A^2, and the Schmidt coefficients λα\lambda_\alpha must all be 1/dA21/d_A^2: U=∑α=1dA2λαAα⊗Bα,λα=1/dA2.U=\sum_{\alpha=1}^{d_A^2} \sqrt{\lambda_\alpha} A_\alpha\otimes B_\alpha, \quad \lambda_\alpha=1/d_A^2.

3. Practical Verification of Maximally Entangling Gates

The process to verify if a given two-qudit gate UU is maximally entangling is as follows:

  1. Expand UU in the generalized Pauli basis on AA:

$W(m,n)=\frac{1}{d_A}\Tr_A[(X^m Z^n)^\dagger\otimes I_B\, U],$

for each (m,n)∈ZdA×ZdA(m,n)\in \mathbb{Z}_{d_A}\times\mathbb{Z}_{d_A}.

  1. Compute the Gram matrix $G_{(f,g)}=\Tr[ W(f)M M^\dagger W(g)^\dagger ]$ for some positive MM. Search for MM such that G(f,g)=(1/dA2)δf,gG_{(f,g)}=(1/d_A^2)\delta_{f,g}.
  2. Concretely, stack the matrix elements of W(g)W(f)W(g)W(f) and determine the null space for f≠gf\neq g; any positive MM†M M^\dagger normalizing the diagonal to 1/dA21/d_A^2 attests to maximal entangling power.

If no such MM can be found, UU is not maximally entangling.

4. Construction and Graph-Theoretic Properties of SELs

A Strongly Entangling Layer on NN qudits is defined as a parallel layer of two-qudit maximally entangling gates {Uij}\{U_{ij}\} such that for every target bipartition (S,Sˉ)(S,\bar S) of the register, the composite operator

Ulayer=⨂(i,j)∈EUijU_{\rm layer} = \bigotimes_{(i,j)\in E} U_{ij}

is itself maximally entangling across the (S,Sˉ)(S,\bar S) cut. Here, G=(V,E)G=(V,E) is the interaction graph imposed by hardware connectivity.

Guidelines for constructing SELs:

  • The graph GG must connect every bipartition; that is, every cut SS must be crossed by at least one edge (i,j)(i,j), requiring GG to be an expander.
  • On each edge, choose UijU_{ij} from the class of maximally entangling gates for di×djd_i\times d_j.
  • The global entanglement achievable across any bipartition is up to min⁡{∑i∈Slog⁡di,∑j∈Sˉlog⁡dj}\min \{\sum_{i\in S} \log d_i, \sum_{j\in \bar S} \log d_j\} ebits, and this is saturated by ensuring every qudit in the smaller partition connects via a maximally entangling gate to the complement.

A SEL thus consists of a perfect matching or generalized expander subgraph of maximally entangling gates that intersects every bipartition.

5. Explicit Families in Low Dimensions

For dA=dB=2d_A=d_B=2 (“qubit-qubit”), any two-qubit unitary can, up to local unitaries, be presented in Cartan form: U=(uA⊗uB)exp⁡[−i(αxσx⊗σx+αyσy⊗σy+αzσz⊗σz)](vA⊗vB).U = (u_A\otimes u_B)\exp [-i(\alpha_x \sigma_x\otimes\sigma_x + \alpha_y \sigma_y\otimes\sigma_y + \alpha_z \sigma_z\otimes\sigma_z)](v_A\otimes v_B). UU is maximally entangling if and only if two of the three angles satisfy cos⁡2αr=12\cos^2\alpha_r = \frac12 for r∈{x,y,z}r\in\{x,y,z\}.

Canonical maximally entangling gates include:

Gate Cartan Parameters Notes
Double-CNOT αx=αy=π4\alpha_x=\alpha_y=\frac{\pi}{4}, αz=0\alpha_z=0
SWAP αx=αy=αz=π4\alpha_x=\alpha_y=\alpha_z=\frac{\pi}{4}

For dA=2d_A=2, dB=3d_B=3 (“qubit–qutrit”), take G=Z22G=\mathbb Z_2^2 and T(f)T(f) as Pauli matrices. A maximally entangling example is the controlled-shift: Uc=∣0⟩⟨0∣⊗I3+∣1⟩⟨1∣⊗S3,U_c = |0\rangle \langle 0| \otimes I_3 + |1\rangle \langle 1| \otimes S_3, where S3=∑k=02∣k+1 ⁣mod  3⟩⟨k∣S_3 = \sum_{k=0}^2 |k+1\!\mod 3\rangle\langle k|. The Gram-matrix test confirms E(Uc)=2log⁡2E(U_c)=2 \log 2 ebits.

6. Practical Constraints and Optimization in Hardware

Considerations intrinsic to physical realization:

  • Connectivity graph: On 1D chains, covering all bipartitions with maximally entangling edges necessitates circuit depth O(N)O(N). For 2D lattices, SELs can be implemented in constant depth using two-round matchings.
  • Ancilla allocation: Ancillas of sizes dAd_A and dBd_B are necessary in principle, though for dB≥dAd_B\ge d_A the Bob’s ancilla may be embedded in BB itself, eliminating the need for an explicit ancilla bb.
  • Parameter tradeoffs: The continuous parameter freedom in maximally entangling gate families (e.g., the third Cartan angle in 2×22\times2) allows for selection based on gate duration and error rates in a given platform.
  • Entanglement vs. noise: Maximally entangling gates have increased duration and are more susceptible to noise. Submaximal gates (e.g., a single CNOT, achieving 1 ebit out of a possible 2) may be preferable under certain error models, possibly requiring increased circuit depth.
  • Gate compilation: Local single-qudit unitaries are used to convert a target two-qudit gate into canonical maximally entangling form, focusing the physical implementation on the nonlocal parameters.

7. Summary and Significance

Cohen's group-expansion theorem delivers a stringent, testable criterion (Equation 2.1) for a gate to be maximally entangling (Cohen, 2011). The linear algebraic structure streamlines verification and explicit construction in physical models. SELs, as layers of such gates crossing all bipartitions of interest, underlie circuit layouts seeking to saturate the entangling potential of quantum hardware for benchmarking, quantum simulation, and information scrambling tasks. Practical deployment requires balancing theoretical entangling capacity against hardware-imposed tradeoffs such as connectivity, depth, noise, and ancilla overhead.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (1)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Strongly Entangling Layer (SEL).