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

A quantum algorithm for obtaining the lowest eigenstate of a Hamiltonian assisted with an... 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 $$\simeq$$ ≃ 1. 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 Xu (Nat 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$$ n c of iterations is proportional to $$\simeq \mathcal{O}(D^{-1}\epsilon ^{-0.19})$$ ≃ O ( D - 1 ϵ - 0.19 ) , where $$D$$ 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

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

, Volume 14 (1) – Oct 7, 2014
16 pages

/lp/springer_journal/a-quantum-algorithm-for-obtaining-the-lowest-eigenstate-of-a-lOeUl3Zshx
Publisher
Springer Journals
Subject
Physics; Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics
ISSN
1570-0755
eISSN
1573-1332
D.O.I.
10.1007/s11128-014-0836-5
Publisher site
See Article on Publisher Site

### 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 $$\simeq$$ ≃ 1. 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 Xu (Nat 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$$ n c of iterations is proportional to $$\simeq \mathcal{O}(D^{-1}\epsilon ^{-0.19})$$ ≃ O ( D - 1 ϵ - 0.19 ) , where $$D$$ 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.

### Journal

Quantum Information ProcessingSpringer Journals

Published: Oct 7, 2014

## You’re reading a free preview. Subscribe to read the entire article.

### DeepDyve is your personal research library

It’s your single place to instantly
that matters to you.

over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month ### Explore the DeepDyve Library ### Search Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly ### Organize Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place. ### Access Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals. ### Your journals are on DeepDyve Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more. All the latest content is available, no embargo periods. DeepDyve ### Freelancer DeepDyve ### Pro Price FREE$49/month
\$360/year

Save searches from
PubMed

Create lists to

Export lists, citations