Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems

Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems

Researchers at Berkeley present a quantum eigenstate filtering algorithm that allows to efficiently prepare a target eigenstate of a given Hamiltonian to high precision under reasonable assumptions.

They have applied this algorithm to the quantum linear system problem, and present two algorithms based on quantum adiabatic computing and quantum Zeno effect respectively.

Both algorithms prepare the final solution as a pure state, and achieves the near optimal query complexity. Neither algorithm uses phase estimation or amplitude amplification.

Reference : https://doi.org/10.22331/q-2020-11-11-361

Read more.

Previous Article

ETH boosts Quantum Research in Switzerland

Next Article

Launch of first Canada’s Quantum Network

You might be interested in …

Leave a Reply

Your email address will not be published. Required fields are marked *

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

The reCAPTCHA verification period has expired. Please reload the page.