Saving resources through repeat-until-success positive-operator-valued-measure measurements in quantum computation

Abstract

We present a quantum computation approach in which computation is guided by positive-operator-valuedmeasure (POVM) measurements following a given computation path in multisteps. In this approach, one ancillary qubit is coupled to a register of working qubits, and a POVM measurement is implemented effectively on the working qubits by applying a unitary operation on the whole system followed by a projective measurement performed on the ancillary qubit. Each step of the computation is a repeat-until-success procedure such that the desired state of the step is obtained deterministically on the working qubits via POVM measurements. The principle of deferred measurement states that measurements can always be moved from an intermediate stage of a quantum circuit to the end of the circuit without affecting the efficiency of the computation.We demonstrate that in our approach, by introducing intermediate measurements on the ancillary qubit in the computation process, both the number of qubits and unitary operations can be reduced polynomially, compared to the case where the intermediate measurements are deferred to the end of the computation. We also provide a method for implementation of the approach.

26 pages, 3 figures

References in corpus (6)

• Efficient synthesis of universal Repeat-Until-Success circuits
• Quantum Algorithm for Spectral Measurement with Lower Gate Count
• Quantum Simulation of Resonant Transitions for Solving the Eigen-problem of an Effective Water Hamiltonian
• Adiabatic preparation without Quantum Phase Transitions
• Success-or-Draw: A Strategy Allowing Repeat-Until-Success in Quantum Computation
• Quantum algorithm for PageRank computation through multistep quantum resonant transitions