Feasibility of first principles molecular dynamics in fault-tolerant quantum computer by quantum phase estimation (2404.10001v3)
Abstract: This article shows a proof of concept regarding the feasibility of ab initio molecular simulation, wherein the wavefunctions and the positions of nuclei are simultaneously determined by the quantum algorithm, as is realized by the so-called Car-Parrinello method by classical computing. The approach used in this article is of a hybrid style, which shall be realized by future fault-tolerant quantum computer. First, the basic equations are approximated by polynomials. Second, those polynomials are transformed to a specific form, wherein all variables (representing the wavefunctions and the atomic coordinates) are given by the transformations acting on a linear space of monomials with finite dimension, and the unknown variables could be determined as the eigenvalues of those transformation matrices. Third, the eigenvalues are determined by quantum phase estimation. Following these three steps, namely, symbolic, numeric, and quantum steps, we can determine the optimized electronic and atomic structures of molecules.
- Akihito Kikuchi. An approach to first principles electronic structure computation by symbolic-numeric computation. QScience Connect, 2013:14, 2013. http://dx.doi.org/10.5339/connect.2013.14.
- Ab-initio quantum chemistry through computer algebra. Asian Journal of Research and Reviews in Physics, 6(4):18–31, 2022.
- Molecular Algebraic Geometry: Electronic Structure of H3+ as Algebraic Variety. OSF Preprints, 2023. https://osf.io/preprints/osf/2crxp.
- Symbolic, numeric and quantum computation of Hartree-Fock equation. arXiv preprint arXiv:2401.00019, 2024.
- Modern quantum chemistry: introduction to advanced electronic structure theory. Courier Corporation, 2012.
- S Francis Boys. Electronic wave functions-i. a general method of calculation for the stationary states of any molecular system. Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 200(1063):542–554, 1950.
- David Eisenbud. Commutative Algebra: with a view toward algebraic geometry, volume 150. Springer Science & Business Media, 2013.
- Ideals, varieties, and algorithms: an introduction to computational algebraic geometry and commutative algebra. Springer Science & Business Media, 2013.
- Gröbner Bases in Commutative Algebra, volume 130. American Mathematical Soc., 2011.
- Computing in algebraic geometry, volume 16 of algorithms and computation in mathematics, 2006.
- Bruno Buchberger. An algorithm for finding a basis for the residue class ring of a zero-dimensional polynomial ideal. PhD thesis, Ph. D. thesis, University of Innsbruck, Austria, 1965.
- Frank Sottile. From enumerative geometry to solving systems of polynomial equations. In Computations in algebraic geometry with Macaulay 2, pages 101–129. Springer, 2002.
- Fable: Fast approximate quantum circuits for block-encodings. In 2022 IEEE International Conference on Quantum Computing and Engineering (QCE), pages 104–113. IEEE, 2022.
- The Structure of H3, H3+, and of H3?. IV. The Journal of Chemical Physics, 5(12):933–940, 1937.
- Joseph O Hirschfelder. The energy of the triatomic hydrogen molecule and ion, V. The Journal of Chemical Physics, 6(12):795–806, 1938.
- Theory of the Rydberg spectrum of triatomic hydrogen. The Journal of Chemical Physics, 71(8):3213–3220, 1979.
- Eric Herbst. The astrochemistry of H3+. Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, 358(1774):2523–2534, 2000.
- Quantum dynamics study on predissociation of H3 Rydberg states: Importance of indirect mechanism. The Journal of Chemical Physics, 117(5):2053–2062, 2002.
- Theory of Dissociative Recombination of D3h Triatomic Ions Applied to H3+. Physical Review Letters, 90(13):133201, 2003.
- Hot and diffuse clouds near the galactic center probed by metastable H3+. The Astrophysical Journal, 632(2):882, 2005.
- Chemical bonding in the lightest tri-atomic clusters; H3+, Li3+ and B3-. Journal of Molecular Structure: THEOCHEM, 901(1-3):243–248, 2009.
- How to calculate h3 better. The Journal of chemical physics, 131(18):184106, 2009.
- Vikram R Jadhav. Theoretical Approach to Understanding an Electron Density, Charge Density and Most Stable Configuration of h3 system. International Journal of Research and Review, 7(3), 2020.
- Rydberg States of H3 and HeH as Potential Coolants for Primordial Star Formation. The Journal of Physical Chemistry A, 125(20):4267–4275, 2021.
- Sympy: symbolic computing in python. PeerJ Computer Science, 3:e103, January 2017.
- The Gap Group. GAP - Groups, Algorithms, Programming - a System for Computational Discrete Algebra. Available at http://www.gap-system.org/, 2017.
- Measurement-based quantum phase estimation algorithm for finding eigenvalues of non-unitary matrices. Physical Review A, 82(6):062303, 2010.
- A universal quantum circuit scheme for finding complex eigenvalues. Quantum information processing, 13:333–353, 2014.
- Changpeng Shao. Computing eigenvalues of diagonalizable matrices on a quantum computer. ACM Transactions on Quantum Computing, 3(4):1–20, 2022.
- Arbitrary accuracy iterative quantum phase estimation algorithm using a single ancillary qubit: A two-qubit benchmark. Phys. Rev. A, 76:030306, Sep 2007.
- Encoding electronic spectra in quantum circuits with linear t complexity. Physical Review X, 8(4):041015, 2018.
- Hamiltonian simulation by qubitization. Quantum, 3:163, 2019.
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pages 193–204, 2019.
- Preparing ground states of quantum many-body systems on a quantum computer. Physical review letters, 102(13):130503, 2009.
- Hamiltonian simulation using linear combinations of unitary operations. arXiv preprint arXiv:1202.5822, 2012.
- Simulating hamiltonian dynamics with a truncated taylor series. Physical review letters, 114(9):090502, 2015.
- Fast quantum algorithm for spectral properties. arXiv preprint arXiv:1711.11025, 2017.
- Improved techniques for preparing eigenstates of fermionic hamiltonians. npj Quantum Information, 4(1):22, 2018.
- Faster ground state preparation and high-precision ground energy estimation with fewer qubits. Journal of Mathematical Physics, 60(2), 2019.
- Lin Lin and Yu Tong. Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems. Quantum, 4:361, 2020.
- A Yu Kitaev. Quantum computations: algorithms and error correction. Russian Mathematical Surveys, 52(6):1191, 1997.
- Daniel Gottesman. Theory of fault-tolerant quantum computation. Physical Review A, 57(1):127, 1998.
- Surface codes: Towards practical large-scale quantum computation. Physical Review A, 86(3):032324, 2012.
- Surface code quantum computing by lattice surgery. New Journal of Physics, 14(12):123011, 2012.
- Héctor Bombín. An introduction to topological quantum codes. arXiv preprint arXiv:1311.0277, 2013.
- Oscar Higgott. Pymatching: A python package for decoding quantum codes with minimum-weight perfect matching. ACM Transactions on Quantum Computing, 3(3):1–16, 2022.
- Decoding quantum color codes with maxsat. arXiv preprint arXiv:2303.14237, 2023.
- Fusion blossom: Fast mwpm decoders for qec. In 2023 IEEE International Conference on Quantum Computing and Engineering (QCE), volume 1, pages 928–938. IEEE, 2023.
- Application of constacyclic codes to quantum mds codes. IEEE Transactions on Information Theory, 61(3):1474–1484, 2015.
- Extending construction x for quantum error-correcting codes. In Coding Theory and Applications: 4th International Castle Meeting, Palmela Castle, Portugal, September 15-18, 2014, pages 141–152. Springer, 2015.
- Quantum low-density parity-check codes. PRX Quantum, 2(4):040101, 2021.
- Almost-linear time decoding algorithm for topological codes. Quantum, 5:595, 2021.
- Markus Grassl. Algebraic quantum codes: linking quantum mechanics and discrete mathematics. International Journal of Computer Mathematics: Computer Systems Theory, 6(4):243–259, 2021.
- On the complexity of the f5 gröbner basis algorithm. Journal of Symbolic Computation, 70:49–70, 2015.