Minimum Tangle Drop Overview

• Minimum tangle drop is a multifaceted optimization measure that quantifies the minimal loss of complexity in tangle-like objects across diverse domains.
• It is defined as the difference in a complexity invariant before and after a local perturbation, with applications in quantum entanglement, tanglegrams, and wire tangle height minimization.
• Researchers use it to probe structural vulnerabilities, compare graphical and topological complexities, and develop algorithmic techniques for NP-hard optimization problems.

Minimum tangle drop is not a single invariant across the literature. In current arXiv usage, the expression refers to several non-equivalent minimization or sensitivity quantities: a multipartite-entanglement monotone based on the least loss of one-to-group tangle under single-qubit tracing, a tanglegram crossing-number drop under deletion of one matching edge, and the minimum vertical extent of a wire tangle realizing a prescribed swap multiset. Closely related low-dimensional-topology usages quantify bridge-number loss under tangle product, minimum unknotting complexity under tangle replacement, and minimum untangling complexity for rational tangles (Dong et al., 20 Jun 2026, Anderson et al., 2017, Firman et al., 2023, Blair, 2011, Eftekhary, 2024, Johar, 2013).

1. Scope of the term

The common pattern is an optimization over a local simplification or perturbation of a tangle-like object. What changes from field to field is the ambient category: quantum states, tanglegrams, layered adjacent-swap systems, or embedded tangles in $3$-manifolds. Only the multipartite-entanglement setting introduces a formal quantity explicitly built from a “minimum tangle drop”; elsewhere, the phrase is best understood as a convenient label for the minimum loss of some complexity measure (Dong et al., 20 Jun 2026).

Domain	Quantity	Representative result
Multipartite entanglement	$$\mathcal D_{q_1}=\min_i \sqrt{\tau_{q_1|\mathrm{rest}}-\tau_{q_1|\mathrm{rest}\setminus q_i}}$$	LOCC monotone; for $W_n$, $\mathcal D_{\min}=2/n$ (Dong et al., 20 Jun 2026)
Tanglegrams	$crt(T)-crt(T-e)$	For size $n$, the drop is at most $n-3$, and this is sharp (Anderson et al., 2017)
Wire tangles	Minimum number of layers realizing a swap list	NP-hard; exact exponential/FPT algorithms are known (Firman et al., 2023)
Tangle products	$\beta(K_1)+\beta(K_2)-\beta(K_1 *_S K_2)$	Under stated hypotheses, the drop is at most $n(10n-6)$ (Blair, 2011)

This divergence in usage matters methodologically. In the entanglement setting, the drop is a monotone derived from bipartite tangle. In combinatorics, it is an optimization target over layered realizations. In tanglegrams, it is a difference of crossing minima before and after edge deletion. In knot-theoretic settings, it is typically a lower-bounded simplification cost rather than a directly computable invariant.

2. Minimum tangle drop as a multipartite-entanglement monotone

The most explicit formal definition appears in multipartite entanglement. For an $n$-qubit state with focus qubit $$\mathcal D_{q_1}=\min_i \sqrt{\tau_{q_1|\mathrm{rest}}-\tau_{q_1|\mathrm{rest}\setminus q_i}}$$0, the minimum tangle drop is defined by

$$\mathcal D_{q_1}=\min_i \sqrt{\tau_{q_1|\mathrm{rest}}-\tau_{q_1|\mathrm{rest}\setminus q_i}}$$1

Here $$\mathcal D_{q_1}=\min_i \sqrt{\tau_{q_1|\mathrm{rest}}-\tau_{q_1|\mathrm{rest}\setminus q_i}}$$2 is the one-to-group tangle across the bipartition $$\mathcal D_{q_1}=\min_i \sqrt{\tau_{q_1|\mathrm{rest}}-\tau_{q_1|\mathrm{rest}\setminus q_i}}$$3, and $$\mathcal D_{q_1}=\min_i \sqrt{\tau_{q_1|\mathrm{rest}}-\tau_{q_1|\mathrm{rest}\setminus q_i}}$$4 is the corresponding tangle after tracing out $$\mathcal D_{q_1}=\min_i \sqrt{\tau_{q_1|\mathrm{rest}}-\tau_{q_1|\mathrm{rest}\setminus q_i}}$$5. For pure $$\mathcal D_{q_1}=\min_i \sqrt{\tau_{q_1|\mathrm{rest}}-\tau_{q_1|\mathrm{rest}\setminus q_i}}$$6 states, the underlying tangle is

$$\mathcal D_{q_1}=\min_i \sqrt{\tau_{q_1|\mathrm{rest}}-\tau_{q_1|\mathrm{rest}\setminus q_i}}$$7

and for mixed states the construction is extended by convex roof (Dong et al., 20 Jun 2026).

This quantity measures the least degradation of the global entanglement of the focus qubit under loss of one other particle. It is therefore simultaneously a one-focus robustness diagnostic and a multipartite entanglement monotone. The cited work states that the convex-roof extension is LU-invariant, convex, and monotonic under LOCC, and that it vanishes on biseparable states. It also states that the quantity fails strict positivity on all genuinely multipartite entangled states, so it is not a faithful GME detector in full generality (Dong et al., 20 Jun 2026).

The same framework introduces a minimum negativity drop as a computationally efficient variant. That variant is motivated by the difficulty of mixed-state tangle evaluation after tracing out one qubit, and by the desire to retain non-vanishing values on $$\mathcal D_{q_1}=\min_i \sqrt{\tau_{q_1|\mathrm{rest}}-\tau_{q_1|\mathrm{rest}\setminus q_i}}$$8-class states. This suggests that “minimum drop” is best viewed as a family of loss-of-correlation probes, with the tangle-based version occupying the most direct conceptual position and the negativity-based version supplying computational tractability (Dong et al., 20 Jun 2026).

3. Tripartite reduction, exact families, and limitations

In the tripartite regime, the minimum tangle drop collapses to a more classical quantity. If one defines

$$\mathcal D_{q_1}=\min_i \sqrt{\tau_{q_1|\mathrm{rest}}-\tau_{q_1|\mathrm{rest}\setminus q_i}}$$9

then the cited work proves

$W_n$0

so the symmetrized minimum tangle drop is physically equivalent to the minimum pairwise concurrence. This gives a particularly transparent three-qubit interpretation: the drop combines irreducible tripartite entanglement with the weakest residual two-qubit channel (Dong et al., 20 Jun 2026).

The framework yields exact formulas for $W_n$1-type families. For the pure $W_n$2-qubit $W_n$3 state,

$W_n$4

and for the noisy family

$W_n$5

the corresponding value is

$W_n$6

These expressions exhibit both positivity on $W_n$7-class states and $W_n$8-type robustness scaling (Dong et al., 20 Jun 2026).

The same work uses drop profiles as structural probes of entanglement architecture. Nonzero drop under removal of $W_n$9 indicates that $\mathcal D_{\min}=2/n$0 belongs to a mutually inseparable subset attached to the focus qubit, and this supports cluster reconstruction heuristics and graph-state fingerprinting. At the same time, the paper gives explicit limitations. A chain-type graph state is presented as a genuinely multipartite entangled state with vanishing minimum entanglement drop, and the broader drop framework is said to lose diagnostic sensitivity on highly robust states such as the $\mathcal D_{\min}=2/n$1-qubit error-correcting code. A plausible implication is that minimum tangle drop is strongest as a local vulnerability probe and weaker as a universal scalar classifier of multipartite entanglement (Dong et al., 20 Jun 2026).

4. Edge-deletion drop in tanglegrams

In tanglegram theory, the relevant notion is the decrease in minimum crossing number after deleting one matching edge. A tanglegram $\mathcal D_{\min}=2/n$2 consists of two rooted binary trees with the same number of leaves and a perfect matching $\mathcal D_{\min}=2/n$3 between their leaf sets. In a layout, the trees are drawn plane on opposite sides of a strip, their leaves lie on two parallel lines, and only matching edges may cross. The tangle crossing number $\mathcal D_{\min}=2/n$4 is the minimum number of crossing pairs of matching edges over all layouts (Anderson et al., 2017).

For a matching edge $\mathcal D_{\min}=2/n$5, the drop is measured by

$\mathcal D_{\min}=2/n$6

where $\mathcal D_{\min}=2/n$7 is obtained by deleting the endpoints of $\mathcal D_{\min}=2/n$8 and suppressing the resulting degree-$\mathcal D_{\min}=2/n$9 vertices. The central theorem states that if $crt(T)-crt(T-e)$0 has size $crt(T)-crt(T-e)$1, then

$crt(T)-crt(T-e)$2

and the bound is sharp. The proof starts from an optimal layout of $crt(T)-crt(T-e)$3, reinserts the deleted edge by local switch choices in the two trees, and shows that one can always restore $crt(T)-crt(T-e)$4 so that it crosses at most $crt(T)-crt(T-e)$5 other matching edges (Anderson et al., 2017).

Sharpness is realized by an explicit family $crt(T)-crt(T-e)$6 of rooted-caterpillar tanglegrams. For each $crt(T)-crt(T-e)$7, $crt(T)-crt(T-e)$8 is $crt(T)-crt(T-e)$9-edge tangle planar, has

$n$0

and becomes planar after deleting a distinguished matching edge. Hence

$n$1

This shows that a single edge can account for all nonplanarity of a tanglegram while still forcing only a linear drop, even though the global extremal tangle crossing number is quadratic: if $n$2 denotes the maximum tangle crossing number over size-$n$3 tanglegrams, then

$n$4

The same paper also gives an $n$5-time algorithm for nontrivial lower bounds on $n$6, which is relevant when one wants to estimate deletion drops computationally (Anderson et al., 2017).

A closely related 2025 result isolates the first nonplanar level. If a tanglegram has exactly one cross-responsible size-$n$7 subtanglegram, then its tangle crossing number is exactly $n$8. This does not define a “drop” quantity, but it gives a structural certificate for the minimum achievable nonzero crossing count (Czabarka et al., 30 Apr 2025).

5. Minimum vertical extent in wire tangles

In the combinatorics of adjacent swaps, the natural “drop” is the height of a tangle. A tangle consists of $n$9 $n-3$0-monotone wires arranged on horizontal layers, with consecutive layers differing only by swaps of neighboring wires. A list $n-3$1 records how many times each pair of wires must swap. A tangle realizes $n-3$2 if the multiset union of swaps between consecutive layers equals $n-3$3; $n-3$4 asks whether such a tangle exists, and $n-3$5 asks for one with the minimum number of layers (Firman et al., 2023).

The paper proves that $n-3$6 is NP-complete even if every pair of wires swaps at most eight times. Since height minimization subsumes feasibility, the optimization problem is NP-hard as well. The positive side is an exact DP over sublists. If $n-3$7 denotes the minimum height of a tangle realizing a sublist $n-3$8, and $n-3$9 is the final permutation forced by parity, then

$\beta(K_1)+\beta(K_2)-\beta(K_1 *_S K_2)$0

where $\beta(K_1)+\beta(K_2)-\beta(K_1 *_S K_2)$1 is the set of permutations adjacent to $\beta(K_1)+\beta(K_2)-\beta(K_1 *_S K_2)$2. The resulting algorithm solves $\beta(K_1)+\beta(K_2)-\beta(K_1 *_S K_2)$3 in

$\beta(K_1)+\beta(K_2)-\beta(K_1 *_S K_2)$4

with $\beta(K_1)+\beta(K_2)-\beta(K_1 *_S K_2)$5 arising from the Fibonacci count of adjacent predecessor permutations (Firman et al., 2023).

The same work derives a simpler feasibility-only DP with running time

$\beta(K_1)+\beta(K_2)-\beta(K_1 *_S K_2)$6

shows that $\beta(K_1)+\beta(K_2)-\beta(K_1 *_S K_2)$7 is fixed-parameter tractable with respect to the number of wires $\beta(K_1)+\beta(K_2)-\beta(K_1 *_S K_2)$8, and gives an FPT algorithm running in

$\beta(K_1)+\beta(K_2)-\beta(K_1 *_S K_2)$9

For simple lists, where every swap occurs at most once, the minimum-height problem becomes cleaner: if $n(10n-6)$0 denotes the inversion list of a permutation $n(10n-6)$1, then $n(10n-6)$2 is the unique simple list with $n(10n-6)$3, and shortest-path search on the resulting permutation graph yields an

$n(10n-6)$4

algorithm (Firman et al., 2023).

This line of work generalizes earlier height-optimality results. An earlier paper gave an exact algorithm with running time

$n(10n-6)$5

in the abstract formulation and treated simple lists in $n(10n-6)$6 time, but the later formulation also establishes NP-membership and fixed-parameter tractability with respect to the number of wires (Firman et al., 2019, Firman et al., 2023).

6. Related minimum-complexity notions in knot and tangle theory

In low-dimensional topology, several adjacent notions measure how much complexity can be lost under a tangle operation. For $n(10n-6)$7-strand tangle products $n(10n-6)$8, one paper proves that if there exists a minimal bridge sphere for $n(10n-6)$9 of distance at least three and the product sphere $n$0 is $n$1-incompressible, then

$n$2

Equivalently, if one defines the bridge-number drop by $n$3, then the drop is at most $n$4. The proof passes through a bound of $n$5 on the number of saddles in the induced foliation of the $n$6-punctured product sphere (Blair, 2011).

A different Floer-theoretic notion measures the minimum local tangle complexity required to unknot a knot. If $n$7 denotes the minimum $n$8 such that an oriented $n$9-tangle replacement unknots $$\mathcal D_{q_1}=\min_i \sqrt{\tau_{q_1|\mathrm{rest}}-\tau_{q_1|\mathrm{rest}\setminus q_i}}$$00, and $$\mathcal D_{q_1}=\min_i \sqrt{\tau_{q_1|\mathrm{rest}}-\tau_{q_1|\mathrm{rest}\setminus q_i}}$$01 the analogous unoriented quantity, then

$$\mathcal D_{q_1}=\min_i \sqrt{\tau_{q_1|\mathrm{rest}}-\tau_{q_1|\mathrm{rest}\setminus q_i}}$$02

where $$\mathcal D_{q_1}=\min_i \sqrt{\tau_{q_1|\mathrm{rest}}-\tau_{q_1|\mathrm{rest}\setminus q_i}}$$03 and $$\mathcal D_{q_1}=\min_i \sqrt{\tau_{q_1|\mathrm{rest}}-\tau_{q_1|\mathrm{rest}\setminus q_i}}$$04 are knot Floer torsion orders. More generally,

$$\mathcal D_{q_1}=\min_i \sqrt{\tau_{q_1|\mathrm{rest}}-\tau_{q_1|\mathrm{rest}\setminus q_i}}$$05

This makes torsion order a lower bound on minimum one-shot tangle-replacement simplification (Eftekhary, 2024).

For rational tangles, the minimum untangling complexity is Euclidean-algorithmic. If

$$\mathcal D_{q_1}=\min_i \sqrt{\tau_{q_1|\mathrm{rest}}-\tau_{q_1|\mathrm{rest}\setminus q_i}}$$06

is a generalized Euclidean algorithm, then the corresponding untangling sequence has

$$\mathcal D_{q_1}=\min_i \sqrt{\tau_{q_1|\mathrm{rest}}-\tau_{q_1|\mathrm{rest}\setminus q_i}}$$07

moves, where the moves are twists plus rotations. The paper proves that the method of least absolute remainders and the regular Euclidean algorithm have the same minimal number of such steps, and that this is the smallest possible. Thus the most efficient untangling of a rational tangle is determined by the minimal subtraction-style Euclidean step count (Johar, 2013).

Finally, the minimum crossing complexity of essential tangles is also known sharply in several regimes. For an essential $$\mathcal D_{q_1}=\min_i \sqrt{\tau_{q_1|\mathrm{rest}}-\tau_{q_1|\mathrm{rest}\setminus q_i}}$$08-string tangle, the minimum crossing number is at least $$\mathcal D_{q_1}=\min_i \sqrt{\tau_{q_1|\mathrm{rest}}-\tau_{q_1|\mathrm{rest}\setminus q_i}}$$09; if all strings are unknotted, the minimum rises to $$\mathcal D_{q_1}=\min_i \sqrt{\tau_{q_1|\mathrm{rest}}-\tau_{q_1|\mathrm{rest}\setminus q_i}}$$10; and for essential $$\mathcal D_{q_1}=\min_i \sqrt{\tau_{q_1|\mathrm{rest}}-\tau_{q_1|\mathrm{rest}\setminus q_i}}$$11-string $$\mathcal D_{q_1}=\min_i \sqrt{\tau_{q_1|\mathrm{rest}}-\tau_{q_1|\mathrm{rest}\setminus q_i}}$$12-loop tangles with $$\mathcal D_{q_1}=\min_i \sqrt{\tau_{q_1|\mathrm{rest}}-\tau_{q_1|\mathrm{rest}\setminus q_i}}$$13, the bound is $$\mathcal D_{q_1}=\min_i \sqrt{\tau_{q_1|\mathrm{rest}}-\tau_{q_1|\mathrm{rest}\setminus q_i}}$$14. These are minimum-complexity statements rather than “drop” statements in the strict sense, but they belong to the same family of extremal tangle simplification questions (Nogueira et al., 2015).

Across these literatures, minimum tangle drop is therefore best understood as a family resemblance rather than a single invariant. The shared theme is minimal loss or minimal simplification under a local operation, but the ambient measures—tangle, crossing number, height, bridge number, Floer torsion, or untangling steps—are domain-specific and mathematically distinct.