⚛️ quantum physics

First-Quantized Relativistic Quantum Simulation with Periodic and Dirichlet Boundary Conditions

This paper presents a first-quantized methodology for simulating relativistic quantum systems on one-dimensional finite domains under periodic and Dirichlet boundary conditions, utilizing reconstructed momentum moments and specific measurement protocols to validate energy estimation against benchmark potentials.

Original authors: Jeongho Bang, Timothy P. Spiller, Kyunghyun Baek, Kyoungho Cho, Jaewoo Joo

Published 2026-06-23

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Jeongho Bang, Timothy P. Spiller, Kyunghyun Baek, Kyoungho Cho, Jaewoo Joo

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to simulate how a tiny particle moves through space using a quantum computer. In the real world, particles can move at speeds close to light, which means we have to use "relativistic" physics (Einstein's rules) rather than just the simple, slow-moving rules of everyday life.

This paper presents a new "instruction manual" for how to do this simulation on a quantum computer, specifically for two different types of "playgrounds" or boundaries where the particle is trapped.

Here is the breakdown of their work using simple analogies:

1. The Two Playgrounds: A Race Track vs. A Bounded Room

The authors focus on two ways to define the edges of the space where the particle lives:

Periodic Boundary Conditions (PBC): The Infinite Race Track.
Imagine a race track where the finish line connects directly back to the starting line. If the particle runs off the right edge, it instantly reappears on the left. It's a closed loop, like a circle.
Dirichlet Boundary Conditions (DBC): The Bounded Room.
Imagine a particle trapped in a box with solid walls. If it hits the wall, it stops (the wave function becomes zero). It cannot wrap around; it's an open chain with distinct start and end points.

The Problem: Quantum computers naturally like to do things in loops (like the race track). When you try to simulate the "room" (the box), the computer's natural tendency to wrap around creates "ghost connections" between the start and end of the room that shouldn't exist.

2. The Solution: Fixing the "Ghost" Connections

The authors figured out how to build a simulation that works for both the race track and the room using the same basic tools, but with a special "patch" for the room.

For the Race Track (PBC): They use the computer's natural "cyclic shift" (moving everything one step forward, where the last one goes to the front). This works perfectly because the track is a loop.
For the Room (DBC): They start with the same "cyclic shift" but then add a correction layer. Think of it like building a model of a room using a circular table. You build the table, but then you have to physically cut the connection between the "end" and the "start" of the table and add special "wall sensors" at the very edges to make sure the particle knows it's in a room, not a loop.

3. The "Relativistic" Twist: Measuring Speed Squared and Speed to the Fourth

In simple physics, kinetic energy is just about how fast something is moving (speed squared). But in relativistic physics (near light speed), the math gets more complex. You have to account for "speed to the fourth power" to get an accurate result.

The paper explains how to measure these complex "speed moments" on a quantum computer:

The Race Track: You just need to measure how the particle shifts around the loop once and twice.
The Room: You measure the shifts plus you check the "edges" of the room. You ask: "Is the particle at the very start? Is it at the very end? Is it hovering between the start and the end?" These edge checks cancel out the "ghost" wrap-around connections.

4. The Workflow: How the Simulation Runs

The authors propose a step-by-step recipe (an algorithm) for anyone running this simulation:

Prepare the State: Get the particle ready in your quantum computer.
Measure the Shifts: Run a specific test to see how the particle moves around the grid (this gives you the main kinetic energy).
Apply the Boundary Patch:
- If it's a Race Track, you're done with the kinetic part.
- If it's a Room, you take a few extra quick measurements at the very edges to fix the "wrap-around" error.
Measure the Position: Check where the particle is to calculate the potential energy (like gravity or electric fields).
Combine: Add the kinetic and potential energies together to get the total energy.

5. Did It Work? (The Validation)

The authors tested their method with several scenarios to prove it works:

The Empty Track: They simulated a particle with no obstacles. The results matched the perfect mathematical formulas for a race track.
The Empty Room: They simulated a particle in a box. Their "patched" method gave the exact same answer as doing the math directly on a supercomputer, proving the "edge sensors" worked perfectly.
Bumpy Roads: They added hills and valleys (potentials) to the track and the room. The method still worked, accurately predicting the particle's energy.
Real-World Noise: They simulated what happens if you don't have infinite time to measure (finite "shots"). They showed that the errors decrease exactly as expected (the more you measure, the more accurate it gets), just like flipping a coin more times gives you a better idea of the odds.

Summary

This paper provides a universal toolkit for simulating fast-moving particles on quantum computers. It solves the tricky problem of how to handle "loops" (race tracks) versus "walls" (rooms) without needing entirely different hardware. By using a clever "correction patch" for the rooms, they ensure the simulation stays physically accurate, whether the particle is running in circles or bouncing off walls.

Technical Summary: First-Quantized Relativistic Quantum Simulation with Periodic and Dirichlet Boundary Conditions

Problem Statement
Relativistic quantum simulation on finite domains faces a fundamental challenge: the relativistic kinetic energy operator is a nonlinear function of momentum, requiring the estimation of higher-order momentum moments (specifically $\langle \hat{p}^2 \rangle$ and $\langle \hat{p}^4 \rangle$ in the weakly relativistic regime). In first-quantized grid encodings using qubit registers, the natural shift operation is cyclic. While this cyclic translation perfectly matches Periodic Boundary Conditions (PBC), it introduces unphysical "wrap-around" couplings for Dirichlet Boundary Conditions (DBC), where the wavefunction must vanish at the boundaries. Existing methods often treat boundary conditions as an afterthought to discretization; however, this work argues that boundary conditions are intrinsic to the definition of the finite-domain Hamiltonian, necessitating distinct lattice momentum operators and estimation strategies for PBC and DBC.

Methodology
The authors develop a framework for simulating the positive-energy relativistic single-particle operator on a 1D finite interval of length $R$ using an $L$ -qubit position register ( $N=2^L$ grid points).

Hamiltonian Formulation:
- Weakly Relativistic Expansion: The relativistic kinetic operator $\hat{T}_{rel}$ is expanded to fourth order in momentum: $\hat{T}_{rel} \approx \frac{\hat{p}^2}{2m} - \frac{\hat{p}^4}{8m^3c^2}$ .
- PBC Implementation: The lattice momentum operator $\hat{P}_P$ is defined via a unitary cyclic translation operator $\hat{A}$ . The moments $\langle \hat{P}_P^2 \rangle$ and $\langle \hat{P}_P^4 \rangle$ are expressed entirely in terms of the real parts of translation moments $\langle \hat{A} \rangle$ and $\langle \hat{A}^2 \rangle$ .
- DBC Implementation: The target is an open-chain finite-difference operator. The authors construct this by taking the cyclic operator (evaluated with DBC grid spacing) and adding boundary-local correction terms to cancel the unphysical wrap-around link. The operator $\hat{P}_D$ is decomposed into a cyclic part plus terms involving boundary projectors ( $\hat{E}_0, \hat{E}_1, \hat{E}_2$ ) that depend only on endpoint probabilities and near-endpoint coherences.
Quantum Estimators:
- Translation Moments: For both PBC and the bulk of DBC, the real parts of $\langle \hat{A}^l \rangle$ ( $l=1, 2$ ) are estimated using a Hadamard-test-style circuit with a controlled-unitary primitive.
- Boundary Overlaps: For DBC, the correction terms are estimated using a "boundary-overlap identity." This method reconstructs coherences $\langle |f\rangle\langle g| + |g\rangle\langle f| \rangle$ using only computational basis probabilities ( $P_f, P_g$ ) and the probability of the superposition state $|s^+_{fg}\rangle = (|f\rangle + |g\rangle)/\sqrt{2}$ . This avoids the need for complex phase estimation or full state tomography.
- Potential Energy: Diagonal potentials are estimated via direct position-basis sampling and classical post-processing.

Key Contributions

Boundary-Resolved Hamiltonians: The formulation of weakly relativistic lattice Hamiltonians that explicitly distinguish between PBC and DBC, ensuring the momentum operators are consistent with the physical boundary constraints of the domain.
Estimator Decomposition: The derivation of observable estimators that reconstruct the required $\langle \hat{P}^2 \rangle$ and $\langle \hat{P}^4 \rangle$ moments. Crucially, the DBC estimator is shown to be a decomposition of the cyclic estimator plus a finite set of boundary-local terms, rather than a fundamentally different measurement primitive.
Validation Framework: A comprehensive validation strategy separating three distinct error sources: finite-grid discretization, weak-relativistic truncation, and statistical measurement error.

Results
The framework was validated analytically and numerically across several benchmarks:

PBC Free Particle: Demonstrated that the lattice dispersion relation converges to the continuum relativistic energy as grid size increases, with the perturbative estimator correctly capturing the truncation error relative to the exact square-root lattice energy.
DBC Infinite Square Well: Verified that the boundary-corrected cyclic estimator reproduces the exact eigenvalues of the open-chain finite-difference operator (and the analytic sine spectrum) with machine-precision agreement (relative discrepancies $< 10^{-11}$ ).
Smooth Potentials: Tested on periodic cosine (PBC) and harmonic (DBC) potentials. The full energy workflow (kinetic + potential) showed visual indistinguishability between direct matrix evaluation and the estimator reconstruction, with maximum absolute differences on the order of $10^{-7}$ .
Statistical Scaling: Finite-shot simulations confirmed that the root-mean-square error (RMSE) of the kinetic energy estimators scales as $O(M^{-1/2})$ with the number of shots $M$ , consistent with standard statistical expectations. The DBC estimator exhibited a slightly larger prefactor due to additional boundary measurements but maintained the same asymptotic scaling.

Significance and Claims
The paper claims to establish a compact and systematic methodology for relativistic quantum simulation that respects boundary conditions as a fundamental component of the Hamiltonian definition. The authors emphasize that their approach does not require qualitatively new measurement primitives for the leading relativistic correction; it simply extends the set of measured observables from $\langle \hat{A} \rangle$ to $\langle \hat{A} \rangle, \langle \hat{A}^2 \rangle$ and, for DBC, a small set of boundary-overlap terms.

The work is explicitly framed for the weakly relativistic regime, where the state's momentum support is small compared to $mc$. The authors note that the validity of the simulation depends on the physical state satisfying this condition, not on the estimator identities themselves, which remain exact for the defined lattice operators. The framework is presented as a practical step toward reliable relativistic simulations of continuum systems, with the potential to be extended to more complex potentials and geometries.