Optimizing electronic structure simulations on a trapped-ion quantum computer using problem decomposition

@article{Kawashima2021OptimizingES,
  title={Optimizing electronic structure simulations on a trapped-ion quantum computer using problem decomposition},
  author={Yukio Kawashima and Erika Lloyd and Marc P. Coons and Yun Seong Nam and Shunji Matsuura and Alejandro J Garza and Sonika Johri and Lee M J Huntington and Valentin Senicourt and Andrii O. Maksymov and Jason H. V. Nguyen and Jungsang Kim and Nima Alidoust and Arman Zaribafiyan and Takeshi Yamazaki},
  journal={Communications Physics},
  year={2021},
  volume={4},
  pages={1-9}
}
Quantum computers have the potential to advance material design and drug discovery by performing costly electronic structure calculations. A critical aspect of this application requires optimizing the limited resources of the quantum hardware. Here, we experimentally demonstrate an end-to-end pipeline that focuses on minimizing quantum resources while maintaining accuracy. Using density matrix embedding theory as a problem decomposition technique, and an ion-trap quantum computer, we simulate a… 

Ab initio Quantum Simulation of Strongly Correlated Materials with Quantum Embedding

Quantum computing has shown great potential in various quantum chemical applications such as drug discovery, material design, and catalyst optimization. Although significant progress has been made in

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

TLDR
This work integrates the divide-and-conquer approaches into the variational quantum eigensolver (VQE) for large-scale quantum computational chemistry simulations, and should encourage further studies of using the philosophy of DC to solve electronic structure problems on quantum computers.

Simulating the Electronic Structure of Spin Defects on Quantum Computers

We present calculations of both the ground and excited state energies of spin defects in solids carried out on a quantum computer, using a hybrid classical/quantum protocol. We focus on the

Quantum algorithms for electronic structures: basis sets and boundary conditions.

The advantages of quantum computers are believed to significantly change the research paradigm of chemical and materials sciences, where computational characterization and theoretical design play an

Solving the Hubbard model using density matrix embedding theory and the variational quantum eigensolver

Calculating the ground state properties of a Hamiltonian can be mapped to the problem of finding the ground state of a smaller Hamiltonian through the use of embedding methods. These embedding

Periodic Plane-Wave Electronic Structure Calculations on Quantum Computers

A procedure for defining virtual spaces, and the periodic one-electron and two-electron integrals, for plane-wave second quantized Hamiltonians has been developed and demonstrated using full

Leveraging small scale quantum computers with unitarily downfolded Hamiltonians

TLDR
A quantum unitary downfolding formalism based on the driven similarity renormalization group (QDSRG) that may be combined with quantum algorithms for both noisy and fault-tolerant hardware and shows that the QDSRG is a viable approach to leverage near-term quantum devices for the accurate estimation of molecular properties.

Modelling Carbon Capture on Metal-Organic Frameworks with Quantum Computing

Despite the recent progress in quantum computational algorithms for chemistry, there is a dearth of quantum computational simulations focused on material science applications, especially for the

Efficient quantum imaginary time evolution by drifting real time evolution: an approach with low gate and measurement complexity

Quantum imaginary time evolution (QITE) is one of the promising candidates for finding eigenvalues and eigenstates of a Hamiltonian. However, the original QITE proposal [Nat. Phys. 16, 205-210

Tangelo: An Open-source Python Package for End-to-end Chemistry Workflows on Quantum Computers

TLDR
The design choices, philosophy, and main features of Tangelo are outlined, which can be used to explore quantum computing applications such as open-shell systems, excited states, or more industrially-relevant systems by leveraging problem decomposition at scale.

References

SHOWING 1-10 OF 45 REFERENCES

Ground-state energy estimation of the water molecule on a trapped-ion quantum computer

TLDR
An extensible co-design framework for solving chemistry problems on a trapped-ion quantum computer is described and applied to estimating the ground-state energy of the water molecule using the variational quantum eigensolver (VQE) method.

Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets

TLDR
The experimental optimization of Hamiltonian problems with up to six qubits and more than one hundred Pauli terms is demonstrated, determining the ground-state energy for molecules of increasing size, up to BeH2.

Toward convergence of effective field theory simulations on digital quantum computers

TLDR
By increasing the complexity of the Hamiltonian, allowing more terms in theeffective field theory expansion and calculating their expectation values, this work presents a benchmark for quantum computers based on their ability to scalably calculate the effective field theory with increasing accuracy.

Towards the Practical Application of Near-Term Quantum Computers in Quantum Chemistry Simulations: A Problem Decomposition Approach

TLDR
The present study envisions a hybrid quantum--classical framework for leveraging problem decomposition (PD) techniques in quantum chemistry to decompose a target molecular system into smaller subsystems requiring fewer computational resources.

Quantum chemistry as a benchmark for near-term quantum computers

TLDR
It is demonstrated that for specific benchmark settings and a selected range of problems, the accuracy metric can reach chemical accuracy when computing over the cloud on certain quantum computers.

Quantum Chemistry Calculations on a Trapped-Ion Quantum Simulator

Quantum-classical hybrid algorithms are emerging as promising candidates for near-term practical applications of quantum information processors in a wide variety of fields ranging from chemistry to

Quantum implementation of the unitary coupled cluster for simulating molecular electronic structure

In classical computational chemistry, the coupled-cluster ansatz is one of the most commonly used $ab~initio$ methods, which is critically limited by its non-unitary nature. The unitary modification

A variational eigenvalue solver on a photonic quantum processor

TLDR
The proposed approach drastically reduces the coherence time requirements and combines this method with a new approach to state preparation based on ansätze and classical optimization, enhancing the potential of quantum resources available today and in the near future.

Scalable Quantum Simulation of Molecular Energies

We report the first electronic structure calculation performed on a quantum computer without exponentially costly precompilation. We use a programmable array of superconducting qubits to compute the

Qubit Coupled Cluster Method: A Systematic Approach to Quantum Chemistry on a Quantum Computer.

TLDR
A qubit coupled cluster (QCC) method that starts directly in the qubit space and uses energy response estimates for ranking the importance of individual entanglers for the variational energy minimization and provides an exact factorization of a unitary rotation of more than two qubits to a product of two-qubit unitary rotations.