Efficient Preparation of Quantum States With Exponential Precision

dc.creatorJaksch, Peter
dc.date2005-12-27
dc.date.accessioned2026-07-07T07:00:10Z
dc.date.available2026-07-07T07:00:10Z
dc.descriptionIt has been shown that, starting from the state |0>, in the general case, an arbitrary quantum state |ψ> cannot be prepared with exponential precision in polynomial time. However, we show that for the important special case when |ψ> represents discrete values of some real, continuous function ψ(x), efficient preparation is possible by applying the eigenvalue estimation algorithm to a Hamiltonian which has ψ(x) as an eigenstate. We construct the required Hamiltonian explicitly and present an iterative algorithm for removing unwanted superpositions from the output state in order to reach |ψ> within exponential accuracy. The method works under very general conditions and can be used to provide the quantum simulation algorithm with very accurate and general starting states.
dc.description4 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/quant-ph/0512238
dc.identifierhttp://arxiv.org/abs/quant-ph/0512238
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/107975
dc.subjectQuantum Physics
dc.titleEfficient Preparation of Quantum States With Exponential Precision
dc.typetext

Files

Collections