Efficient simulation of quantum chemistry problems in an enlarged basis set
- URL: http://arxiv.org/abs/2407.04432v1
- Date: Fri, 5 Jul 2024 11:27:09 GMT
- Title: Efficient simulation of quantum chemistry problems in an enlarged basis set
- Authors: Maxine Luo, J. Ignacio Cirac,
- Abstract summary: We propose a quantum algorithm to simulate the dynamics in quantum chemistry problems.
It is based on adding fresh qubits at each Trotter step, which enables a simpler implementation of the dynamics in the extended system.
A key ingredient of the approach is an isometry that maps a simple, diagonal Hamiltonian in the extended system to the original one.
- Score: 0.3683202928838613
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We propose a quantum algorithm to simulate the dynamics in quantum chemistry problems. It is based on adding fresh qubits at each Trotter step, which enables a simpler implementation of the dynamics in the extended system. After each step, the extra qubits are recycled, so that the whole process accurately approximates the correct unitary evolution. A key ingredient of the approach is an isometry that maps a simple, diagonal Hamiltonian in the extended system to the original one. We give a procedure to compute this isometry, while minimizing the number of extra qubits required. We estimate the error at each time step, as well as the number of gates, which scales as $O(N^2)$, where $N$ is the number of orbitals. We illustrate our results with two examples: the Hydrogen chain and the FeMoCo molecule. In the Hydrogen chain we observe that the error scales in the same way as the Trotter error. For FeMoCo, we estimate the number of gates in a fault-tolerant setup.
Related papers
- Hamiltonians, groups, graphs and ans\"atze [2.4094285826152593]
We introduce a new circuit design that combines graph-based diagonalization circuits with arbitrary single-qubit rotation gates.
We test the accuracy of the proposed ansatz in estimating ground state energies of various molecules of size up to 12-qubits.
arXiv Detail & Related papers (2023-12-28T17:28:23Z) - Error-corrected Hadamard gate simulated at the circuit level [42.002147097239444]
We simulate the logical Hadamard gate in the surface code under a circuit-level noise model.
Our paper is the first to do this for a unitary gate on a quantum error-correction code.
arXiv Detail & Related papers (2023-12-18T19:00:00Z) - High-fidelity parallel entangling gates on a neutral atom quantum
computer [41.74498230885008]
We report the realization of two-qubit entangling gates with 99.5% fidelity on up to 60 atoms in parallel.
These advances lay the groundwork for large-scale implementation of quantum algorithms, error-corrected circuits, and digital simulations.
arXiv Detail & Related papers (2023-04-11T18:00:04Z) - Hamiltonian Simulation Via Qubitized Downfolding Using $4\log N+2$
Qubits [0.4873362301533825]
This paper reports a quantum algorithm for simulating quantum chemical systems of N molecular orbitals(MOs) using $4log N +2$ qubits.
The number of multi-electrons scales exponentially with the number of MOs and is the primary bottleneck in calculating the energy of a many-electron system.
arXiv Detail & Related papers (2023-03-13T12:15:54Z) - On the complexity of implementing Trotter steps [2.1369834525800138]
We develop methods to perform faster Trotter steps with complexity sublinear in number of terms.
We also realize faster Trotter steps when certain blocks of Hamiltonian coefficients have low rank.
Our result suggests the use of Hamiltonian structural properties as both necessary and sufficient to implement Trotter synthesis steps with lower gate complexity.
arXiv Detail & Related papers (2022-11-16T19:00:01Z) - 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) - Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware.
We present an algorithm that compresses the Trotter steps into a single block of quantum gates.
This results in a fixed depth time evolution for certain classes of Hamiltonians.
arXiv Detail & Related papers (2021-08-06T19:38:01Z) - Variational quantum algorithm for molecular geometry optimization [0.0]
We introduce a variational quantum algorithm for finding the most stable structure of a molecule.
The equilibrium geometry of the molecule is obtained by minimizing a more general cost function.
All quantum simulations are performed using the PennyLane library for quantum differentiable programming.
arXiv Detail & Related papers (2021-06-25T18:34:44Z) - Quantum-optimal-control-inspired ansatz for variational quantum
algorithms [105.54048699217668]
A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form.
Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries.
This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
arXiv Detail & Related papers (2020-08-03T18:00:05Z) - Quantum Simulation of 2D Quantum Chemistry in Optical Lattices [59.89454513692418]
We propose an analog simulator for discrete 2D quantum chemistry models based on cold atoms in optical lattices.
We first analyze how to simulate simple models, like the discrete versions of H and H$+$, using a single fermionic atom.
We then show that a single bosonic atom can mediate an effective Coulomb repulsion between two fermions, leading to the analog of molecular Hydrogen in two dimensions.
arXiv Detail & Related papers (2020-02-21T16:00:36Z)
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.