Abstract

Quantum measurement is a fundamental cornerstone of experimental quantum computations. The main issues in current quantum measurement strategies are the high number of measurement rounds to determine a global optimal measurement output and the low success probability of finding a global optimal measurement output. Each measurement round requires preparing the quantum system and applying quantum operations and measurements with high-precision control in the physical layer. These issues result in extremely high-cost measurements with a low probability of success at the end of the measurement rounds. Here, we define a novel measurement for quantum computations called dense quantum measurement. The dense measurement strategy aims at fixing the main drawbacks of standard quantum measurements by achieving a significant reduction in the number of necessary measurement rounds and by radically improving the success probabilities of finding global optimal outputs. We provide application scenarios for quantum circuits with arbitrary unitary sequences, and prove that dense measurement theory provides an experimentally implementable solution for gate-model quantum computer architectures.

Highlights

  • Related WorksThe related works on quantum measurement theory, gate-model quantum computers and compressed sensing are summarized as follows

  • Quantum measurement is required element in high-complexity quantum computations, in high-performance quantum information processing and in quantum computer architectures

  • The repetition of a measurement round requires in each round the careful preparation of a quantum register of quantum states that are fed into a quantum circuit that realizes an arbitrary unitary sequence

Read more

Summary

Related Works

The related works on quantum measurement theory, gate-model quantum computers and compressed sensing are summarized as follows. In our manuscript the projective measurement with no post-processing on the measurement results is referred to as standard measurement (It is motivated by the fact, that in a gate-model quantum computer environment the output quantum system is measured with respect to a particular computational basis). In13, the authors studied the subject of objective function evaluation of computational problems fed into a gate-model quantum computer environment. The work proposed the performance of the algorithm at the utilization of different gate parameter values for the unitaries of the gate-model computer environment. The work concluded that the QAOA can be implemented on near-term gate-model quantum computers for optimization problems. In66, the authors analyzed the experimental implementation of the QAOA algorithm on near-term gate-model quantum devices.

Methods
Findings
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call