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:1902.08625 · npj Quantum Information

A quantum solution for efficient use of symmetries in the simulation of many-body systems

Albert T. Schmitz, Sonika Johri

Published Jan 8, 2020• 7 citations
arXivHTMLPDF

Abstract

Abstract A many-body Hamiltonian can be block-diagonalized by expressing it in terms of symmetry-adapted basis states. Finding the group orbit representatives of these basis states and their corresponding symmetries is currently a memory/computational bottleneck on classical computers during exact diagonalization. We apply Grover’s search in the form of a minimization procedure to solve this problem. Our quantum solution provides an exponential reduction in memory, and a quadratic speedup in time over classical methods. We discuss explicitly the full circuit implementation of Grover minimization as applied to this problem, finding that the oracle only scales as polylog in the size of the group, which acts as the search space. Further, we design an error mitigation scheme that, with no additional qubits, reduces the impact of bit-flip errors on the computation, with the magnitude of mitigation directly correlated with the error rate, improving the utility of the algorithm in the Noisy Intermediate Scale Quantum era.

DOI
10.1038/s41534-019-0232-1

Related papers

Qubit-efficient encoding scheme for quantum simulations of electronic structure

Yu Shee, Pei-Kai Tsai, Cheng-Lin Hong +2 more

Simulating electronic structure on a quantum computer requires encoding of fermionic systems onto qubits. Common encoding methods transform a fermionic system of $N$ spin-orbitals into an $N$-qubit system, but many of the fermionic configurations do not respect the required conditions and symmetries of the system so the qubit Hilbert space in this case may have unphysical states and thus cannot be fully utilized. We propose a generalized qubit-efficient encoding (QEE) scheme that requires the qubit number to be only logarithmic in the number of configurations that satisfy the required conditions and symmetries. For the case of considering only the particle-conserving and singlet configurations, we reduce the qubit count to an upper bound of $\mathcal{O}(m{log}_{2}N)$, where $m$ is the number of particles. This QEE scheme is demonstrated on an ${\mathrm{H}}_{2}$ molecule in the 6-31G basis set and a $\mathrm{LiH}$ molecule in the STO-3G basis set using fewer qubits than the common encoding methods. We calculate the ground-state energy surfaces using a variational quantum eigensolver algorithm with a hardware-efficient ansatz circuit. We choose to use a hardware-efficient ansatz since most of the Hilbert space in our scheme is spanned by desired configurations so a heuristic search for an eigenstate is sensible. The simulations are performed on IBM Quantum machines and the Qiskit simulator with a noise model implemented from a IBM Quantum machine. Using the methods of measurement error mitigation and error-free linear extrapolation, we demonstrate that most of the distributions of the extrapolated energies using our QEE scheme agree with the exact results obtained by Hamiltonian diagonalization in the given basis sets within chemical accuracy. Our proposed scheme and results show the feasibility of quantum simulations for larger molecular systems in the noisy intermediate-scale quantum (NISQ) era. The number of terms in the Hamiltonian has an upper bound of $\mathcal{O}(\frac{{N}^{2m+1}}{(m\ensuremath{-}1)!\phantom{\rule{0.16em}{0ex}}m!})$ for the QEE scheme while it scales as $\mathcal{O}({N}^{4})$ for the Jordan-Wigner encoding scheme. Nevertheless, we present several cases where QEE is useful.

arXiv:2110.04112•Physical Review Research•May 27, 2022•53 citations

Sublattice coding algorithm and distributed memory parallelization for large-scale exact diagonalizations of quantum many-body systems

Alexander Wietek, Andreas Martin Läuchli

We present algorithmic improvements for fast and memory-efficient use of discrete spatial symmetries in exact diagonalization computations of quantum many-body systems. These techniques allow us to work flexibly in the reduced basis of symmetry-adapted wave functions. Moreover, a parallelization scheme for the Hamiltonian-vector multiplication in the Lanczos procedure for distributed memory machines avoiding load-balancing problems is proposed. We demonstrate that using these methods low-energy properties of systems of up to 50 spin-$1/2$ particles can be successfully determined.

arXiv:1804.05028•Physical review. E•Sep 26, 2018•60 citations

Electronic structure theory with molecular point group symmetries on quantum annealers

Joseph Desroches, Sijia S. Dong

Quantum computation has the potential to revolutionize quantum chemistry through major speedups in computation times and an exponential reduction in computational resources. Here, we combine the symmetry-adapted Jordan-Wigner encoding based on the full Boolean symmetry group Z2k with our new implementation of the Xia-Bian-Kais (XBK) method for improving the efficiency of electronic structure theory calculations on quantum annealers, particularly by reducing the number of qubits needed to achieve the same accuracy. By providing a more extensive symmetry-adapted encoding (SAE) than previous work, we are able to simulate molecules larger than those previously reported that have been studied using methods developed for quantum annealers and without using an active space. We calculated the potential energy surfaces of H2, LiH, He2, H2O, O2, N2, Li2, F2, CO, BH3, NH3, and CH4, with the largest molecule in the STO-6G basis set requiring 16 qubits with our SAE, and compared them with full configuration interaction results. The application of SAE to the XBK method provides an exponential reduction in the size of the Hilbert space and scales well with the size of the problem. It does not introduce significant additional errors for even or large values of a key variational parameter that determines the number of ancilla qubits used in the XBK method's Hamiltonian embedding, or for certain molecules such as He2 and H2O. We provide an explanation for this behavior and a recommendation on the usage of our method. In addition, we briefly discuss the potential of extracting electronic excited states from our method.

arXiv:2502.00235•The Journal of Chemical Physics•Jun 24, 2025•2 citations

The Quadratic Leap: How Grover's Algorithm is Redefining Core Problems in Computer Science and Engineering

Palaganti Venkata Nagendra Sai Sandeep

Grover's algorithm stands as a cornerstone of quantum computing, offering a theoretical quadratic speedup for unstructured search problems. This allows for finding a target item in an unsorted database of N entries in approximately the square root of N steps, a significant improvement over classical algorithms which require a number of operations on the order of N in the worst case. This speedup becomes particularly compelling for very large datasets, where classical exhaustive search becomes computationally intractable. The algorithm achieves this by leveraging fundamental quantum mechanical principles, primarily superposition and interference. It operates by preparing qubits in a uniform superposition of all possible states, then iteratively applying a quantum oracle to mark the desired state by flipping its phase, followed by a diffusion operator that amplifies the probability of the marked state. Despite its theoretical promise, real-world implementation faces substantial challenges stemming from Noisy Intermediate-Scale Quantum (NISQ) hardware, which is characterized by high error rates and short coherence times. Consequently, achieving a true, scalable quantum advantage remains a future endeavor, contingent on significant hardware advancements. Nevertheless, Grover's algorithm holds significant potential across diverse fields, including enhancing brute-force attacks on cryptographic systems, accelerating solutions for optimization problems, and speeding up search processes in machine learning and unstructured database queries.

•Aug 2, 2025•2 citations

Near-term Quantum Algorithms for Quantum Many-body Systems

Mark B. Ritter

Abstract There has been a good deal of work on algorithms to simulate quantum many-body systems with fault-tolerant quantum computers- those with full error correction. Fault-tolerant quantum computers of scale requisite to achieve computational advantage for these problems are likely over a decade away. Moreover, devices that we can build in the near term, called Noisy Intermediate Scale Quantum computers (NISQ), have too much noise to implement the long circuits required by these algorithms. We review heuristic, short-depth quantum algorithms more suited to NISQ computers; specifically, their scaling properties when applied to electronic and nuclear structure calculations, including Hamiltonian complexity with particle number, ansatz state preparation, convergence, and noise. We will present examples of actual quantum structure calculations with NISQ computers, as well as a newly-developed error mitigation technique that significantly improves accuracy. We end with an outlook for “advantage” – when NISQ systems might excel conventional HPC approaches for comparable problems.

Journal of Physics Conference Series•Oct 1, 2019•10 citations

Progress toward larger molecular simulation on a quantum computer: Simulating a system with up to 28 qubits accelerated by point-group symmetry

Changsu Cao, Jiaqi Hu, Wengang Zhang +7 more

The exact evaluation of the molecular ground state in quantum chemistry requires an exponentially increasing computational cost. Quantum computation is a promising way to overcome the exponential problem using polynomial-time quantum algorithms. A quantum-classical hybrid optimization scheme known as the variational quantum eigensolver is preferred for noisy intermediate-scale quantum devices. However, the circuit depth becomes one of the bottlenecks of its application to large molecules of more than 20 qubits. In this work, we employ point-group symmetry to reduce the number of operators in constructing ansatz so as to achieve a more compact quantum circuit. We illustrate this methodology with a series of molecules ranging from LiH (12 qubits) to ${\mathrm{C}}_{2}{\mathrm{H}}_{4}$ (28 qubits). A significant reduction of up to 82% of the operator numbers is reached on ${\mathrm{C}}_{2}{\mathrm{H}}_{4}$. This also sheds light onto further work in this direction to construct even shallower ansatz with enough expressive power and simulate even larger scale systems.

arXiv:2109.02110•Physical Review A•Jun 27, 2022•85 citations
Abstract A many-body Hamiltonian can be block-diagonalized by expressing it in terms of symmetry-adapted basis states. Finding the group orbit representatives of these basis states and their corresponding symmetries is currently a memory/computational bottleneck on classical computers during exact diagonalization. We apply Grover’s search in the form of a minimization procedure to solve this problem. Our quantum solution provides an exponential reduction in memory, and a quadratic speedup in time over classical methods. We discuss explicitly the full circuit implementation of Grover minimization as applied to this problem, finding that the oracle only scales as polylog in the size of the group, which acts as the search space. Further, we design an error mitigation scheme that, with no additional qubits, reduces the impact of bit-flip errors on the computation, with the magnitude of mitigation directly correlated with the error rate, improving the utility of the algorithm in the Noisy Intermediate Scale Quantum era.
Simulating electronic structure on a quantum computer requires encoding of fermionic systems onto qubits. Common encoding methods transform a fermionic system of NNN spin-orbitals into an NNN-qubit system, but many of the fermionic configurations do not respect the required conditions and symmetries of the system so the qubit Hilbert space in this case may have unphysical states and thus cannot be fully utilized. We propose a generalized qubit-efficient encoding (QEE) scheme that requires the qubit number to be only logarithmic in the number of configurations that satisfy the required conditions and symmetries. For the case of considering only the particle-conserving and singlet configurations, we reduce the qubit count to an upper bound of O(mlog2N)\mathcal{O}(m{log}_{2}N)O(mlog2​N), where mmm is the number of particles. This QEE scheme is demonstrated on an H2{\mathrm{H}}_{2}H2​ molecule in the 6-31G basis set and a LiH\mathrm{LiH}LiH molecule in the STO-3G basis set using fewer qubits than the common encoding methods. We calculate the ground-state energy surfaces using a variational quantum eigensolver algorithm with a hardware-efficient ansatz circuit. We choose to use a hardware-efficient ansatz since most of the Hilbert space in our scheme is spanned by desired configurations so a heuristic search for an eigenstate is sensible. The simulations are performed on IBM Quantum machines and the Qiskit simulator with a noise model implemented from a IBM Quantum machine. Using the methods of measurement error mitigation and error-free linear extrapolation, we demonstrate that most of the distributions of the extrapolated energies using our QEE scheme agree with the exact results obtained by Hamiltonian diagonalization in the given basis sets within chemical accuracy. Our proposed scheme and results show the feasibility of quantum simulations for larger molecular systems in the noisy intermediate-scale quantum (NISQ) era. The number of terms in the Hamiltonian has an upper bound of $\mathcal{O}(\frac{{N}^{2m+1}}{(m\ensuremath{-}1)!\phantom{\rule{0.16em}{0ex}}m!})$ for the QEE scheme while it scales as O(N4)\mathcal{O}({N}^{4})O(N4) for the Jordan-Wigner encoding scheme. Nevertheless, we present several cases where QEE is useful.
We present algorithmic improvements for fast and memory-efficient use of discrete spatial symmetries in exact diagonalization computations of quantum many-body systems. These techniques allow us to work flexibly in the reduced basis of symmetry-adapted wave functions. Moreover, a parallelization scheme for the Hamiltonian-vector multiplication in the Lanczos procedure for distributed memory machines avoiding load-balancing problems is proposed. We demonstrate that using these methods low-energy properties of systems of up to 50 spin-1/21/21/2 particles can be successfully determined.
Quantum computation has the potential to revolutionize quantum chemistry through major speedups in computation times and an exponential reduction in computational resources. Here, we combine the symmetry-adapted Jordan-Wigner encoding based on the full Boolean symmetry group Z2k with our new implementation of the Xia-Bian-Kais (XBK) method for improving the efficiency of electronic structure theory calculations on quantum annealers, particularly by reducing the number of qubits needed to achieve the same accuracy. By providing a more extensive symmetry-adapted encoding (SAE) than previous work, we are able to simulate molecules larger than those previously reported that have been studied using methods developed for quantum annealers and without using an active space. We calculated the potential energy surfaces of H2, LiH, He2, H2O, O2, N2, Li2, F2, CO, BH3, NH3, and CH4, with the largest molecule in the STO-6G basis set requiring 16 qubits with our SAE, and compared them with full configuration interaction results. The application of SAE to the XBK method provides an exponential reduction in the size of the Hilbert space and scales well with the size of the problem. It does not introduce significant additional errors for even or large values of a key variational parameter that determines the number of ancilla qubits used in the XBK method's Hamiltonian embedding, or for certain molecules such as He2 and H2O. We provide an explanation for this behavior and a recommendation on the usage of our method. In addition, we briefly discuss the potential of extracting electronic excited states from our method.
Grover's algorithm stands as a cornerstone of quantum computing, offering a theoretical quadratic speedup for unstructured search problems. This allows for finding a target item in an unsorted database of N entries in approximately the square root of N steps, a significant improvement over classical algorithms which require a number of operations on the order of N in the worst case. This speedup becomes particularly compelling for very large datasets, where classical exhaustive search becomes computationally intractable. The algorithm achieves this by leveraging fundamental quantum mechanical principles, primarily superposition and interference. It operates by preparing qubits in a uniform superposition of all possible states, then iteratively applying a quantum oracle to mark the desired state by flipping its phase, followed by a diffusion operator that amplifies the probability of the marked state. Despite its theoretical promise, real-world implementation faces substantial challenges stemming from Noisy Intermediate-Scale Quantum (NISQ) hardware, which is characterized by high error rates and short coherence times. Consequently, achieving a true, scalable quantum advantage remains a future endeavor, contingent on significant hardware advancements. Nevertheless, Grover's algorithm holds significant potential across diverse fields, including enhancing brute-force attacks on cryptographic systems, accelerating solutions for optimization problems, and speeding up search processes in machine learning and unstructured database queries.
Abstract There has been a good deal of work on algorithms to simulate quantum many-body systems with fault-tolerant quantum computers- those with full error correction. Fault-tolerant quantum computers of scale requisite to achieve computational advantage for these problems are likely over a decade away. Moreover, devices that we can build in the near term, called Noisy Intermediate Scale Quantum computers (NISQ), have too much noise to implement the long circuits required by these algorithms. We review heuristic, short-depth quantum algorithms more suited to NISQ computers; specifically, their scaling properties when applied to electronic and nuclear structure calculations, including Hamiltonian complexity with particle number, ansatz state preparation, convergence, and noise. We will present examples of actual quantum structure calculations with NISQ computers, as well as a newly-developed error mitigation technique that significantly improves accuracy. We end with an outlook for “advantage” – when NISQ systems might excel conventional HPC approaches for comparable problems.
The exact evaluation of the molecular ground state in quantum chemistry requires an exponentially increasing computational cost. Quantum computation is a promising way to overcome the exponential problem using polynomial-time quantum algorithms. A quantum-classical hybrid optimization scheme known as the variational quantum eigensolver is preferred for noisy intermediate-scale quantum devices. However, the circuit depth becomes one of the bottlenecks of its application to large molecules of more than 20 qubits. In this work, we employ point-group symmetry to reduce the number of operators in constructing ansatz so as to achieve a more compact quantum circuit. We illustrate this methodology with a series of molecules ranging from LiH (12 qubits) to C2H4{\mathrm{C}}_{2}{\mathrm{H}}_{4}C2​H4​ (28 qubits). A significant reduction of up to 82% of the operator numbers is reached on C2H4{\mathrm{C}}_{2}{\mathrm{H}}_{4}C2​H4​. This also sheds light onto further work in this direction to construct even shallower ansatz with enough expressive power and simulate even larger scale systems.