Classical variational optimization of PREPARE circuit for quantum phase estimation of quantum chemistry Hamiltonians

Abstract

We propose a method for constructing $\text{PREPARE}$ circuits for quantum phase estimation of a molecular Hamiltonian in quantum chemistry by using variational optimization of quantum circuits solely on classical computers. The $\text{PREPARE}$ circuit generates a quantum state which encodes the coefficients of the terms in the Hamiltonian as probability amplitudes and plays a crucial role in the state-of-the-art efficient implementations of quantum phase estimation. We employ the automatic quantum circuit encoding algorithm [Shirakawa $\text{et al.}$, arXiv:2112.14524] to construct $\text{PREPARE}$ circuits, which requires classical simulations of quantum circuits of $O(\log N)$ qubits with $N$ being the number of qubits of the Hamiltonian. The generated $\text{PREPARE}$ circuits do not need any ancillary qubit. We demonstrate our method by investigating the number of $T$-gates of the obtained $\text{PREPARE}$ circuits for quantum chemistry Hamiltonians of various molecules, which shows a constant-factor reduction compared to previous approaches that do not use ancillary qubits. Since the number of available logical qubits and $T$ gates will be limited at the early stage of the fault-tolerant quantum computing, the proposed method is particularly of use for performing the quantum phase estimation with such limited capability.

9 pages, 6 figures

References in corpus (20)

• Quantum Algorithms Revisited
• Recent developments in the PySCF program package
• A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
• Elucidating Reaction Mechanisms on Quantum Computers
• Optimal Quantum Circuits for General Two-Qubit Gates
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Even more efficient quantum computations of chemistry through tensor hypercontraction
• Quantum computing enhanced computational catalysis
• Quantum Circuits for Isometries
• Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
• Real- and imaginary-time evolution with compressed quantum circuits
• Quantum circuits with uniformly controlled one-qubit gates
• Improved Techniques for Preparing Eigenstates of Fermionic Hamiltonians
• The electronic complexity of the ground-state of the FeMo cofactor of nitrogenase as relevant to quantum simulations
• Quantum Algorithm for Spectral Measurement with Lower Gate Count
• Computing Ground State Properties with Early Fault-Tolerant Quantum Computers
• Hunting for quantum-classical crossover in condensed matter problems
• Partially Fault-tolerant Quantum Computing Architecture with Error-corrected Clifford Gates and Space-time Efficient Analog Rotations
• Perturbation theory with quantum signal processing
• Automatic quantum circuit encoding of a given arbitrary quantum state

Cited by in corpus (2)

• Tensor-based quantum phase difference estimation for large-scale demonstration
• Averaging gate approximation error and performance of Unitary Coupled Cluster ansatz in Pre-FTQC Era