Qualitative quantum simulation of resonant tunneling and localization with the shallow quantum circuits

This paper demonstrates that shallow quantum circuits with large time steps are sufficient to qualitatively observe continuous-time quantum phenomena like resonant tunneling and localization, suggesting a feasible approach for near-term quantum computers that prioritizes qualitative insights over quantitative precision.

The Gist

Imagine you are trying to simulate a complex dance of particles using a computer. In the ideal world of physics, these particles move in a smooth, continuous flow, like water flowing down a river. To simulate this perfectly on a digital quantum computer, you would need to break that smooth river into millions of tiny, frozen steps. Doing this requires a massive number of instructions (quantum gates), which is like trying to build a skyscraper with a million tiny Lego bricks. Unfortunately, current quantum computers are like shaky hands; the more bricks you try to stack, the more likely the tower is to collapse due to noise and errors.

This paper proposes a clever shortcut: What if we don't need a million steps to see the big picture?

The authors ask: Can we use just a few, large steps (a "shallow" circuit) to still see the most important features of the dance? They found that the answer is yes. Even with a very rough, coarse simulation, the computer can still qualitatively show us two famous quantum phenomena: Resonant Tunneling and Localization.

Here is how they explain these concepts using simple analogies:

1. The Setup: A Quantum Pinball Machine

Think of the quantum computer as a row of connected rooms (qubits). They start with a single "excited" ball (a spin excitation) in the first room. The goal is to watch how this ball travels through the hallway to the last room.

• The Rules: The ball moves between rooms using special "XY gates" (like doors that let the ball pass) and "Rz gates" (like walls that can be tilted to change the ball's energy).
• The Problem: Usually, to see the ball move smoothly, you need to open and close these doors thousands of times. The authors tried opening them only a few times (large steps) to see if the ball still behaves "correctly."

2. Phenomenon A: Resonant Tunneling (The "Perfect Match" Slide)

Imagine you have a series of wells or pits in the ground. A ball can jump from one pit to another, but it's hard work. However, if the two pits are at the exact same depth, the ball can slide between them effortlessly. This is called Resonance.

• What the paper found: Even with their "lazy" simulation (few steps), the computer still showed that when the settings of the starting pit and the ending pit matched perfectly, the ball jumped across with maximum success.
• The Magic Number: They discovered a simple rule: If the continuous-time physics predicts $n$ peaks of success (resonance), their shallow circuit only needed $n + 1$ steps to show those same peaks.
  • Example: To see 3 peaks of success, they only needed 4 steps.
  • Analogy: It's like drawing a mountain range. You don't need a million pixels to show that there are three peaks; a sketch with just four lines can tell you exactly where the mountains are and how many there are.

They tested this on systems with 2, 3, 4, and 5 rooms and even on a real IBM quantum computer, confirming that the "sketch" looked just like the "photograph" in terms of the number and position of the peaks.

3. Phenomenon B: Localization (The "Traffic Jam" in a Messy Hallway)

Now, imagine the hallway is messy. The walls (the Rz gates) are tilted randomly, some left, some right, some high, some low. This is disorder.

• What usually happens: In a messy hallway, a ball usually gets stuck near where it started because the random bumps scatter it everywhere. It can't reach the end. This is called Localization.
• What the paper found: Even with their coarse, large-step simulation, the ball still got stuck near the start when the hallway was messy. The "sketch" still showed the traffic jam.
• The Error Connection: The authors point out that in quantum computers, a "bit-flip error" (a mistake where a 0 accidentally becomes a 1) acts just like this ball. If the computer's settings are random (disordered), these errors get stuck near where they started and don't spread to the rest of the computer. This suggests that disorder might actually help protect the rest of the system from errors, even in these simple, shallow circuits.

4. The "Crazy" Gate: Controlled-Rx

The authors also tried replacing the standard doors with a "magic door" (Controlled-Rx) that, if the ball enters, splits it into two balls (entanglement).

• The Result: Even with this more complex, error-spreading gate, the "lazy" simulation still showed the resonance peaks and the localization traffic jams. This is important because it shows that even when errors can multiply, the basic patterns of physics still hold up in simple simulations.

The Bottom Line

The paper concludes that we don't need a perfect, deep, error-free quantum computer to see the "soul" of quantum physics.

• Quantitative (exact numbers) requires a deep, complex circuit.
• Qualitative (seeing the general shape, the peaks, and the jams) can be done with a shallow, simple circuit.

This is great news for today's noisy quantum computers. They might not be able to calculate the exact price of a stock or simulate a drug molecule perfectly yet, but they are already powerful enough to qualitatively demonstrate that "resonance" and "localization" exist. It's like being able to tell that it's raining just by looking at a blurry photo, without needing to count every single raindrop.

Technical Summary

Technical Summary: Qualitative Quantum Simulation of Resonant Tunneling and Localization with Shallow Quantum Circuits

Problem Statement
Digital quantum simulation typically relies on the Trotter-Suzuki decomposition to approximate continuous-time evolution via discrete-time steps. Achieving high quantitative accuracy requires a large number of Trotter steps ($N_T$), which translates to deep quantum circuits. On near-term quantum devices, such depth is prohibitive due to decoherence and imperfect control, where errors accumulate with gate count. While fault-tolerant error correction offers a theoretical solution, it currently demands excessive qubit overhead. Consequently, there is a pressing need to determine if shallow circuits (those with few Trotter steps) can still capture essential physical phenomena, even if they cannot perform precise quantitative calculations. This paper investigates whether "qualitative" observation of typical quantum phenomena—specifically resonant tunneling and localization—is feasible in the limit of large Trotter step sizes.

Methodology
The authors study the transport of a single spin excitation in a quantum transverse-field XY model using a discrete-time evolution driven by shallow quantum circuits.

• Model: The system is defined by the Hamiltonian $H = \sum J_j H^{XY}_{j,j+1} + \sum V_j H^Z_j$, where $H^{XY}$ represents nearest-neighbor interactions and $H^Z$ represents on-site potentials. The initial state is a single spin excitation at the first site ($|10...0\rangle$).
• Circuit Construction: The time evolution operator is approximated using Trotter-Suzuki decomposition. The circuit consists of $N$ qubits and $N_T$ Trotter steps. Each step comprises a layer of two-qubit gates (either XY gates or controlled-$R_x$ gates) and a layer of single-qubit $R_z$ gates. The $R_z$ gate parameters ($\phi_j = V_j \tau$) are varied to simulate changes in the on-site potential.
• Simulation Scope: The study covers system sizes $N=2$ to $N=5$. It compares the probability distribution of the spin excitation in shallow circuits (small $N_T$) against the continuous-time limit (large $N_T$) and numerical simulations.
• Error Analysis: The propagation of spin excitations is used as an analog for bit-flip errors. The authors also investigate systems where XY gates are replaced by controlled-$R_x$ gates to study how single-qubit errors might propagate into multi-qubit errors.
• Localization Study: To investigate localization, the authors introduce disorder into the $R_z$ gate parameters ($V_j$) and calculate the Inverse Participation Ratio (IPR) to measure the degree of localization.

Key Contributions and Results

1. Qualitative Resonant Tunneling in Shallow Circuits:

   • The paper demonstrates that shallow circuits can reproduce the qualitative features of resonant tunneling observed in continuous-time evolution.
   • Peak Counting Rule: For a system with $N$ sites, the continuous-time limit exhibits $n = N-2$ resonance peaks (for $N>2$). The authors find that a shallow circuit with $N_T = n + 1$ Trotter steps is sufficient to observe the same number of resonance peaks.
   • Peak Positioning: The positions of these peaks in the shallow circuit depend on the circuit parameters in a manner analogous to the continuous-time dependence on physical parameters (e.g., coupling strengths and on-site potentials). For instance, in a 5-qubit system, three peaks are observed in a 4-step circuit, with the central peak fixed and outer peaks shifting based on the disorder strength, mirroring the continuous-time behavior.
   • Experimental Verification: Experiments were conducted on the IBM Quantum device "ibmq_rome" (a 5-qubit processor). The results for a 2-qubit system with $N_T=2$ showed a single resonance peak consistent with theoretical predictions and numerical simulations, confirming the feasibility of observing these effects on current hardware.

2. Localization in Disordered Systems:

   • The study investigates spin transport in circuits with disordered $R_z$ gate configurations.
   • IPR Analysis: Numerical simulations on a 15-qubit system show that as the degree of randomness in the $R_z$ parameters increases, the average Inverse Participation Ratio (IPR) increases, indicating stronger localization.
   • Error Propagation Implication: The authors interpret the spin excitation as a proxy for a bit-flip error. The results suggest that in a disordered configuration, the probability of a single-qubit error propagating to distant qubits is significantly suppressed. This implies that disorder can naturally inhibit the spread of errors in shallow circuits.

3. Controlled-$R_x$ Gates and Multi-Qubit Errors:

   • The authors extend the analysis to circuits using controlled-$R_x$ gates, which can transform a single spin excitation into multiple excitations (analogous to a single-qubit error becoming a multi-qubit error).
   • Despite this complexity, the qualitative resonance phenomena persist in shallow circuits. Furthermore, the localization effect induced by disorder remains effective in suppressing the propagation of these multi-qubit error states to the end of the circuit.

Significance and Claims
The paper claims that the circuit depth required for the qualitative observation of typical quantum phenomena (resonant tunneling and localization) is significantly smaller than that required for quantitative computation.

• Near-Term Feasibility: This finding suggests that near-term quantum computers, which are limited by noise and gate counts, can still be utilized to qualitatively simulate and observe fundamental quantum behaviors without needing deep, fault-tolerant circuits.
• Error Understanding: The work provides a framework for using physical laws (specifically localization in disordered systems) to understand error propagation in quantum circuits. It posits that disorder in gate parameters can act as a natural barrier against the spread of bit-flip errors, protecting measurements on distant qubits.
• Scope: The authors explicitly limit their claims to qualitative agreement. They note that for larger system sizes ($N > 5$), the parameter space becomes more complex, and whether shallow circuits can capture continuous-time dynamics remains an open question. The study focuses on systems where analytical results for shallow circuits are accessible and the continuous-time behavior is inferred from Hamiltonian analysis.