Efficient Preparation of Quantum States With Exponential Precision
Peter Jaksch
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.
Create a lesson
Related papers
An entangling Hubbard quasiparticle collider on a digital quantum processor
Chan Bin Bark, Hanbyul Kim, Yoonil Koo et al.
A Warped Born Rule Turns an Observer into a Maxwell's Demon
Olumakinde Ogunnaike
A scalable sample-based quantum diagonalization solver for general Pauli-sum Hamiltonians
Yutaro Iiyama
Quantum Query Complexity of Maximum Degree and its Generalizations
Amin Shiraz Gilani, Nikhil S. Mande, Subhasree Patro et al.
Maximally antiflat fixed-particle-number fermionic states
Rahul Gupta, Arya Haghighian, James D. Whitfield
An Annealing-based Quantum Neural Network with Discrete Wavelet Transforms for Enhanced Air Pollution Nowcasting
Otto Menegasso Pires, André Saimon, Daniela Herrmann et al.