Complexity of Einstein-Maxwell-non-minimal coupling $R^2F^2$: the role of the penalty factor

This paper investigates holographic complexity in an Einstein-Maxwell theory with a non-minimal $R^2F^2$ coupling that models strange metal behavior, demonstrating how the complexity growth rate is governed by conserved charge, coupling strength, and the choice of bulk functional, which collectively deform the effective cost metric and control the dual theory's scrambling time.

The Gist

Imagine the universe as a giant, complex computer simulation. Physicists have a powerful tool called AdS/CFT duality that lets them translate difficult problems in gravity (like black holes) into easier problems in quantum mechanics (like computer circuits), and vice versa.

This paper is about a specific experiment in that translation game. The authors are trying to understand Complexity—a measure of how hard it is to build a specific quantum state from scratch, like how many Lego bricks and steps it takes to build a castle.

Here is a simple breakdown of what they did and what they found, using everyday analogies.

1. The Setup: A "Glitchy" Black Hole

Usually, physicists study "perfect" black holes in their simulations. But in this paper, the authors introduced a "glitch" or a "deformation" to the rules of gravity. They added a specific interaction term called $R^2 F^2$.

• The Analogy: Imagine a standard black hole is like a smooth, frictionless slide. The authors added a "rough patch" or a "sticky spot" to the slide.
• The Result: This sticky patch changes how electricity flows in the system. It creates a behavior called a "Strange Metal," where electrical resistance goes up linearly with temperature. This is exactly what happens in some real-world materials (like high-temperature superconductors) that scientists are trying to understand.

2. The Three "Knobs" They Turned

To see how this "sticky" black hole affects complexity, they turned three different "knobs" (parameters) in their simulation:

Knob A: The "Penalty Factor" (The Generalization Term)

In the "Complexity = Anything" framework, you can choose how you measure complexity. The authors tested three different ways to weigh the difficulty of the task.

• The Analogy: Imagine you are navigating a maze.
  • Option 1: You can walk anywhere, but some paths are "expensive" (like walking through mud).
  • Option 2: You can only walk on the grass, but the grass is slippery.
  • Option 3: You have to avoid certain zones entirely.
• What they found: Changing this "penalty" is like changing the rules of the maze. It doesn't change the maze itself, but it changes the cost of the path you take. In the quantum world, this is like assigning a "penalty" to using certain types of computer gates, making them harder to use.

Knob B: The "Non-Minimal Coupling" (The Glitch Strength)

This is the strength of the "sticky patch" they added to the black hole.

• The Analogy: Imagine the black hole is a chaotic party where information (guests) gets scrambled. The "coupling" is how much the music is distorted.
• What they found: Making the glitch stronger (increasing the coupling) actually slows down the scrambling of information. It's like putting a "speed bump" on the highway of chaos. The information takes longer to get mixed up, which means the "Complexity Growth Rate" (how fast the system gets complicated) slows down.

Knob C: The "Conserved Charge" (The Crowd Size)

This represents the amount of electric charge in the black hole.

• The Analogy: Imagine a crowded dance floor. If the room is empty, people can move and mix freely. If the room is packed with people (high charge), it's hard to move around.
• What they found: The more charge you add, the harder it is for the system to evolve. The "dance floor" gets so crowded that the complexity grows more slowly. It restricts the available moves the quantum computer can make.

3. The Big Picture: The "Effective Scrambling Time"

The most important discovery is that these knobs don't just change the numbers; they change the time it takes for the system to get complicated.

The authors realized that the "Penalty Factor" (Knob A) and the "Glitch Strength" (Knob B) work together to create an "Effective Scrambling Time."

• The Metaphor: Think of a quantum computer as a super-fast processor.
  • Normally, it scrambles data instantly.
  • But if you add a "penalty" (like a software restriction) or a "glitch" (like a hardware lag), the processor has to take a detour.
  • The Complexity Growth Rate is simply how fast the processor is working.
  • The Scrambling Time is how long it takes to finish the job.

The paper shows that by tweaking the rules of gravity (the bulk), you are effectively changing the "penalty" in the quantum circuit (the boundary). If you make the penalty higher, the circuit takes longer to run, and the complexity grows slower.

4. Why Does This Matter? (The Superconductor Connection)

The authors connect this to real-world Superconducting Circuits (the kind used in Google's and IBM's quantum computers).

• Real World Problem: In real quantum computers, if you try to do two things at once (parallel operations), the signals can "crosstalk" and mess up the calculation. To fix this, engineers add "penalties" to force the computer to do things one by one (sequentially).
• The Result: This makes the circuit "deeper" (takes more steps) and slower, but it's more accurate.
• The Paper's Insight: The math they did for the black hole perfectly matches this real-world engineering problem. The "penalty factor" in their gravity theory is the same mathematical concept as the "crosstalk penalty" in a real quantum chip.

Summary

This paper is a bridge between Black Holes and Quantum Computers.

1. They built a "weird" black hole that mimics strange metals.
2. They showed that changing the rules of this black hole is mathematically identical to adding penalties to a quantum circuit.
3. These penalties slow down how fast the system gets complicated (Complexity Growth).
4. This helps us understand why real quantum computers get slower when we try to fix errors, and it gives us a new way to think about how information scrambles in the universe.

In short: They found that the "cost" of doing complex things in a black hole is governed by the same rules as the "cost" of doing complex things in a quantum computer, and they figured out exactly how to tune those costs.

Technical Summary

1. Problem Statement

The paper investigates holographic quantum complexity within the framework of Einstein-Maxwell theory modified by a non-minimal coupling term of the form $R^2 F_{\mu\nu}F^{\mu\nu}$, where $R$ is the Ricci scalar and $F_{\mu\nu}$ is the electromagnetic field strength.

• Context: Standard holographic complexity conjectures (Complexity=Volume and Complexity=Action) have been extended by the "Complexity=Anything" conjecture, which allows complexity to be defined via a broad class of diffeomorphism-invariant bulk functionals. This introduces an intrinsic ambiguity regarding the choice of the scalar functional.
• Motivation: The specific non-minimal coupling $R^2 F^2$ is chosen because it models strange metal behavior, characterized by a linear temperature dependence of resistivity.
• Core Question: How do non-minimal gravitational couplings and the choice of the generalized complexity functional (the "penalty factor") affect the Complexity Growth Rate (CGR) and the effective scrambling time in the dual quantum field theory?

2. Methodology

A. Construction of the Black Brane Solution

Since exact analytical solutions for Einstein-Maxwell theory with $R^2 F^2$ coupling are unavailable, the authors construct a perturbative AdS black brane solution to the first order in the non-minimal coupling parameter $q_2$.

• Action: The theory is defined by the action:
  $$S = \int d^4x\sqrt{-g} \left[ \frac{1}{\kappa}(R - 2\Lambda) - \frac{q_1}{4}F_{\mu\nu}F^{\mu\nu} + q_2 R^2 F_{\mu\nu}F^{\mu\nu} \right]$$
• Ansatz: A static, translationally invariant metric and gauge field ansatz are used:
  $$ds^2 = -e^{-2H(r)}f(r)dt^2 + \frac{dr^2}{f(r)} + \frac{r^2}{L^2}(dx^2 + dy^2)$$
  $$A_\mu = (h(r), 0, 0, 0)$$
• Perturbation: The metric functions $f(r)$, $H(r)$ and the gauge potential $h(r)$ are expanded as $X(r) = X_0(r) + q_2 X_1(r)$, where $X_0$ represents the standard Einstein-Maxwell AdS black brane. The authors solve the equations of motion order-by-order to derive the corrected metric and gauge field profiles.

B. Holographic Complexity Calculation

The authors employ the Complexity=Anything (CAny) framework.

• Functional: The complexity is defined by extremizing a bulk functional:
  $$C_{Any} = \frac{1}{G_N L} \int_{\Sigma} d^d\sigma \sqrt{h} F_1(g_{\mu\nu}; X^\mu)$$
  where $F_1 = 1 + \gamma b$. The parameter $\gamma$ controls the strength of the generalization, and $b$ represents three distinct choices:
  1. $b = C^2$ (Weyl tensor squared)
  2. $b = R^2 F^2$ (The non-minimal coupling term itself)
  3. $b = F^2$ (Maxwell invariant)
• Dynamics: The problem is mapped to the motion of a particle in an effective potential $\tilde{U}(r)$. The complexity growth rate (CGR) is derived from the conserved momentum $P_v$ conjugate to the boundary time coordinate.

C. Physical Interpretation

The authors interpret the mathematical parameters in terms of quantum circuit complexity:

• Penalty Factor: The generalized term $\gamma b$ is interpreted as a penalty factor in Nielsen's geometric formulation of circuit complexity, deforming the effective cost metric.
• Scrambling Time: The non-minimal coupling $q_2$ and the charge $Q$ are linked to an effective scrambling time, distinct from the microscopic scrambling time defined by shock waves.

3. Key Contributions

1. Perturbative Solution: Derivation of the first-order perturbative AdS black brane solution for the $R^2 F^2$ non-minimal coupling, enabling the study of holographic complexity in this specific strange-metal model.
2. Penalty Factor Identification: Analytically demonstrating that the generalized scalar functional in the bulk ($\gamma b$) induces a deformation of the effective cost metric in the bulk geometry. This deformation is structurally equivalent to introducing penalty factors in the dual quantum circuit, which weight different directions in the space of unitary transformations.
3. Effective Scrambling Time: Identification of a complexity-dependent effective scrambling time ($t_{scal.}$). The authors show that while the intrinsic chaotic properties (Lyapunov exponent) of the bulk geometry remain unchanged, the rate at which complexity grows is governed by a timescale sensitive to $q_2$ and $\gamma$.
4. Circuit Analogies: Providing concrete analogies with superconducting qubit circuits (e.g., crosstalk penalties and QAOA constraint terms) to validate the physical interpretation of penalty factors suppressing or enhancing processing rates.

4. Key Results

A. Dependence on Parameters

The Complexity Growth Rate (CGR) is governed by three independent parameters:

1. Conserved Charge ($Q$): Increasing $Q$ restricts the set of admissible simple unitary operators (analogous to the Solovay-Kitaev algorithm), leading to an increase in effective scrambling time and a suppression of the CGR.
2. Non-minimal Coupling ($q_2$): Increasing $|q_2|$ generally increases the effective scrambling time, thereby suppressing the CGR.
3. Generalization Parameter ($\gamma$ and choice of $b$): The effect depends on the specific choice of $b$:
   • $b = C^2$ (Weyl): Increasing $|q_2|$ suppresses the CGR.
   • $b = F^2$ (Maxwell): Increasing $|q_2|$ suppresses the CGR. This case closely resembles standard CV/CA proposals and does not exhibit multiple branches in the CGR.
   • $b = R^2 F^2$: Interestingly, for this specific choice, increasing $|q_2|$ leads to an enhancement of the CGR (opposite to the other cases), highlighting the sensitivity of complexity to the specific geometric functional chosen.

B. Branching Behavior

The numerical analysis reveals that for curvature-dependent generalizations ($C^2$ and $R^2 F^2$), the CGR exhibits multiple branches (turning points) where the dominant extremal surface switches. This branching behavior is absent for the $F^2$ case, suggesting a deeper geometric origin for complexity in curvature-dependent models.

C. Analytical Relations

The authors derive an approximate relation near the horizon linking the CGR ($\dot{C}_{Any}$) to the effective scrambling time ($t_{scal.}$):
$$\dot{C}_{Any} \approx \frac{1}{t_{scal.}}$$
where $t_{scal.}$ is modified by the non-minimal coupling and the penalty factor.

5. Significance

• Bridging Gravity and Quantum Circuits: The paper provides a rigorous geometric derivation showing how bulk generalizations in holography map directly to penalty structures in quantum circuit complexity. This helps resolve the ambiguity of "Complexity=Anything" by grounding it in the physical concept of cost metrics.
• Strange Metal Modeling: By linking the $R^2 F^2$ coupling to linear resistivity, the work offers a holographic tool to study the complexity dynamics of strange metals, a regime where standard perturbative methods fail.
• New Scrambling Concept: The distinction between "microscopic scrambling" (shock waves) and "complexity-dependent effective scrambling" (governed by the cost metric) offers a new perspective on how information scrambling is perceived through the lens of computational complexity.
• Experimental Relevance: The analogy with superconducting circuits (crosstalk penalties and QAOA) suggests that the theoretical findings regarding penalty factors have direct parallels in real-world quantum computing hardware, where constraints and penalties dictate circuit depth and error rates.

In conclusion, the paper establishes that the choice of the holographic complexity functional is not merely a mathematical ambiguity but corresponds to a physical penalty structure in the dual quantum circuit, which fundamentally alters the effective scrambling time and the rate of complexity growth.