Amplitude Encoding of Slater-Type Orbitals via Matrix Product States: Efficient State Preparation and Integral Evaluation on Quantum Hardware
- URL: http://arxiv.org/abs/2604.26314v2
- Date: Thu, 30 Apr 2026 11:15:00 GMT
- Title: Amplitude Encoding of Slater-Type Orbitals via Matrix Product States: Efficient State Preparation and Integral Evaluation on Quantum Hardware
- Abstract summary: Slater-type orbitals (STOs) provide the physically correct description of atomic wavefunctions.<n>We present a systematic study of amplitude encoding of STOs on quantum computers using matrix product states (MPS)
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Slater-type orbitals (STOs) provide the physically correct description of atomic wavefunctions but have been largely replaced by Gaussian-type orbitals in computational chemistry due to the lack of closed-form multi-center integrals. We present a systematic study of amplitude encoding of STOs on quantum computers using matrix product states (MPS). For one-dimensional orbital functions of the form $p_d(x) e^{-ζx}$, we derive analytical MPS constructions with constant bond dimension $χ= d + 1$, requiring $O(n)$ classical and quantum resources for $n$-qubit registers with no grid sampling. We demonstrate a complete one-electron integral pipeline -- overlap, kinetic energy, and nuclear attraction -- in one dimension, validating the overlap and kinetic energy on IBM Heron processors at 5~qubits with 0.67\% hardware-induced error using Zero-Noise Extrapolation. In three dimensions, we compute multi-center overlap integrals between 1s and 2s orbitals in Cartesian coordinates with 0.02\% discretization error at 18~qubits. A systematic entanglement analysis reveals that the MPS bond dimension of three-dimensional STOs in Cartesian coordinates saturates with increasing grid resolution -- reaching $\sim$138 for the hydrogen 1s orbital at 12~qubits per coordinate -- establishing bounded encoding complexity rather than the exponential scaling initially expected. The SVD truncation threshold provides a practical resource parameter, reducing the bond dimension to 39 at threshold $10^{-6}$ with negligible accuracy loss. These results map the entanglement landscape for amplitude encoding of atomic orbitals and establish MPS-based state preparation as a viable path toward exact STO basis sets on quantum computers.
Related papers
- Qutrit-Native Spatial-Orbital Encoding for Resource-Efficient Quantum Chemistry Simulation [0.0]
Additional levels in a qudit can represent physically relevant correlations when the algorithmic design reflects the underlying physics of the problem.<n>We demonstrate this principle for quantum chemistry simulation using a qutrit-native spatial-orbital encoding.<n>Compared with a conventional qubit-based UCCSD approach, the qutrit scheme requires half as many quantum units.
arXiv Detail & Related papers (2026-08-16T06:55:07Z) - Mapping photon-number regimes in single-emitter lasers [41.99844472131922]
We present a numerical analysis of an open quantum system consisting of an incoherently pumped three-level emitter strongly coupled to a single cavity mode.<n>We find that laser behavior can emerge from minimal photon populations.<n>Our findings can be applied to define the operational limits of single-emitter light sources.
arXiv Detail & Related papers (2026-06-30T07:10:49Z) - Applications of quantum annealing to magnetic dipole hyperfine structure constants: First results beyond energies for atoms [0.0]
First results of the magnetic dipole hyperfine structure (HFS) constants of neutral $mathrmLi$, Li-like $mathrmBe$, neutral $mathrmNa$, and Na-like $mathrmMg$ using a modified version of the Quantum Annealer Eigensolver (QAE) algorithm on D-Wave's quantum hardware.
arXiv Detail & Related papers (2026-06-18T12:33:53Z) - SpinGQE: A Generative Quantum Eigensolver for Spin Hamiltonians [42.007194397302825]
Ground state search is central to quantum computing.<n>We present SpinGQE, an extension of the Generative Quantum Eigensolver framework to spin Hamiltonians.<n>We employ a transformer-based decoder to learn over quantum circuits that produce low-energy states.
arXiv Detail & Related papers (2026-03-25T13:38:15Z) - Unsupervised Discovery of Intermediate Phase Order in the Frustrated $J_1$-$J_2$ Heisenberg Model via Prometheus Framework [0.0]
We apply the Prometheus variational autoencoder framework to explore the $J_1$-$J$ phase diagram.<n>We identify the structure factor $S(,)$ and $S(,)$ as the dominant order parameters.<n>This work establishes a scalable pathway for applying machine learning to frustrated quantum systems.
arXiv Detail & Related papers (2026-02-25T00:44:51Z) - ATLAS: Efficient Atom Rearrangement for Defect-Free Neutral-Atom Quantum Arrays Under Transport Loss [46.043413607980845]
Neutral-atom quantum computers encode qubits in individually trapped atoms arranged in optical lattices.<n>Algorithm converts a randomly loaded $W times W$ lattice into a defect-free $L times L$ subarray.<n>Algorithm achieves sublinear move scaling and linear growth of required initial size with target dimension.
arXiv Detail & Related papers (2025-11-20T12:32:35Z) - Quantum sensor network metrology with bright solitons [39.58317527488534]
General Heisenberg Limit (GHL) characterizes fundamental limitations for unknown parameter measurement and estimation accuracy.<n>Three-mode soliton Josephson junction (TMSJJ) system as a three mode extension for the soliton Josephson junction (SJJ) bosonic model.<n>Our findings open new prospects for quantum network sensorics with atomtronic circuits.
arXiv Detail & Related papers (2025-07-21T08:01:36Z) - Augmenting Simulated Noisy Quantum Data Collection by Orders of Magnitude Using Pre-Trajectory Sampling with Batched Execution [47.60253809426628]
We present the Pre-Trajectory Sampling technique, increasing efficiency and utility of trajectory simulations by tailoring error types.<n>We generate massive datasets of one trillion and one million shots, respectively.
arXiv Detail & Related papers (2025-04-22T22:36:18Z) - ByteQC: GPU-Accelerated Quantum Chemistry Package for Large-Scale Systems [11.912905578735497]
ByteQC is a fully-functional and efficient package for large-scale quantum chemistry simulations.<n>For standalone algorithms, the benchmark results demonstrate up to a 60$times$ speedup when compared to 100-core CPUs.<n>For the advanced quantum embedding feature, two representative examples are demonstrated.
arXiv Detail & Related papers (2025-02-25T08:37:12Z) - Hybrid Oscillator-Qubit Quantum Processors: Simulating Fermions, Bosons, and Gauge Fields [31.51988323782987]
We develop a hybrid oscillator-qubit processor framework for quantum simulation of strongly correlated fermions and bosons.
This framework gives exact decompositions of particle interactions as well as approximate methods based on the Baker-Campbell Hausdorff formulas.
While our work focusses on an implementation in superconducting hardware, our framework can also be used in trapped ion, and neutral atom hardware.
arXiv Detail & Related papers (2024-09-05T17:58:20Z) - A distributed multi-GPU ab initio density matrix renormalization group
algorithm with applications to the P-cluster of nitrogenase [1.7444066202370399]
We present the first distributed multi- GPU (Graphics Processing Unit) emphab initio density matrix renormalization (DMRG) algorithm.
We are able to reach an unprecedentedly large bond dimension $D=14000$ on 48 GPU.
This is nearly three times larger than the bond dimensions reported in previous DMRG calculations for the same system using only CPUs.
arXiv Detail & Related papers (2023-11-06T04:01:26Z) - Optimal Particle-Conserved Linear Encoding for Practical Fermionic Simulation [8.725181592083521]
Number-conserved subspace encoding reduces resources needed for quantum simulations.<n>We study qubit-gate-measurement trade-offs through the lens of classical/quantum error correction complexity.<n>We propose the Fermionic Expectation Decoder for scalable probability decoding in $mathcalO(M4)$ bases.
arXiv Detail & Related papers (2023-09-17T20:29:21Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z)
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.