arXiv subjects

Paul LeVan

Publications and source records attributed to Paul LeVan.

3 recordsLinked to original sources

arXiv2026

Scattering phase shift in quantum mechanics on quantum computers: non-Hermitian systems and imaginary-time simulations

To overcome the fast oscillatory behavior of correlation functions for extracting scattering phase shift in real-time quantum simulations encountered in Ref.\cite{Guo:2026qkx}, we propose and test two solutions in the present work. One is to simulate Hermitian systems in imaginary time, the other is to simulate non-Hermitian systems in real time. We demonstrate that both approaches lead to the problem of non-unitary quantum evolution which can be solved by combining two quantum algorithms: block encoding and Hadamard test. The combined quantum algorithm does not require mid-circuit measurements or adjustment of the input parameters of the Hamiltonian, and can be easily implemented on quantum computers. Numerical tests on quantum simulators show that both approaches agree with exact solutions for a sufficiently long time before the signal is lost in statistical fluctuations. The results bode well for using non-Hermitian and imaginary-time simulations to circumvent oscillations inherent in real-time simulation of other quantum systems. In particular, the non-Hermitian approach shows a decisive advantage over the imaginary-time one on the number of required ancillary qubits, and hence is more practical to scale up.

quant-ph↗

arXiv2026

Scattering phase shift in quantum mechanics on quantum computers

We investigate the feasibility of extracting infinite volume scattering phase shift on quantum computers in a simple one-dimensional quantum mechanical model, using the formalism established in Ref.~\cite{Guo:2023ecc} that relates the integrated correlation functions (ICF) for a trapped system to the infinite volume scattering phase shifts through a weighted integral. The system is first discretized in a finite box with periodic boundary conditions, and the formalism in real time is verified by employing a contact interaction potential with exact solutions. Quantum circuits are then designed and constructed to implement the formalism on current quantum computing architectures. To overcome the fast oscillatory behavior of the integrated correlation functions in real-time simulation, different methods of post-data analysis are proposed and discussed. Test results on IBM hardware show that good agreement can be achieved with two qubits, but complete failure ensues with three qubits due to two-qubit gate operation errors and thermal relaxation errors.

quant-ph↗

arXiv2021

Euler obstructions for the Lagrangian Grassmannian

We prove a case of a positivity conjecture of Mihalcea-Singh, concerned with the local Euler obstructions associated to the Schubert stratification of the Lagrangian Grassmannian LG(n,2n). Combined with work of Aluffi-Mihalcea-Schürmann-Su, this further implies the positivity of the Mather classes for Schubert varieties in LG(n,2n), which Mihalcea-Singh had verified for the other cominuscule spaces of classical Lie type. Building on the work of Boe and Fu, we give a positive recursion for the local Euler obstructions, and use it to show that they provide a positive count of admissible labelings of certain trees, analogous to the ones describing Kazhdan-Lusztig polynomials. Unlike in the case of the Grassmannians in types A and D, for LG(n,2n) the Euler obstructions e_{y,w} may vanish for certain pairs (y,w) with y <= w in the Bruhat order. Our combinatorial description allows us to classify all the pairs (y,w) for which e_{y,w}=0. Restricting to the big opposite cell in LG(n,2n), which is naturally identified with the space of n x n symmetric matrices, we recover the formulas for the local Euler obstructions associated with the matrix rank stratification.

math.AG↗