Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2501.07211 · Physical Review A

Tensor-decomposition technique for qubit encoding of maximal-fidelity Lorentzian orbitals in real-space quantum chemistry

Taichi Kosugi, Xinchi Huang, Hirofumi Nishi, Yu‐ichiro Matsushita

Published May 16, 2025• 2 citations
arXivHTMLPDF

Abstract

To simulate the real- and imaginary-time evolution of a many-electron system on a quantum computer based on the first-quantized formalism, we need to encode molecular orbitals (MOs) into qubit states for typical initial-state preparation. We propose an efficient scheme for encoding an MO as a many-qubit state from a Gaussian-type solution that can be obtained from a tractable solver on a classical computer. We employ the discrete Lorentzian functions (LFs) as a fitting basis set, for which we maximize the fidelity to find the optimal Tucker-form state to represent a target MO. For ${n}_{\mathrm{prod}}$ three-dimensional LFs, we provide the explicit circuit construction for the state preparation involving $O({n}_{\mathrm{prod}})$ cnot gates. Furthermore, we introduce a tensor decomposition technique to construct a canonical-form state to approximate the Tucker-form state with controllable accuracy. Rank-$R$ decomposition reduces the cnot gate count to $O(R{n}_{\mathrm{prod}}^{1/3}).$ We demonstrate via numerical simulations that the proposed scheme is a powerful tool for encoding MOs of various quantum chemical systems, paving the way for first-quantized calculations using hundreds or more logical qubits.

DOI
10.1103/physreva.111.052615

Related papers

Efficient State Preparation for the Quantum Simulation of Molecules in First Quantization

William J. Huggins, Oskar Leimkuhler, Torin F. Stetina +1 more

The quantum simulation of real molecules and materials is one of the most highly anticipated applications of quantum computing. Algorithms for simulating electronic structure using a first-quantized plane-wave representation are especially promising due to their asymptotic efficiency. However, previous proposals for preparing initial states for these simulation algorithms scale poorly with the size of the basis set. We address this shortcoming by showing how to efficiently map states defined in a Gaussian-type orbital basis to a plane-wave basis with a scaling that is logarithmic in the number of plane waves. Our key technical result is a proof that molecular orbitals constructed from Gaussian-type basis functions can be compactly represented in a plane-wave basis using matrix product states. While we expect that other approaches could achieve the same logarithmic scaling with respect to basis-set size, our proposed state-preparation technique is also highly efficient in practice. For example, in a series of numerical experiments on small molecules, we find that our approach allows us to prepare an approximation to the Hartree-Fock state using orders of magnitude fewer non-Clifford gates than a naive approach. By resolving the issue of state preparation, our work allows for the first quantum simulation of molecular systems the end-to-end complexity of which is truly sublinear in the basis-set size.

arXiv:2407.00249•PRX Quantum•Apr 28, 2025•11 citations

An efficient quantum algorithm for preparing states of molecular systems

Hefeng Wang, Sahel Ashhab, Franco Nori

We present an efficient quantum algorithm for preparing a pure state on a quantum computer, where the quantum state corresponds to that of a molecular system with a given number $m$ of electrons occupying a given number $n$ of spin orbitals. Each spin orbital is mapped to a qubit: the states $| 1 >$ and $| 0>$ of the qubit represent, respectively, whether the spin orbital is occupied by an electron or not. To prepare a general state in the full Hilbert space of $n$ qubits, which is of dimension $2^{n}$%, $O(2^{n})$ CNOT gates are needed, i.e. the number of gates scales \emph{% exponentially} with the number of qubits. We make use of the fact that the state to be prepared lies in a smaller Hilbert space, and we find an algorithm that requires at most $O((2 n)^{m}/{m!})$ CNOT gates, i.e. scales \emph{polynomially} with the number of qubits $n$, provided $n\gg m$. The algorithm is simulated numerically to prepare the electronic states of the hydrogen molecule and the water molecule. We show that when additional symmetries of the system are considered, the number of gates to prepare the state can be reduced dramatically.

•Feb 9, 2009•2 citations

A Tensor-product approach for large scale electronic structure calculations using Kohn–Sham density functional theory

Phani Motamarri, Vikram Gavini, Thomas Blesgen

Quantum-mechanical calculations based on Kohn–Sham density functional theory (DFT) played a significant role in accurately predicting various aspects of materials behavior over the past decade. The Kohn–Sham approach to DFT reduces the many-body Schrodinger (eigen value) problem of interacting electrons into an equivalent problem of noninteracting electrons in an effective mean field that is governed by electron-density. Despite the reduced computational complexity of Kohn–Sham DFT, large-scale DFT calculations are still computationally very demanding with the resulting computational complexity scaling cubically with number of atoms in a given materials system. Numerical algorithms with reduced scaling behavior which are robust, computationally efficient and scalable on parallel computing architectures are always desirable to enable simulations at larger scales and on more complex systems. Following this line of thought, this study explores the use of tensor structured methods for ab-initio numerical solution of Kohn–Sham equations arising in DFT calculations. Earlier studies on tensor-structured methods have been quite successful in the accurate calculation of Hartree and the nonlocal exchange operators arising in the Hartree–Fock equations. A recent investigation of low-rank Tucker-type decomposition of the electron-density of large aluminum clusters (obtained from the finite-element discretization of orbital free DFT) shows the exponential decay of approximation error with respect to Tucker rank (number of tensor-basis functions in Tucker type representation). The results also indicate a smaller Tucker rank for the accurate representation of the electron density and is only weakly dependent on the system sizes studied. The promising success of tensor-structured techniques in resolving the electronic structure of material systems has enabled us to take a step further. In this study, we propose a systematic way of computing a globally adapted Tucker-type basis for solving the Kohn–Sham DFT problem by using a separable approximation of the Kohn–Sham Hamiltonian. Further, the resulting Kohn–Sham eigenvalue problem is projected into the aforementioned Tucker basis and is solved for ground-state energy using a self-consistent field iteration. The rank of the resulting Tucker representation and the computational complexity of the calculation are examined on representative benchmark examples involving metallic and insulating systems.

•Jan 1, 2014•0 citations

Exponentially More Precise Algorithms for Quantum Simulation of Quantum Chemistry

Annie Y. Wei

In quantum chemistry, the "electronic structure problem" refers to the process of numerically solving Schrodinger's equation for a given molecular system. These calculations rank among the most CPU-intensive computations that are performed nowadays, yet they are also crucial to the design of new drugs and materials. The idea behind quantum simulation of quantum chemistry is that a quantum computer could perform such calculations in a manner that is exponentially more efficient than what a classical computer could accomplish. In fact, quantum simulation is quite possibly the application most naturally suited to a quantum computer. In this work we introduce novel algorithms for the simulation of quantum chemistry, algorithms that are exponentially more precise than previous algorithms in the literature. Previous algorithms are based on the Trotter-Suzuki decomposition and scale like the inverse of the desired precision, while our algorithms represent the first practical application of the recently developed truncated Taylor series approach, and they achieve scaling that is logarithmic in the inverse of the precision. We explore algorithms for both second-quantized and first-quantized encodings of the chemistry Hamiltonian, where the second-quantized encoding requires $\\mathcal{O}(N)$ qubits for an $N$ spin-orbital system, and the highly compressed first-quantized encoding requires $\\mathcal{O}(\\eta)$ qubits, where $\\eta<<N$ is the number of electrons in the system. We first introduce a second-quantized algorithm that uses pre-computed molecular integrals, resulting in a gate count that scales like $\\widetilde{\\cal O}(N^8t)$. Next we introduce algorithms that compute molecular integrals on the fly by carefully discretizing these integrals. Indeed, figuring out how to evaluate the integrals in an efficient manner is one of the main challenges of applying the truncated Taylor series approach to the chemistry problem: the complexity of a general quantum algorithm is traditionally formulated in terms of the number of queries made to an oracle whose assumption we just assume, but in this case, we actually construct the oracle for our specific problem. The evaluation of the oracle itself requires evaluating molecular integrals, which adds additional complexity to an algorithm. We find that the gate count of the second-quantized on-the-fly algorithm scales like $\\widetilde{\\cal O}(N^5t)$. We also find that the first-quantized on-the-fly algorithm, which uses the configuration interaction (CI) matrix representation of the Hamiltonian, requires at most $\\widetilde{\\cal O}(\\eta^2N^3t)$ gates. In general, the discovery of exponentially more precise algorithms will allow for the simulation of larger molecular systems than was previously possible under Trotter-based methods. In addition, the results here can be generalized to the simulation of other fermionic systems beyond the electronic structure problem.

•Jun 21, 2016•0 citations

Clifford-efficient sparse state preparation for molecular wavefunctions

Yingrong Chen, Nathan A. Baker, Rushi Gong +7 more

Sparse quantum state preparation concerns an $n$-qubit target state that is a superposition of only $d \ll 2^n$ computational basis states. Existing approaches exploit this sparsity by compressing these $d$ basis states and their amplitudes onto a smaller set of qubits, called the dense register, before expanding the prepared state to the full register. Rather than relying on the permutation-based compression used in prior work, we exploit affine relationships among the binary configurations over the finite field $\operatorname{GF}(2)$ to reduce both the non-Clifford gate count and the ancillary qubit count. Invertible affine transformations over $\operatorname{GF}(2)$, comprising Gaussian elimination and all-ones-row removal, first reduce the dense register from $n$ to the rank $r$ using only Clifford gates and no ancillary qubits. An optional binary encoding stage then trades additional Toffoli gates and ancillary qubits for further compression to the minimum $\lceil\log_2 d\rceil$ dense qubits needed to represent $d$ distinct configurations. For chemically relevant wavefunctions, such as those obtained from selected configuration interaction calculations, shared electronic excitation patterns produce many of these affine relationships, enabling substantial Clifford-only compression before binary encoding. Across the molecular benchmarks, our method requires the fewest ancillary qubits among the evaluated sparse state preparation methods while maintaining comparable non-Clifford gate counts when using binary encoding.

quant-pharXiv:2608.20593•Aug 24, 2026•0 citations

Quantum-Enhanced Computational Catalysis: Optimizing Reaction Pathway Simulations with Advanced Tensor Decomposition Techniques

Başar Ertonga

Quantum-enhanced computational catalysis offers a transformative framework for modeling complex reaction pathways with unprecedented accuracy and scalability. As catalytic processes often involve strongly correlated electrons, multidimensional potential energy surfaces, and dynamic coupling between nuclear and electronic degrees of freedom, classical simulation methods face steep computational barriers. This study explores a hybrid quantum–classical workflow that integrates quantum algorithms for electronic structure with advanced tensor decomposition techniques to compress, analyze, and optimize high-dimensional reaction data. By leveraging tensor-network representations—such as matrix product states, tensor-train formats, and hierarchical Tucker decompositions—the approach systematically reduces computational cost while maintaining chemically relevant accuracy. The research demonstrates how tensor-optimized quantum simulations can accelerate transition-state discovery, enhance reaction pathway resolution, and improve predictions of catalytic efficiency across heterogeneous, homogeneous, and photocatalytic systems. The synergy between quantum solvers and tensor decomposition establishes a powerful platform for next-generation catalytic modeling and materials discovery.

Next generation.•Nov 21, 2025•0 citations
To simulate the real- and imaginary-time evolution of a many-electron system on a quantum computer based on the first-quantized formalism, we need to encode molecular orbitals (MOs) into qubit states for typical initial-state preparation. We propose an efficient scheme for encoding an MO as a many-qubit state from a Gaussian-type solution that can be obtained from a tractable solver on a classical computer. We employ the discrete Lorentzian functions (LFs) as a fitting basis set, for which we maximize the fidelity to find the optimal Tucker-form state to represent a target MO. For nprod{n}_{\mathrm{prod}}nprod​ three-dimensional LFs, we provide the explicit circuit construction for the state preparation involving O(nprod)O({n}_{\mathrm{prod}})O(nprod​) cnot gates. Furthermore, we introduce a tensor decomposition technique to construct a canonical-form state to approximate the Tucker-form state with controllable accuracy. Rank-RRR decomposition reduces the cnot gate count to O(Rnprod1/3).O(R{n}_{\mathrm{prod}}^{1/3}).O(Rnprod1/3​). We demonstrate via numerical simulations that the proposed scheme is a powerful tool for encoding MOs of various quantum chemical systems, paving the way for first-quantized calculations using hundreds or more logical qubits.
The quantum simulation of real molecules and materials is one of the most highly anticipated applications of quantum computing. Algorithms for simulating electronic structure using a first-quantized plane-wave representation are especially promising due to their asymptotic efficiency. However, previous proposals for preparing initial states for these simulation algorithms scale poorly with the size of the basis set. We address this shortcoming by showing how to efficiently map states defined in a Gaussian-type orbital basis to a plane-wave basis with a scaling that is logarithmic in the number of plane waves. Our key technical result is a proof that molecular orbitals constructed from Gaussian-type basis functions can be compactly represented in a plane-wave basis using matrix product states. While we expect that other approaches could achieve the same logarithmic scaling with respect to basis-set size, our proposed state-preparation technique is also highly efficient in practice. For example, in a series of numerical experiments on small molecules, we find that our approach allows us to prepare an approximation to the Hartree-Fock state using orders of magnitude fewer non-Clifford gates than a naive approach. By resolving the issue of state preparation, our work allows for the first quantum simulation of molecular systems the end-to-end complexity of which is truly sublinear in the basis-set size.
We present an efficient quantum algorithm for preparing a pure state on a quantum computer, where the quantum state corresponds to that of a molecular system with a given number mmm of electrons occupying a given number nnn of spin orbitals. Each spin orbital is mapped to a qubit: the states ∣1>| 1 >∣1> and ∣0>| 0>∣0> of the qubit represent, respectively, whether the spin orbital is occupied by an electron or not. To prepare a general state in the full Hilbert space of nnn qubits, which is of dimension 2n2^{n}2n%, O(2n)O(2^{n})O(2n) CNOT gates are needed, i.e. the number of gates scales \emph{% exponentially} with the number of qubits. We make use of the fact that the state to be prepared lies in a smaller Hilbert space, and we find an algorithm that requires at most O((2n)m/m!)O((2 n)^{m}/{m!})O((2n)m/m!) CNOT gates, i.e. scales \emph{polynomially} with the number of qubits nnn, provided n≫mn\gg mn≫m. The algorithm is simulated numerically to prepare the electronic states of the hydrogen molecule and the water molecule. We show that when additional symmetries of the system are considered, the number of gates to prepare the state can be reduced dramatically.
Quantum-mechanical calculations based on Kohn–Sham density functional theory (DFT) played a significant role in accurately predicting various aspects of materials behavior over the past decade. The Kohn–Sham approach to DFT reduces the many-body Schrodinger (eigen value) problem of interacting electrons into an equivalent problem of noninteracting electrons in an effective mean field that is governed by electron-density. Despite the reduced computational complexity of Kohn–Sham DFT, large-scale DFT calculations are still computationally very demanding with the resulting computational complexity scaling cubically with number of atoms in a given materials system. Numerical algorithms with reduced scaling behavior which are robust, computationally efficient and scalable on parallel computing architectures are always desirable to enable simulations at larger scales and on more complex systems. Following this line of thought, this study explores the use of tensor structured methods for ab-initio numerical solution of Kohn–Sham equations arising in DFT calculations. Earlier studies on tensor-structured methods have been quite successful in the accurate calculation of Hartree and the nonlocal exchange operators arising in the Hartree–Fock equations. A recent investigation of low-rank Tucker-type decomposition of the electron-density of large aluminum clusters (obtained from the finite-element discretization of orbital free DFT) shows the exponential decay of approximation error with respect to Tucker rank (number of tensor-basis functions in Tucker type representation). The results also indicate a smaller Tucker rank for the accurate representation of the electron density and is only weakly dependent on the system sizes studied. The promising success of tensor-structured techniques in resolving the electronic structure of material systems has enabled us to take a step further. In this study, we propose a systematic way of computing a globally adapted Tucker-type basis for solving the Kohn–Sham DFT problem by using a separable approximation of the Kohn–Sham Hamiltonian. Further, the resulting Kohn–Sham eigenvalue problem is projected into the aforementioned Tucker basis and is solved for ground-state energy using a self-consistent field iteration. The rank of the resulting Tucker representation and the computational complexity of the calculation are examined on representative benchmark examples involving metallic and insulating systems.
In quantum chemistry, the "electronic structure problem" refers to the process of numerically solving Schrodinger's equation for a given molecular system. These calculations rank among the most CPU-intensive computations that are performed nowadays, yet they are also crucial to the design of new drugs and materials. The idea behind quantum simulation of quantum chemistry is that a quantum computer could perform such calculations in a manner that is exponentially more efficient than what a classical computer could accomplish. In fact, quantum simulation is quite possibly the application most naturally suited to a quantum computer. In this work we introduce novel algorithms for the simulation of quantum chemistry, algorithms that are exponentially more precise than previous algorithms in the literature. Previous algorithms are based on the Trotter-Suzuki decomposition and scale like the inverse of the desired precision, while our algorithms represent the first practical application of the recently developed truncated Taylor series approach, and they achieve scaling that is logarithmic in the inverse of the precision. We explore algorithms for both second-quantized and first-quantized encodings of the chemistry Hamiltonian, where the second-quantized encoding requires mathcalO(N)\\mathcal{O}(N)mathcalO(N) qubits for an NNN spin-orbital system, and the highly compressed first-quantized encoding requires mathcalO(eta)\\mathcal{O}(\\eta)mathcalO(eta) qubits, where eta<<N\\eta<<Neta<<N is the number of electrons in the system. We first introduce a second-quantized algorithm that uses pre-computed molecular integrals, resulting in a gate count that scales like widetildecalO(N8t)\\widetilde{\\cal O}(N^8t)widetildecalO(N8t). Next we introduce algorithms that compute molecular integrals on the fly by carefully discretizing these integrals. Indeed, figuring out how to evaluate the integrals in an efficient manner is one of the main challenges of applying the truncated Taylor series approach to the chemistry problem: the complexity of a general quantum algorithm is traditionally formulated in terms of the number of queries made to an oracle whose assumption we just assume, but in this case, we actually construct the oracle for our specific problem. The evaluation of the oracle itself requires evaluating molecular integrals, which adds additional complexity to an algorithm. We find that the gate count of the second-quantized on-the-fly algorithm scales like widetildecalO(N5t)\\widetilde{\\cal O}(N^5t)widetildecalO(N5t). We also find that the first-quantized on-the-fly algorithm, which uses the configuration interaction (CI) matrix representation of the Hamiltonian, requires at most widetildecalO(eta2N3t)\\widetilde{\\cal O}(\\eta^2N^3t)widetildecalO(eta2N3t) gates. In general, the discovery of exponentially more precise algorithms will allow for the simulation of larger molecular systems than was previously possible under Trotter-based methods. In addition, the results here can be generalized to the simulation of other fermionic systems beyond the electronic structure problem.
Sparse quantum state preparation concerns an nnn-qubit target state that is a superposition of only d≪2nd \ll 2^nd≪2n computational basis states. Existing approaches exploit this sparsity by compressing these ddd basis states and their amplitudes onto a smaller set of qubits, called the dense register, before expanding the prepared state to the full register. Rather than relying on the permutation-based compression used in prior work, we exploit affine relationships among the binary configurations over the finite field GF⁡(2)\operatorname{GF}(2)GF(2) to reduce both the non-Clifford gate count and the ancillary qubit count. Invertible affine transformations over GF⁡(2)\operatorname{GF}(2)GF(2), comprising Gaussian elimination and all-ones-row removal, first reduce the dense register from nnn to the rank rrr using only Clifford gates and no ancillary qubits. An optional binary encoding stage then trades additional Toffoli gates and ancillary qubits for further compression to the minimum ⌈log⁡2d⌉\lceil\log_2 d\rceil⌈log2​d⌉ dense qubits needed to represent ddd distinct configurations. For chemically relevant wavefunctions, such as those obtained from selected configuration interaction calculations, shared electronic excitation patterns produce many of these affine relationships, enabling substantial Clifford-only compression before binary encoding. Across the molecular benchmarks, our method requires the fewest ancillary qubits among the evaluated sparse state preparation methods while maintaining comparable non-Clifford gate counts when using binary encoding.
Quantum-enhanced computational catalysis offers a transformative framework for modeling complex reaction pathways with unprecedented accuracy and scalability. As catalytic processes often involve strongly correlated electrons, multidimensional potential energy surfaces, and dynamic coupling between nuclear and electronic degrees of freedom, classical simulation methods face steep computational barriers. This study explores a hybrid quantum–classical workflow that integrates quantum algorithms for electronic structure with advanced tensor decomposition techniques to compress, analyze, and optimize high-dimensional reaction data. By leveraging tensor-network representations—such as matrix product states, tensor-train formats, and hierarchical Tucker decompositions—the approach systematically reduces computational cost while maintaining chemically relevant accuracy. The research demonstrates how tensor-optimized quantum simulations can accelerate transition-state discovery, enhance reaction pathway resolution, and improve predictions of catalytic efficiency across heterogeneous, homogeneous, and photocatalytic systems. The synergy between quantum solvers and tensor decomposition establishes a powerful platform for next-generation catalytic modeling and materials discovery.