Optimizing Quantum Chemistry Simulations with a Hybrid Quantization Scheme

• URL: http://arxiv.org/abs/2507.04253v1
• Date: Sun, 06 Jul 2025 06:06:48 GMT
• Title: Optimizing Quantum Chemistry Simulations with a Hybrid Quantization Scheme
• Authors: Calvin Ku, Yu-Cheng Chen, Alice Hu, Min-Hsiu Hsieh,
• Abstract summary: We propose a hybrid quantization scheme for electronic simulations that employs a conversion circuit to switch efficiently between the two quantizations.<n>This way, plane-wave Hamiltonian simulations can be done efficiently in the first-quantization before converting to the second quantization.<n>We discuss applications of this hybrid quantization scheme to bring improvements in the characterization of ground-state and excited-state properties.
• Score: 11.915190522925199
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Unlike classical algorithms, where second quantization is ubiquitous, the nature of quantum computers enables both the first- and second-quantized representations to be on somewhat equal footing. While quantum algorithms of both quantizations provide advantages over classical algorithms for ground state calculation and time-evolution, they face distinct limitations and inefficiencies in addressing real-world molecular and material simulation problems. As an example, the first-quantized representation is unsuitable for calculating electron non-conserving properties, such as dynamic correlations. Conversely, the ground-state molecular orbital wavefunction efficiently prepared in the second quantization may benefit from efficient first-quantized measurement circuits. In light of this, we propose a hybrid quantization scheme for electronic simulations that employs a conversion circuit to switch efficiently between the two quantizations, achieving a gate cost of $\mathcal{O}(N\log N \log M)$ and requiring $\mathcal{O}(N \log M)$ qubits for a system of $N$ electrons and $M$ orbitals. This way, plane-wave Hamiltonian simulations can be done efficiently in the first-quantization before converting to the second quantization to apply electron non-conserving operations. Similarly, second-quantized Hamiltonian simulation algorithms can take advantage of efficient measurement circuits originally designed for the first-quantized representation. We discuss applications of this hybrid quantization scheme to bring polynomial circuit improvements in the characterization of ground-state and excited-state properties, and in performing ab-initio molecular dynamics (AIMD) calculations.

Related papers

• Quantum Simulation of Two-Level $PT$-Symmetric Systems Using Hermitian Hamiltonians [0.0]
  We present a method for simulating the quantum dynamics of $PT$-symmetric systems on unitary-gate-based quantum computers.<n>We introduce two algorithms for simulating $PT$-symmetric systems near exceptional points where eigenvalues and eigenstates coalesce.<n>We then use perturbation theory to extend this method to consider the dynamics of two weakly interacting $PT$-symmetric systems.
  arXiv  Detail & Related papers  (2025-07-10T19:40:31Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Enhancing Scalability of Quantum Eigenvalue Transformation of Unitary Matrices for Ground State Preparation through Adaptive Finer Filtering [0.13108652488669736]
  Hamiltonian simulation is a domain where quantum computers have the potential to outperform classical counterparts.<n>One of the main challenges of such quantum algorithms is increasing the system size.<n>We present an approach to improve the scalability of eigenspace filtering for the ground state preparation of a given Hamiltonian.
  arXiv  Detail & Related papers  (2024-01-17T09:52:24Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Iterative Qubit Coupled Cluster using only Clifford circuits [36.136619420474766]
  An ideal state preparation protocol can be characterized by being easily generated classically. We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC) We demonstrate the algorithm's correctness in ground-state simulations and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space.
  arXiv  Detail & Related papers  (2022-11-18T20:31:10Z)
• Quantum algorithms for grid-based variational time evolution [36.136619420474766]
  We propose a variational quantum algorithm for performing quantum dynamics in first quantization. Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
  arXiv  Detail & Related papers  (2022-03-04T19:00:45Z)
• Recompilation-enhanced simulation of electron-phonon dynamics on IBM Quantum computers [62.997667081978825]
  We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems. We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling. Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
  arXiv  Detail & Related papers  (2022-02-16T19:00:00Z)
• Efficient Fully-Coherent Quantum Signal Processing Algorithms for Real-Time Dynamics Simulation [3.3917542048743865]
  We develop fully-coherent simulation algorithms based on quantum signal processing (QSP) We numerically analyze these algorithms by applying them to the simulation of spin dynamics of the Heisenberg model.
  arXiv  Detail & Related papers  (2021-10-21T17:56:33Z)
• Quantum-Classical Hybrid Algorithm for the Simulation of All-Electron Correlation [58.720142291102135]
  We present a novel hybrid-classical algorithm that computes a molecule's all-electron energy and properties on the classical computer. We demonstrate the ability of the quantum-classical hybrid algorithms to achieve chemically relevant results and accuracy on currently available quantum computers.
  arXiv  Detail & Related papers  (2021-06-22T18:00:00Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Orbital transformations to reduce the 1-norm of the electronic structure Hamiltonian for quantum computing applications [0.0]
  We investigate the effect of classical pre-optimization of the electronic structure Hamiltonian representation, via single-particle basis transformation, on the "1-norm" We derive a new formula for the 1-norm as a function of the electronic integrals, and use this quantity as a cost function for an orbital-optimization scheme.
  arXiv  Detail & Related papers  (2021-03-26T22:05:42Z)
• Low-depth Hamiltonian Simulation by Adaptive Product Formula [3.050399782773013]
  Various Hamiltonian simulation algorithms have been proposed to efficiently study the dynamics of quantum systems on a quantum computer. Here, we propose an adaptive approach to construct a low-depth time evolution circuit. Our work sheds light on practical Hamiltonian simulation with noisy-intermediate-scale-quantum devices.
  arXiv  Detail & Related papers  (2020-11-10T18:00:42Z)

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.