Optimal quantum measurements of expectation values of observables

By Emanuel Knill, G. Ortiz, Rolando D. Somma. 2006

203 citations recorded by the source corpus.

of A or on their tail distribution. These algorithms are particu larly useful for simulating quantum systems on quantum computers because they enable efficient measurement of observables and correlation functions. Our algorithms are based on a method for efficiently measuring the complex overlap of |ψi and U |ψi , where U is an implementable unitary operator. We explicitly consider the issue of confidence level s in measuring observables and overlaps and show that, as expected, confidence levels can be improved exponentially with linear overhead. We further show that the algorithms given here can typically be parallelized with minimal increase in resource usage.

Subfields: Artificial Intelligence, Atomic and Molecular Physics, and Optics

View Paper: https://www.semanticscholar.org/paper/c1cf01d3c4fd685aa2cb7836209f3a593d6270af

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Nathan Wiebe
  2. Ryan Babbush
  3. Jarrod R. McClean
  4. Göran Wendin
  5. Hartmut Neven
  6. Carlo Ciliberto
  7. Patrick J. Coles
  8. M. Cerezo

In Atomic and Molecular Physics, and Optics

  1. Jarrod R. McClean
  2. Ryan Babbush
  3. Nathan Wiebe
  4. Hartmut Neven
  5. Simone Severini
  6. Leonard Wossnig
  7. Massimiliano Pontil
  8. Mark Herbster

Citations in the corpus