On Performance and Limitations of Quantum Wave Packet Dynamics Simulated using NISQ Hardware
summary
The gist
The gist The investigation explores one-dimensional wave packet dynamics using a grid-based encoding of the wave function onto qubit registers and implements time evolution via a split-operator
In short
The study simulates one-dimensional wave packet dynamics using NISQ hardware by encoding a continuous wave function onto qubits and evolving it via a split-operator method. While current hardware qualitatively reproduces small-qubit dynamics, accuracy degrades rapidly with system size on superconducting chips. Trapped-ion devices like IonQ Forte show superior agreement with classical benchmarks, highlighting the need for shallow, noise-robust circuits.
Key concepts
- Grid Encoding
- The continuous space of a wave function is mapped onto a discrete grid of points. Each point on this grid is then represented as a specific computational basis state in an n-qubit register. This allows quantum computers to represent and manipulate the wave function's spatial distribution mathematically.
- Split-Operator Method
- This technique breaks down the complex time evolution operator (governed by the Schrödinger equation) into simpler, manageable steps involving kinetic and potential energy operators separately. The total evolution is approximated by sequentially applying these short-time propagators, which simplifies the calculation for quantum simulation.
- QFT Implementation
- The kinetic energy operator is efficiently implemented using the Quantum Fourier Transform (QFT). The QFT transforms the wave function from its position representation to its momentum representation. This transformation diagonalizes the kinetic energy term, making it much easier to compute on a quantum computer.
Terminology used across episodes
This episode discusses
- On Performance and Limitations of Quantum Wave Packet Dynamics Simulated using NISQ Hardware · Paper Radio
- Quantum computing with Qiskit
The paper
On Performance and Limitations of Quantum Wave Packet Dynamics Simulated using NISQ Hardware · Read on arXiv
Chemistry Department, Marquette University · Cornell University · Los Alamos National Laboratory
We investigate one-dimensional quantum wave-packet dynamics using a grid-based encoding of the wave function onto qubit registers. Time evolution is implemented using a split operator approach, with the kinetic energy operator realized via the Quantum Fourier Transform (QFT) and arbitrary discretized potentials represented by commuting Pauli-Z gates. The algorithm is benchmarked against classical grid-based simulations and validated using a noiseless Qiskit Statevector simulator before being implemented on current quantum hardware (IBM Quantum and IonQ) for qubit counts ranging from two to five. Good agreement with benchmark calculations is obtained for two- and three-qubit implementations, while deviations increase at larger qubit counts due to hardware noise and increased circuit depth. Among the devices examined, the algorithm maintains closer agreement with the benchmark on the trapped-ion IonQ Forte processor as the number of qubits increases.
Transcript
Introduction to the show: ident: Quantum Radio. Generated commentary on the latest quantum physics and condensed matter papers.
Kai: Hi, I'm Kai.
Mira: And I'm Mira, here with Lev.
Kai: We're looking at the paper: "On Performance and Limitations of Quantum Wave Packet Dynamics Simulated using NISQ Hardware".
Mira: Here's the gist of the paper. The gist The investigation explores one-dimensional wave packet dynamics using a grid-based encoding of the wave function onto qubit registers and implements time evolution via a split-operator approach, finding that current NISQ hardware qualitatively reproduces dynamics for small qubit counts but shows increasing deviations as system size grows <ref:2605.20078#pg2> Simulation Methodology The simulation of quantum dynamical processes is central to understanding a wide range of phenomena in chemistry and physics including molecular vibrations, scattering events, tunneling, and energy transfer between molecular degrees of freedom <ref:2605.20078#pg4>.
Kai: The time evolution of the wave function is governed by the time-dependent Schrödinger equation which can be formally obtained by applying the time-evolution operator to the initial state ψ(t)⟩ = e−iHtψ(0)⟩ <ref:2605.20078#pg4>.
Mira: For one-dimensional wave packet dynamics, the continuous coordinate is discretized on a uniform grid of M = 2n points spanning the interval
rmin, rmax: with spacing Δr = (rmax − rmin)/M <ref:2605.20078#pg5>.
Kai: The discretized wave function is encoded on an n-qubit register using a direct mapping between grid points and computational basis states, ψ(t)⟩ = ∑ ψm(t) M−1 m=0 m⟩ <ref:2605.20078#pg5>.
Title and authors: Kai: So we're looking at this paper called "On Performance and Limitations of Quantum Wave Packet Dynamics Simulated using NISQ Hardware". It’s by Tamila Kuanysheva, Jonathan Andrade-Plascencia, Jayakrushna Sahoo, Brian Kendrick, and Dmitri Babikov.
Mira: Yeah, it tackles how well we can actually simulate these wave packet dynamics when we're stuck on noisy quantum hardware right now. It points out that while digital quantum simulation is promising for studying how things evolve in time like molecular vibrations or tunneling, the way we build those circuits and keep the depth manageable is a big hurdle.
Lev: Basically, it’s about taking the continuous problem of wave packet evolution and mapping it onto discrete qubit registers so we can run it on a computer. But as they point out on page one efficient operator representations and circuit depth are key challenges for near-term hardware <ref:2605.20078#pg1,efficient operator representations and circuit depth>.
Kai: Exactly. They use a grid-based encoding where the wave function is mapped onto qubit registers, and they use a split-operator approach for time evolution, which involves applying the kinetic energy operator using something called the Quantum Fourier Transform, which scales polynomially as O(n squared) <ref:2605.20078#pg5>.
Mira: And they handle the potential energy operator by expressing it through commuting Pauli-Z gates, which is a clever way to incorporate arbitrary discretized potentials into the quantum circuit <ref:2605.20078#pg4>. It's much better than just brute force decomposition of the entire Hamiltonian.
Lev: That’s the efficiency gain they highlight; instead of scaling exponentially with the number of degrees of freedom, which is what you see when you try to decompose the full Pauli Hamiltonian, this method keeps things at a manageable structure <ref:2605.20078#pg5>.
Kai: They show that for small qubit counts, say two or three qubits, this approach can reproduce the qualitative dynamics for problems like propagation on a flat potential or tunneling through a barrier <ref:2605.20078#pg6>.
Mira: That’s where they get interesting. They compare performance across different hardware platforms and find that while some superconducting devices do well, the agreement gets worse as the system size grows <ref:2605.20078#pg7>.
Title and authors: Lev: I mean, for real hardware, if you're running simulations on a few qubits, things look okay because of the fidelity on those specific chips. But Lev here thinks that for three qubits, IBM Boston actually did better than Miami and Torino <ref:2605.20078#pg7>.
Kai: And then they bring in trapped-ion hardware, like IonQ Forte one which shows a significantly better agreement with the benchmark dynamics <ref:2605.20078#pg7>. That’s a key piece of data for what’s actually built.
Mira: The paper also breaks down the results for specific problems, like free particle propagation where the wave packet width goes from zero point three six Bohr at zero time to one point zero seven Bohr at the final time <ref:2605.20078#pg9>. That shows it’s actually simulating physical things correctly, not just abstract math.
Lev: And for the tunneling problem, the probability of finding the particle in a right well increases steadily, reaching about seven to ten percent at the end time <ref:2605.20078#pg10>. That’s concrete evidence that the dynamics are working as expected on these small systems.
Kai: What this means for us on the ground is that current quantum hardware can reproduce the qualitative features of quantum dynamics for a few qubits, but we have to be careful about scaling up <ref:2605.20078#pg8>.
Mira: And they stress that accuracy deteriorates rapidly for superconducting platforms as qubit counts increase, which really reflects the accumulation of gate errors and circuit depth limitations <ref:2605.20078#pg8>.
Lev: From an error-correction standpoint, that’s a big concern because those accumulating errors mean the simulation fidelity drops fast. For real hardware, you need to design circuits that minimize depth and are robust to noise <ref:2605.20078#pg8>.
Kai: So the paper points toward a design philosophy where circuit depth is really important for making these simulations work on existing NISQ devices. It’s not just about having more qubits, it’s about how you connect them.
Mira: They suggest that future scalable implementations will need circuit designs that are shallow and robust against hardware noise, which is a practical constraint we have to deal with right now <ref:2605.20078#pg8>.
Lev: And for me, from an engineering standpoint, it means we should focus on minimizing the number of gates in the sequence. That’s where the overhead really lands when you try to run these complex time evolution operators on actual noisy hardware <ref:2605.20078#pg8>.
Title and authors: Kai: So that's what this paper shows us—we can get qualitative results on small systems, and we know exactly where the limitations of current hardware lie when we try to push those qubit counts higher <ref:2605.20078#pg1>
Mira: The implication is that simulating complex quantum dynamics isn't just a matter of having more qubits; it’s fundamentally about the structure and depth of the circuit we build, especially when using NISQ devices <ref:2605.20078#pg4>.
Lev: We need those shallow circuits to actually run this kind of simulation reliably on the hardware we have today, which is where the real work is happening for error correction protocols <ref:2605.20078#pg8>.
Kai: So we’ve seen that current quantum hardware can reproduce qualitative features of quantum dynamics for small number of qubits, and the comparison between platforms like superconducting and trapped-ion gives us a clearer picture of where things stand <ref:2605.20078#pg7>.
Mira: It shows that even when we have good hardware, the complexity of the underlying physics means that accuracy drops fast as you increase the system size, which is something we need to keep in mind <ref:2605.20078#pg8>.
Lev: So for anyone working on error correction protocols, this tells you that you’re going to need very carefully designed circuits because the noise accumulation will be significant if you try to run long-time simulations <ref:two thousand six hundred five point two zero zero seven eight#pg1.
Kai: So, in summary of "On Performance and Limitations of Quantum Wave Packet Dynamics Simulated using NISQ Hardware", we see that the simulation framework is sound for small systems, but hardware noise and circuit depth are the real killers when you try to scale up <ref:2605.20078#pg8>.
Mira: It confirms that digital quantum simulation is a viable route for studying dynamics, but it puts a strong emphasis on efficient operator representations to keep the circuit manageable <ref:two thousand six hundred five point two zero zero seven eight#pg1.
Lev: And for anyone looking at building real hardware, this research gives us the roadmap on what kind of circuits we need to design—specifically those that are shallow and robust against noise <ref:2605.20078#pg8>.
Kai: That's it for this one. So, next time we talk about quantum dynamics, remember that while the theory is powerful, the hardware constraints are what really dictate what we can actually measure right now <ref:two thousand six hundred five point two zero zero seven eight#pg1.
The paper's summary: Kai: So, to wrap up what we’ve seen so far on this paper "On Performance and Limitations of Quantum Wave Packet Dynamics Simulated using NISQ Hardware," it boils down to this: they used a grid method to map the wave function onto qubits and used a split-operator technique for time evolution, and they found that while you can get qualitatively correct physics for small systems, the accuracy drops fast as you try to scale up.
Mira: That’s right. The paper shows that even though we have these clever ways to represent kinetic and potential energy operators—like using the Quantum Fourier Transform for momentum or Pauli-Z strings for position—the real challenge isn't just getting the math right on paper, it's making those circuits deep enough to run on current noisy hardware without everything breaking down.
Lev: From my side, what they’re showing is that the overhead really lands in circuit depth when you try to simulate these kinds of time-evolution problems. When you move from two qubits to three or four, and especially when you look at superconducting platforms, those deviations from the benchmark start getting pretty pronounced very quickly.
Kai: And that hardware comparison they did? It really highlights how different architectures behave under the same kind of simulation stress. They found that for instance, trapped-ion processors like IonQ Forte one showed much better agreement with the classical benchmarks than most superconducting devices when simulating free particle propagation or tunneling.
Mira: That makes sense from a theoretical standpoint because the connectivity and coherence properties in those ion traps seem to handle these specific dynamics more gracefully than what we’re seeing on current superconducting circuits. The result they get for three qubits on IBM Boston was better than Miami and Torino, but even then, deviations are still happening across the board.
Lev: What this means for us is that if you want to actually run a simulation of molecular vibrations or any complex system with time evolution on NISQ hardware, you have to be very mindful of circuit depth. You need designs that are shallow and can handle the noise accumulation before the simulation completely drifts away from reality.
Kai: Exactly. So while this research confirms that current quantum hardware can capture the qualitative features of dynamics for small qubit counts, it also sets a clear warning sign about how quickly things break down when you push those system sizes higher on existing devices.
Mira: It’s a practical constraint, really. The paper isn't just proving that the physics works; it's telling us exactly what kind of circuit design we need to focus on if we want to actually use this approach for larger, more meaningful simulations in the near term.
Lev: So what’s next? We’re going to look at how these simulation techniques might be adapted for error correction protocols that you’ve been working on, because managing that noise accumulation is exactly what they flagged as the big hurdle here.
The paper's improvements: Tom: So, we're moving on to what the authors suggest is better for this kind of simulation work, right? They aren't just saying how bad current hardware is; they’re pointing toward specific design choices that will make these kinds of simulations actually runnable.
Kai: They are suggesting that instead of just throwing more qubits at the problem, we need to focus intensely on circuit depth and making sure those circuits are robust against noise. That's the main direction they're pushing for in terms of practical implementation.
Mira: They’re emphasizing that we need to develop circuit designs that minimize depth, because that’s where the error accumulation really starts getting bad on these superconducting platforms, which is what they observed as system size increased.
Lev: I agree with Mira there. From an error-correction standpoint, if you have a deep circuit trying to simulate something like wave packet evolution over a long time, you're going to end up with way too much noise because of the accumulated gate errors.
Kai: So, the implication for me as someone working on hardware is that we need to be designing circuits that are inherently shallow. We can’t just build a deep chain of gates and hope the physics holds up over time.
Mira: Exactly. They’re looking at how to take their efficient operator representations—those Pauli-Z strings and the QFT implementation—and integrate them into circuit structures that naturally stay shallow, rather than letting the required decomposition force a deep structure.
Lev: And if we look at it through an error-correction lens, minimizing depth directly translates to reducing the noise budget you need to worry about for logical state preparation or time evolution. It’s a direct trade-off between simulation complexity and hardware stability.
Kai: So, the takeaway here is that for anyone building these quantum simulators today, the focus has shifted from just maximizing qubit count to optimizing circuit structure and robustness against those inevitable noise sources.
Mira: It’s about making the approach more scalable by tackling the structural issues of circuit depth head-on instead of just hoping hardware gets better at handling long, complicated sequences.
Lev: That brings us right back to the next big question: how can we actually build these shallow, robust circuits efficiently without sacrificing accuracy?
Conclusion: Kai: So, to wrap up this whole discussion on "On Performance and Limitations of Quantum Wave Packet Dynamics Simulated using NISQ Hardware," we've seen that this grid-based approach works well for small systems, but the performance drops rapidly as you increase the qubit count on current superconducting hardware.
Mira: Yeah, it confirms that while the underlying mathematical framework is solid—using QFT for momentum and Pauli-Z strings for position—the practical reality is that circuit depth and noise are what really limit how big these simulations can get right now.
Lev: I just want to reiterate that if we try to run these kinds of long-time evolution problems on real hardware, the overhead from gate errors becomes too much too fast, so minimizing depth is a non-negotiable design principle for this type of work.
Kai: It’s clear that for two or three qubits, we get pretty good results with things like IBM Boston or IonQ Forte one, but as soon as you push it to four qubits in the harmonic oscillator case, the agreement starts to stretch thin.
Mira: That tells us that we can't just aim for "more qubits" as a solution; we have to design circuits that are intrinsically better at handling these time-evolution operators in a shallow way.
Lev: And for future error correction work, this simulation result is important because it shows us the specific kind of circuit complexity we’re facing when we try to model these dynamics on actual quantum processors.
Kai: Ultimately, the paper confirms that current hardware can reproduce qualitative features of quantum dynamics for small qubit counts, but it also sets a very clear roadmap for what scalable implementations need to look like.
Mira: It puts the emphasis squarely on efficient operator representations and circuit structure because that’s where we can actually make these simulations more useful in the near term.
Lev: So, if we want to push error correction protocols further, we need to keep this simulation result in mind about how quickly fidelity degrades with system size.
Kai: That's it for this one on "On Performance and Limitations of Quantum Wave Packet Dynamics Simulated using NISQ Hardware." It shows us that while the theory is powerful, the hardware constraints are what really dictate what we can actually measure right now.
Mira: It’s a good reminder that simulating complex quantum dynamics isn't just about having more qubits; it’s fundamentally about the structure and depth of the circuit we build.
Lev: For anyone building real hardware, this research gives us the roadmap on what kind of circuits we need to design—specifically those that are shallow and robust against noise.
Kai: Next time we talk about quantum dynamics, remember that while the theory is powerful, the hardware constraints are what really dictate what we can actually measure right now.
More episodes
- Daily Summary for 2026-10-21
- 2312.04033-One-dimensional hydrogenic ions with screened nuclear Coulomb field
- 2410.03572-Compressing multivariate functions with tree tensor networks
- 2512.13809-Universal Statistics of Measurement-Induced Entanglement in Tomonaga-Luttinger liquids
- 2604.04778-QCommute: a tool for symbolic computation of nested commutators in quantum many-body spin-1/2 systems
- 2607.26122-Qubit-qubit-qutrit quantum correlations in H to f f V
- 2604.02307-Detecting Symmetry-Resolved Entanglement: A Quantum Monte Carlo Approach
- 2604.18705-Conformal Data for the O(2) Wilson-Fisher CFT in (2+1) -Dimensional Spacetime from Exact Diagonalization and Matrix Product States on the Fuzzy Sphere
- 2604.21563-Dynamical mean-field theory for dense spin systems at finite temperature
- 2210.15338-Quantum entanglement and contextuality with complexifications of E 8 root system