A quantum algorithm for obtaining the lowest eigenstate of a Hamiltonian assisted with an ancillary qubit system

DOI10.1007/S11128-014-0836-5MaRDI QIDQ2018138zbMATHOpenAlexWikidataFDO

Authors Jeongho Bang, Seung Woo Lee, Hyunseok Jeong, Chang Woo Lee

Publication date 13 April 2015

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1212.6523

zbMATH Keywords

quantum algorithmground statealgorithmic cooling

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Selfadjoint operator theory in quantum theory, including spectral analysis (81Q10)

Abstract: We propose a quantum algorithm to obtain the lowest eigenstate of any Hamiltonian simulated by a quantum computer. The proposed algorithm begins with an arbitrary initial state of the simulated system. A finite series of transforms is iteratively applied to the initial state assisted with an ancillary qubit. The fraction of the lowest eigenstate in the initial state is then amplified up to $simeq1$. We prove that our algorithm can faithfully work for any arbitrary Hamiltonian in the theoretical analysis. Numerical analyses are also carried out. We firstly provide a numerical proof-of-principle demonstration with a simple Hamiltonian in order to compare our scheme with the so-called "Demon-like algorithmic cooling (DLAC)", recently proposed in [Nature Photonics 8, 113 (2014)]. The result shows a good agreement with our theoretical analysis, exhibiting the comparable behavior to the best "cooling" with the DLAC method. We then consider a random Hamiltonian model for further analysis of our algorithm. By numerical simulations, we show that the total number $n_c$ of iterations is proportional to $simeqcalO(D^{-1}epsilo{n}^{-0.19})$, where $D$ is the difference between the two lowest eigenvalues, and $epsilon$ is an error defined as the probability that the finally obtained system state is in an unexpected (i.e. not the lowest) eigenstate.

Recommendations

• Approximating ground and excited state energies on a quantum computer
• Quantum algorithm for preparing the ground state of a physical system through multi-step quantum resonant transitions
• Faster ground state preparation and high-precision ground energy estimation with fewer qubits
• Quantum algorithm for measuring the energy of \(n\) qubits with unknown pair-interactions
• A quantum eigensolver for symmetric tridiagonal matrices

Cites work

• scientific article; zbMATH DE number 867339 (Why is no real title available?)
• scientific article; zbMATH DE number 6313121 (Why is no real title available?)
• Algorithmic cooling and scalable NMR quantum computers
• Bulk Spin-Resonance Quantum Computation
• Global control of chaotic systems based on linear state feedback
• Solution of time-independent Schrödinger equation by the imaginary time propagation method
• Statistical mechanics of complex networks
• Wave Functions and Effective Hamiltonian for Bloch Electrons in an Electric Field

Cited in

(4)

• Preparation of approximate eigenvector by unitary operations on eigenstate in Abrams-Lloyd quantum algorithm
• Quantum algorithm for preparing the ground state of a physical system through multi-step quantum resonant transitions
• Faster ground state preparation and high-precision ground energy estimation with fewer qubits
• Computing the lowest eigenstate of tight-binding Hamiltonians using quantum walks

This page was built for publication: A quantum algorithm for obtaining the lowest eigenstate of a Hamiltonian assisted with an ancillary qubit system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018138)