Efficient Preparation of Quantum States With Exponential Precision

Abstract

It 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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…