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

Science News

Divide and conquer for quantum computers

I. Peterson

Published Jun 14, 1997• 0 citations
Publisher
DOI
10.2307/4018378

Related papers

Algorithms for Quantum Computers

Jamie Smith, Michele Mosca

arXiv:1001.0767•Springer eBooks•Jan 1, 2012•23 citations

Divide-and-Conquer Linear-Scaling Quantum Chemical Computations

Hiromi Nakai, Masato Kobayashi, Takeshi Yoshikawa +3 more

Fragmentation and embedding schemes are of great importance when applying quantum-chemical calculations to more complex and attractive targets. The divide-and-conquer (DC)-based quantum-chemical model is a fragmentation scheme that can be connected to embedding schemes. This feature article explains several DC-based schemes developed by the authors over the last two decades, which was inspired by the pioneering study of DC self-consistent field (SCF) method by Yang and Lee ( J. Chem. Phys . 1995, 103, 5674–5678). First, the theoretical aspects of the DC-based SCF, electron correlation, excited-state, and nuclear orbital methods are described, followed by the two-component relativistic theory, quantum-mechanical molecular dynamics simulation, and the introduction of three programs, including DC-based schemes. Illustrative applications confirmed the accuracy and feasibility of the DC-based schemes.

The Journal of Physical Chemistry A•Jan 11, 2023•32 citations

Quantum Computing Algorithms

Andreas Bärtschi

•Feb 16, 2024•0 citations

Divide-and-conquer variational quantum algorithms for large-scale electronic structure simulations

Ma, Huan, Yi Fan, Jie Liu +3 more

Exploring the potential application of quantum computers in material design and drug discovery has attracted a lot of interest in the age of quantum computing. However, the quantum resource requirement for solving practical electronic structure problems are far beyond the capacity of near-term quantum devices. In this work, we integrate the divide-and-conquer (DC) approaches into the variational quantum eigensolver (VQE) for large-scale quantum computational chemistry simulations. Two popular divide-and-conquer schemes, including many-body expansion~(MBE) fragmentation theory and density matrix embedding theory~(DMET), are employed to divide complicated problems into many small parts that are easy to implement on near-term quantum computers. Pilot applications of these methods to systems consisting of tens of atoms are performed with adaptive VQE algorithms. This work should encourage further studies of using the philosophy of DC to solve electronic structure problems on quantum computers.

arXiv:2208.14789•Aug 31, 2022•1 citation

Quantum Algorithm of the Divide-and-Conquer Unitary Coupled Cluster Method with a Variational Quantum Eigensolver

Takeshi Yoshikawa, Tomoya Takanashi, Hiromi Nakai

The variational quantum eigensolver (VQE) with shallow or constant-depth quantum circuits is one of the most pursued approaches in the noisy intermediate-scale quantum (NISQ) devices with incoherent errors. In this study, the divide-and-conquer (DC) linear scaling technique, which divides the entire system into several fragments, is applied to the VQE algorithm based on the unitary coupled cluster (UCC) method, denoted as DC-qUCC/VQE, to reduce the number of required qubits. The unitarity of the UCC ansatz that enables the evaluation of the total energy as well as various molecular properties as expectation values can be easily implemented on quantum devices because the quantum gates are unitary operators themselves. Based on this feature, the present DC-qUCC/VQE algorithm is designed to conserve the total number of electrons in the entire system using the density matrix evaluated on a quantum computer. Numerical assessments clarified that the energy errors of the DC-qUCC/VQE calculations decrease by using the constraint of the total number of electrons. Furthermore, the DC-qUCC/VQE algorithm could reduce the number of quantum gates and shows the possibility of decreasing incoherent errors.

Journal of Chemical Theory and Computation•Aug 4, 2022•9 citations

Quantum Computer Algorithms

Michele Mosca

APS•Mar 1, 2003•67 citations
Fragmentation and embedding schemes are of great importance when applying quantum-chemical calculations to more complex and attractive targets. The divide-and-conquer (DC)-based quantum-chemical model is a fragmentation scheme that can be connected to embedding schemes. This feature article explains several DC-based schemes developed by the authors over the last two decades, which was inspired by the pioneering study of DC self-consistent field (SCF) method by Yang and Lee ( J. Chem. Phys . 1995, 103, 5674–5678). First, the theoretical aspects of the DC-based SCF, electron correlation, excited-state, and nuclear orbital methods are described, followed by the two-component relativistic theory, quantum-mechanical molecular dynamics simulation, and the introduction of three programs, including DC-based schemes. Illustrative applications confirmed the accuracy and feasibility of the DC-based schemes.
Exploring the potential application of quantum computers in material design and drug discovery has attracted a lot of interest in the age of quantum computing. However, the quantum resource requirement for solving practical electronic structure problems are far beyond the capacity of near-term quantum devices. In this work, we integrate the divide-and-conquer (DC) approaches into the variational quantum eigensolver (VQE) for large-scale quantum computational chemistry simulations. Two popular divide-and-conquer schemes, including many-body expansion~(MBE) fragmentation theory and density matrix embedding theory~(DMET), are employed to divide complicated problems into many small parts that are easy to implement on near-term quantum computers. Pilot applications of these methods to systems consisting of tens of atoms are performed with adaptive VQE algorithms. This work should encourage further studies of using the philosophy of DC to solve electronic structure problems on quantum computers.
The variational quantum eigensolver (VQE) with shallow or constant-depth quantum circuits is one of the most pursued approaches in the noisy intermediate-scale quantum (NISQ) devices with incoherent errors. In this study, the divide-and-conquer (DC) linear scaling technique, which divides the entire system into several fragments, is applied to the VQE algorithm based on the unitary coupled cluster (UCC) method, denoted as DC-qUCC/VQE, to reduce the number of required qubits. The unitarity of the UCC ansatz that enables the evaluation of the total energy as well as various molecular properties as expectation values can be easily implemented on quantum devices because the quantum gates are unitary operators themselves. Based on this feature, the present DC-qUCC/VQE algorithm is designed to conserve the total number of electrons in the entire system using the density matrix evaluated on a quantum computer. Numerical assessments clarified that the energy errors of the DC-qUCC/VQE calculations decrease by using the constraint of the total number of electrons. Furthermore, the DC-qUCC/VQE algorithm could reduce the number of quantum gates and shows the possibility of decreasing incoherent errors.