Fault-Tolerant Quantum Simulations of Chemistry in First Quantization
- URL: http://arxiv.org/abs/2105.12767v3
- Date: Mon, 11 Oct 2021 19:46:48 GMT
- Title: Fault-Tolerant Quantum Simulations of Chemistry in First Quantization
- Authors: Yuan Su, Dominic W. Berry, Nathan Wiebe, Nicholas Rubin, Ryan Babbush
- Abstract summary: We analyze and optimize the resources required to implement two first quantized quantum algorithms for chemistry.
We demonstrate that our qubitized algorithm often requires much less surface code spacetime volume for simulating millions of plane waves than the best second quantized algorithms.
- Score: 0.18374319565577155
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum simulations of chemistry in first quantization offer important
advantages over approaches in second quantization including faster convergence
to the continuum limit and the opportunity for practical simulations outside
the Born-Oppenheimer approximation. However, as all prior work on quantum
simulation in first quantization has been limited to asymptotic analysis, it
has been impossible to compare the resources required for these approaches to
those for more commonly studied algorithms in second quantization. Here, we
analyze and optimize the resources required to implement two first quantized
quantum algorithms for chemistry from Babbush et al that realize block
encodings for the qubitization and interaction picture frameworks of Low et al.
The two algorithms we study enable simulation with gate complexities
$\tilde{\cal O}(\eta^{8/3}N^{1/3}t+\eta^{4/3}N^{2/3}t)$ and $\tilde{\cal
O}(\eta^{8/3} N^{1/3} t)$ where $\eta$ is the number of electrons, $N$ is the
number of plane wave basis functions, and $t$ is the duration of time-evolution
($t$ is inverse to target precision when the goal is to estimate energies). In
addition to providing the first explicit circuits and constant factors for any
first quantized simulation and introducing improvements which reduce circuit
complexity by about a thousandfold over naive implementations for modest sized
systems, we also describe new algorithms that asymptotically achieve the same
scaling in a real space representation. We assess the resources required to
simulate various molecules and materials and conclude that the qubitized
algorithm will often be more practical than the interaction picture algorithm.
We demonstrate that our qubitized algorithm often requires much less surface
code spacetime volume for simulating millions of plane waves than the best
second quantized algorithms require for simulating hundreds of Gaussian
orbitals.
Related papers
- Evaluation of phase shifts for non-relativistic elastic scattering using quantum computers [39.58317527488534]
This work reports the development of an algorithm that makes it possible to obtain phase shifts for generic non-relativistic elastic scattering processes on a quantum computer.
arXiv Detail & Related papers (2024-07-04T21:11:05Z) - Benchmarking digital quantum simulations above hundreds of qubits using quantum critical dynamics [42.29248343585333]
We benchmark quantum hardware and error mitigation techniques on up to 133 qubits.
We show reliable control up to a two-qubit gate depth of 28, featuring a maximum of 1396 two-qubit gates.
Results are transferable to applications such as Hamiltonian simulation, variational algorithms, optimization, or quantum machine learning.
arXiv Detail & Related papers (2024-04-11T18:00:05Z) - Quantum Simulation of Realistic Materials in First Quantization Using Non-local Pseudopotentials [1.3166122476354067]
This paper improves and demonstrates the usefulness of the first quantized plane-wave algorithms for the quantum simulation of electronic structure.
We focus on the Goedecker-Tetter-Hutter (GTH) pseudopotential, which is among the most accurate and widely used norm-conserving pseudopotentials.
Despite the complicated form of the GTH pseudopotential, we are able to block encode the associated operator without significantly increasing the overall cost of quantum simulation.
arXiv Detail & Related papers (2023-12-12T19:00:01Z) - Nuclear Spectra from Quantum Lanczos Algorithm with Real-Time Evolution
and Multiple Reference States [0.0]
I performed numerical simulations to find the low-lying eigenstates of $20$Ne, $22$Na, and $29$Na to compare imaginary- and real-time evolution.
I present the quantum circuits for the QLanczos algorithm with real-time evolution and multiple references.
arXiv Detail & Related papers (2023-09-01T23:25:57Z) - Sublinear scaling in non-Markovian open quantum systems simulations [0.0]
We introduce a numerically exact algorithm to calculate process tensors.
Our approach requires only $mathcalO(nlog n)$ singular value decompositions for environments with infinite memory.
arXiv Detail & Related papers (2023-04-11T15:40:33Z) - Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
We design, implement, and evaluate three hybrid quantum k-Means algorithms.
We exploit quantum phenomena to speed up the computation of distances.
We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
arXiv Detail & Related papers (2022-12-13T16:04:16Z) - Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle.
We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm.
We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
arXiv Detail & Related papers (2022-05-26T20:32:36Z) - 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) - Quantum State Preparation with Optimal Circuit Depth: Implementations
and Applications [10.436969366019015]
We show that any $Theta(n)$-depth circuit can be prepared with a $Theta(log(nd)) with $O(ndlog d)$ ancillary qubits.
We discuss applications of the results in different quantum computing tasks, such as Hamiltonian simulation, solving linear systems of equations, and realizing quantum random access memories.
arXiv Detail & Related papers (2022-01-27T13:16:30Z) - Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
We present a constructive algorithm for generating quantum circuits with time-independent depth.
We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model.
In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
arXiv Detail & Related papers (2021-04-01T19:06:00Z) - Algorithms for quantum simulation at finite energies [0.7734726150561088]
We introduce two kinds of quantum algorithms to explore microcanonical and canonical properties of many-body systems.
One is a hybrid quantum algorithm that computes expectation values in a finite energy interval around its mean energy.
The other is a quantum-assisted Monte Carlo sampling method to compute other quantities.
arXiv Detail & Related papers (2020-06-04T17:40:29Z)
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.