Incoherent Operations Enable State Transformations Impossible under Dephasing-covariant Incoherent Operations

This paper resolves an open problem by demonstrating that incoherent operations (IOs) enable state transformations forbidden under dephasing-covariant incoherent operations (DIOs), while also showing that existing monotones are insufficient to fully characterize state convertibility under either strictly incoherent operations (SIOs) or DIOs.

The Gist

Imagine you are a chef trying to cook a complex dish (a quantum state) using only a specific set of ingredients and tools. In the world of quantum physics, the "ingredients" are the basic building blocks of reality, and "coherence" is the special magic that makes quantum computers so powerful.

However, there are strict rules about what chefs (physicists) are allowed to do. Some chefs are very strict and can only stir the pot without ever creating new flavors from scratch. Others have a bit more freedom. This paper is about figuring out exactly who can cook what, and proving that one group of chefs can actually do something the others thought was impossible.

Here is the story of the paper, broken down into simple concepts:

1. The Three Types of Chefs (The Operations)

In the "Resource Theory of Coherence," scientists have defined different rules for how we can manipulate quantum states. Think of these as three levels of chefs:

• The Strict Chefs (SIOs): These chefs are the most limited. They can't create new flavors (coherence) and they can't use existing flavors to change the recipe in tricky ways. They are very rigid.
• The "No-Detect" Chefs (DIOs): These chefs are a bit more flexible. They can't detect if a dish has "magic" in it (they can't tell if the ingredients are mixed in a special way), but they can't create new magic either.
• The "No-Creation" Chefs (IOs): These chefs are allowed to do almost anything, as long as they don't create new magic out of thin air. They can rearrange existing magic in very clever ways.

The Big Question: For a long time, scientists wondered: "Are the 'No-Detect' chefs (DIOs) and the 'No-Creation' chefs (IOs) equally powerful? Or can one do things the other can't?"

2. The Impossible Recipe (The Discovery)

For years, it was known that the Strict Chefs (SIOs) were the weakest. But the relationship between the other two was a mystery. Some thought they were equal; others thought one was stronger.

The authors of this paper found a "Magic Recipe" that only the "No-Creation" chefs (IOs) can make.

They constructed a specific quantum state (a specific dish) and showed that:

1. An IO chef can transform it into a new, more powerful state.
2. A DIO chef (and a Strict chef) cannot do this, even if they try their hardest.

The Analogy: Imagine you have a pile of Lego bricks.

• The Strict Chef can only stack them in a straight line.
• The No-Detect Chef can rearrange the line, but they can't see the hidden "glue" that holds the bricks together in a special pattern, so they can't build a tower.
• The No-Creation Chef can see the hidden glue. They can't make new glue, but they can take the existing glue and use it to build a tower that the No-Detect Chef simply cannot build.

The paper proves that the "No-Creation" chefs are strictly stronger than the "No-Detect" chefs. They solved a puzzle that had been open for nearly a decade.

3. The Broken Ruler (The Problem with "Monotones")

In science, we often use "rulers" (called monotones) to measure how much "magic" (coherence) a state has. If you have a ruler that says "State A has more magic than State B," we usually assume you can turn A into B.

The paper shows that these rulers are lying to us when we get too complex.

• The Scenario: The authors found two states, A and B.
• The Ruler's Verdict: Every single ruler that the "No-Creation" chefs use says, "State A has more magic than State B."
• The Reality: Even though the rulers say A is better, the "Strict Chefs" (SIOs) cannot turn A into B.

The Analogy: Imagine you have a speedometer (the ruler) that says Car A is faster than Car B. You assume Car A can easily win a race against Car B. But it turns out, Car A has a flat tire (a hidden rule of the Strict Chefs). The speedometer didn't tell the whole story.

This means that just looking at a list of "magic meters" isn't enough to know what is possible. You need to know the specific rules of the chef you are using.

4. Why This Matters

This paper changes how we understand the "hierarchy" of quantum power.

1. It settles a debate: It proves that the "No-Creation" chefs (IOs) are strictly more powerful than the "No-Detect" chefs (DIOs) for certain tasks.
2. It warns scientists: You can't just rely on a list of measurements (monotones) to predict what is possible in quantum mechanics. Sometimes, the measurements look perfect, but the transformation is still impossible because of the specific rules of the operation.

The Takeaway

Think of quantum coherence like a complex dance.

• Some dancers (SIOs) can only do basic steps.
• Some (DIOs) can do more, but they can't see the rhythm.
• Others (IOs) can see the rhythm and use it to perform a move that the others simply cannot.

This paper is the proof that the dancers who can see the rhythm (IOs) have a secret move that the others don't have, and it warns us that simply counting the steps (using monotones) isn't enough to predict who can dance with whom.

Technical Summary

Here is a detailed technical summary of the paper "Incoherent Operations Enable State Transformations Impossible under Dephasing-covariant Incoherent Operations" by C. L. Liu.

1. Problem Statement

The paper addresses a fundamental open problem in the resource theory of quantum coherence regarding the operational hierarchy between different classes of free operations. Specifically, it investigates the relationship between Incoherent Operations (IOs) and Dephasing-covariant Incoherent Operations (DIOs).

• Context: In the resource theory of coherence, free operations are classified into several sets: Maximally Incoherent Operations (MIOs), DIOs, IOs, and Strictly Incoherent Operations (SIOs). The inclusion hierarchy is known as $SIO \subset IO \subset MIO$ and $SIO \subset DIO \subset MIO$. However, IOs and DIOs are incomparable (neither is a subset of the other).
• The Gap: Previous research established that DIOs can be strictly more powerful than IOs for certain state transformations. However, the converse question remained unresolved: Can IOs perform state transformations that are impossible under DIOs? This question, posed by Chitambar and Gour (2016), had remained open until this work.
• Secondary Problem: The paper also investigates whether a complete set of coherence monotones (measures that do not increase under free operations) from a broader class (like IOs) is sufficient to characterize state convertibility within a narrower class (like SIOs or DIOs).

2. Methodology

The authors employ a constructive approach to resolve the open problem and analyze the limitations of coherence monotones.

• Construction of Counter-Examples: The authors explicitly construct a specific quantum state transformation $\rho_{in} \to \rho_{out}$ in a 3-dimensional Hilbert space.
  • They define a specific coherence measure, $C_m(\rho)$, which is known to be a monotone under DIOs and SIOs (i.e., it cannot increase under these operations).
  • They design a specific Incoherent Operation (IO) using Kraus operators $\{K_1, K_2\}$ that transforms $\rho_{in}$ to $\rho_{out}$.
  • They demonstrate that under this IO, the value of $C_m(\rho)$ increases ($C_m(\rho_{out}) > C_m(\rho_{in})$).
• Mechanism Analysis: The increase in $C_m(\rho)$ is achieved through two simultaneous mechanisms engineered by the IO:
  1. Constructive Interference: Coherently mixing basis states to enhance off-diagonal terms (numerator of the Rayleigh quotient form of $C_m$).
  2. Selective Population Reduction: Reducing the diagonal weights (populations) associated with the optimal support vector, thereby decreasing the denominator of the Rayleigh quotient.
• Monotone Analysis: The authors analyze the sets of monotones ($M_{IO}$, $M_{DIO}$, $M_{SIO}$) to prove that:
  • Even if all IO-monotones satisfy the condition $M(\rho_1) \geq M(\rho_2)$, the transformation $\rho_1 \to \rho_2$ may still be impossible under SIOs.
  • Similarly, the intersection of IO and DIO monotones is insufficient to characterize DIO convertibility.

3. Key Contributions

A. Resolution of the IO vs. DIO Hierarchy (Theorem 1)

The paper provides the first explicit proof that IOs are strictly more powerful than DIOs for certain state transformations.

• Result: There exists a transformation achievable by an IO that is forbidden under both SIOs and DIOs.
• Evidence: The constructed IO increases the measure $C_m(\rho)$ from $\approx 0.1853$ to $\approx 0.2548$. Since $C_m$ is a monotone for DIOs and SIOs, this increase proves the transformation is impossible under those classes.
• Implication: This completes the operational comparison between IOs and DIOs, showing they are distinct and neither dominates the other.

B. Limitations of Coherence Monotones (Theorems 2 & 3)

The paper demonstrates that the set of monotones is not a "complete" characterization tool for state convertibility across different operational classes.

• Theorem 2: Even if a transformation satisfies $M(\rho_1) \geq M(\rho_2)$ for every IO monotone, it does not guarantee that the transformation is possible under SIOs. This implies that the set of SIO-monotones ($M_{SIO}$) contains elements not found in the set of IO-monotones ($M_{IO}$).
• Theorem 3: Similarly, the intersection of IO and DIO monotones ($M_{IO} \cap M_{DIO}$) is insufficient to characterize convertibility under DIOs.
• Significance: This refutes the assumption that monotones from a larger class of operations can fully characterize the convertibility of a smaller, more restrictive class.

4. Key Results

1. Explicit Counter-Example: A 3-dimensional state transformation is provided where an IO increases $C_m(\rho)$, violating the monotonicity required for DIOs and SIOs.
2. Failure of $C_m(\rho)$ as an IO Monotone: The measure $C_m(\rho)$, while valid for DIOs and SIOs, is not a monotone under general IOs.
3. Incompleteness of Monotone Sets:
   • $M_{IO} \subsetneq M_{SIO}$: The set of SIO monotones is strictly larger than the set of IO monotones.
   • $M_{IO} \cap M_{DIO} \subsetneq M_{DIO}$: The common monotones are insufficient to characterize DIO power.
4. Stochastic IOs: The paper shows that even stochastic IOs can surpass the bounds established for stochastic SIOs regarding the maximal fidelity of converting a state to a maximally coherent state.

5. Significance

• Operational Hierarchy: The work definitively settles the long-standing debate on the relative power of IOs and DIOs, establishing a refined hierarchy where neither class is a superset of the other in terms of transformation power.
• Theoretical Framework: It highlights a critical limitation in the resource theory of coherence: Monotones alone are insufficient to fully characterize state convertibility when moving between different classes of free operations. A complete characterization requires operational criteria specific to the class, not just inherited monotones.
• Practical Implications: The findings suggest that protocols relying on IOs (which are often easier to implement physically than MIOs but more powerful than SIOs) can achieve tasks previously thought impossible under DIO constraints, potentially impacting quantum state engineering and coherence distillation protocols.
• Future Directions: The results underscore the necessity of developing class-specific monotones and operational criteria, particularly for mixed-state transformations, as convex roof measures (which work for pure states) are insufficient for mixed states under SIOs.