SearcharxivSearch

arXiv · 2507.17225

Nontrivial local observables and impermeable and permeable boundary conditions for 1D KFGM particles

Abstract

Real solutions of the 1D Klein-Fock-Gordon (KFG) equation automatically cancel out the usual two-vector current density; consequently, the respective continuity equation is trivially satisfied, and a globally conserved quantity cannot be obtained. Additionally, distinguishing between impermeable and permeable boundary conditions (BCs) at a given point is not possible. We address these first-quantized conflicts by using the simplest nontrivial local observables, i.e., an energy density and an energy current density, which allows us to characterize a strictly neutral 1D KFG particle, i.e., a 1D KFG-Majorana (KFGM) particle, when it is confined to an interval and when it is restricted, e.g., in an interval with transparent walls. All the BCs for this system are extracted from the pseudo self-adjointness of the Feshbach-Villars (FV) Hamiltonian plus two Majorana conditions. We show that these energy densities are components of an unusual energy-momentum tensor and can satisfy a continuity equation, leading to a conserved quantity for all available BCs. Moreover, the energy current density can characterize all the BCs as either impermeable or permeable. In contrast, the commonly used energy current density -- a component of the usual energy-momentum tensor -- cannot characterize all the BCs. Additionally, this quantity and its respective energy density -- another component of the usual energy-momentum tensor -- may not lead to a conserved quantity. We also obtain the BCs for which the abovementioned densities and those commonly used are equally satisfactory. In fact, this occurs only for four impermeable BCs and a one-parameter set of permeable BCs. Our results highlight the important role played by the BCs when they are imposed on a system in which particles occupy a finite region.

Explore related subjects

Keep this discovery

BibTeXRIS

Techapon Kampu, Salvatore De Vincenzo. 2025-07-23. Nontrivial local observables and impermeable and permeable boundary conditions for 1D KFGM particles. https://doi.org/10.1007/s13538-026-02072-0

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph