Quantum Zeno approach for molecular energies with maximum commuting initialHamiltonians
arXiv:2006.01066 · doi:10.1103/PhysRevResearch.3.013104
Abstract
We propose to use a quantum adiabatic and simulated-annealing framework to compute theground state of small molecules. The initial Hamiltonian of our algorithms is taken to be themaximum commuting Hamiltonian that consists of a maximal set of commuting terms in the fullHamiltonian of molecules in the Pauli basis. We consider two variants. In the first method, weperform the adiabatic evolution on the obtained time- or path-dependent Hamiltonian with theinitial state as the ground state of the maximum commuting Hamiltonian. However, this methoddoes suffer from the usual problems of adiabatic quantum computation due to degeneracy andenergy-level crossings along the Hamiltonian path. This problem is mitigated by a Zeno method,i.e., via a series of eigenstate projections used in the quantum simulated annealing, with the path-dependent Hamiltonian augmented by a sum of Pauli X terms, whose contribution vanishes at thebeginning and the end of the path. In addition to the ground state, the low lying excited states canbe obtained using this quantum Zeno approach with equal accuracy to that of the ground state.
arXiv commentTitle changed; 15 pages, 14 figures
References in corpus (37)
- Fault-tolerant quantum computation by anyons
- A variational eigenvalue solver on a quantum processor
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Quantum Annealing in the Transverse Ising Model
- Quantum computational chemistry
- Quantum Chemistry in the Age of Quantum Computing
- String-net condensation: A physical mechanism for topological phases
- Simulated Quantum Computation of Molecular Energies
- An adaptive variational algorithm for exact molecular simulations on a quantum computer
- Scalable Quantum Simulation of Molecular Energies
- Towards Quantum Chemistry on a Quantum Computer
- The Bravyi-Kitaev transformation for quantum computation of electronic structure
- Quantum Computation by Adiabatic Evolution
- Digitized adiabatic quantum computing with a superconducting circuit
- Robust determination of molecular spectra on a quantum processor
- Semiclassical Fourier Transform for Quantum Computation
- Measurement Optimization in the Variational Quantum Eigensolver Using a Minimum Clique Cover
- Computational Complexity of interacting electrons and fundamental limitations of Density Functional Theory
- Arbitrary accuracy iterative phase estimation algorithm as a two qubit benchmark
- Quantum equation of motion for computing molecular excitation energies on a noisy quantum processor
- Adiabatic Quantum Simulation of Quantum Chemistry
- Quantum Simulations of Classical Annealing Processes
- Preparing ground states of quantum many-body systems on a quantum computer
- Calculating the Thermal Rate Constant with Exponential Speed-Up on a Quantum Computer
- Quantum Algorithm for Obtaining the Energy Spectrum of Molecular Systems
- Superfast encodings for fermionic quantum simulation
- Bravyi-Kitaev Superfast simulation of fermions on a quantum computer
- Minimizing State Preparations in Variational Quantum Eigensolver by Partitioning into Commuting Families
- Quantum Adiabatic Evolution Algorithms with Different Paths
- Quantum computing applied to calculations of molecular energies: CH2 benchmark
- Asymmetric blockade and multi-qubit gates via dipole-dipole interactions
- Theory of robust multi-qubit non-adiabatic gates for trapped-ions
- Contextuality Test of the Nonclassicality of Variational Quantum Eigensolvers
- Pauli Partitioning with Respect to Gate Sets
- Classical Simulation of Noncontextual Pauli Hamiltonians
- The k-local Pauli Commuting Hamiltonians Problem is in P
- Quantum algorithm for spectral projection by measuring an ancilla iteratively