Extracting scattering phase shift in quantum mechanics on quantum computers
- URL: http://arxiv.org/abs/2601.04092v1
- Date: Wed, 07 Jan 2026 16:59:20 GMT
- Title: Extracting scattering phase shift in quantum mechanics on quantum computers
- Authors: Peng Guo, Paul LeVan, Frank X. Lee, Yong Zhao,
- Abstract summary: We investigate the feasibility of extracting infinite volume scattering phase shift on quantum computers in a simple one-dimensional quantum mechanical model.<n>We use the formalism established in Ref.citeGuo:2023ecc that relates the integrated correlation functions (ICF) for a trapped system to the infinite volume scattering phase shifts through a weighted integral.
- Score: 9.057428395961264
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: 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.
Related papers
- Quantum Phase Transitions in the Transverse-Field Ising Model: A Comparative Study of Exact, Variational, and Hardware-Based Approaches [0.0]
This paper will study the ground state properties and quantum critical dynamics of the one-dimensional transverse field Ising model.<n>We focus on a lattice of four spins, where we calculate the ground-state energies, magnetic order parameters and correlation functions.<n>We find that the ground-state energies of shallow variational circuits are reliably captured by the circuit over the entire parameter space.
arXiv Detail & Related papers (2026-01-24T16:26:15Z) - Variational Quantum Simulations of a Two-Dimensional Frustrated Transverse-Field Ising Model on a Trapped-Ion Quantum Computer [0.6990493129893112]
We use the Variational Quantum Eigensolver (VQE) to compute the phases on a square lattice with periodic boundary conditions for a system of 16 sites (qubits)<n>We focus on the ground-state phase transitions of this model, where VQE succeeds in finding the dominant magnetic phases.<n>Our experiments show near perfect recovery of the magnetic phases of the frustrated model through ground-state energy, the energy derivative, and the spin correlation functions.
arXiv Detail & Related papers (2025-05-28T23:20:20Z) - Dynamical simulations of many-body quantum chaos on a quantum computer [3.731709137507907]
We study a class of maximally chaotic circuits known as dual unitary circuits.
We show that a superconducting quantum processor with 91 qubits is able to accurately simulate these correlators.
We then probe dynamics beyond exact verification, by perturbing the circuits away from the dual unitary point.
arXiv Detail & Related papers (2024-11-01T17:57:13Z) - Quantum error mitigation for Fourier moment computation [49.1574468325115]
This paper focuses on the computation of Fourier moments within the context of a nuclear effective field theory on superconducting quantum hardware.
The study integrates echo verification and noise renormalization into Hadamard tests using control reversal gates.
The analysis, conducted using noise models, reveals a significant reduction in noise strength by two orders of magnitude.
arXiv Detail & Related papers (2024-01-23T19:10:24Z) - A quantum computing concept for 1-D elastic wave simulation with exponential speedup [0.0]
We present a quantum computing concept for 1-D elastic wave propagation in heterogeneous media.
The method rests on a finite-difference approximation, followed by a sparsity-preserving transformation of the discrete elastic wave equation to a Schr"odinger equation.
An implementation on an error-free quantum simulator verifies our approach and forms the basis of numerical experiments.
arXiv Detail & Related papers (2023-12-22T14:58:01Z) - Simulating the Mott transition on a noisy digital quantum computer via
Cartan-based fast-forwarding circuits [62.73367618671969]
Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model.
Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models.
This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
arXiv Detail & Related papers (2021-12-10T17:32:15Z) - Probing quantum information propagation with out-of-time-ordered
correlators [41.12790913835594]
Small-scale quantum information processors hold the promise to efficiently emulate many-body quantum systems.
Here, we demonstrate the measurement of out-of-time-ordered correlators (OTOCs)
A central requirement for our experiments is the ability to coherently reverse time evolution.
arXiv Detail & Related papers (2021-02-23T15:29:08Z) - Continuous-time dynamics and error scaling of noisy highly-entangling
quantum circuits [58.720142291102135]
We simulate a noisy quantum Fourier transform processor with up to 21 qubits.
We take into account microscopic dissipative processes rather than relying on digital error models.
We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
arXiv Detail & Related papers (2021-02-08T14:55:44Z) - Fusion-based quantum computation [43.642915252379815]
Fusion-based quantum computing (FBQC) is a model of universal quantum computation in which entangling measurements, called fusions, are performed on qubits of small constant-sized entangled resource states.
We introduce a stabilizer formalism for analyzing fault tolerance and computation in these schemes.
This framework naturally captures the error structure that arises in certain physical systems for quantum computing, such as photonics.
arXiv Detail & Related papers (2021-01-22T20:00:22Z) - Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor.
We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
arXiv Detail & Related papers (2021-01-21T22:18:49Z) - Robust decompositions of quantum states [0.0]
We establish a classical-quantum complexity equivalence using a noisy quantum circuit model.
We construct two distinct variants, both of which are compatible with machine-learning methodology.
They both enable efficiently computable lower bounds on von Neumann entropy and thus can be used as finite-temperature variational quantum Monte Carlo methods.
arXiv Detail & Related papers (2020-03-09T14:28:04Z) - Quantum Statistical Complexity Measure as a Signalling of Correlation
Transitions [55.41644538483948]
We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions.
We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain.
We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
arXiv Detail & Related papers (2020-02-05T00:45:21Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.