pith. sign in

arxiv: 1808.02900 · v1 · pith:5J2QMCTQnew · submitted 2018-08-08 · 🪐 quant-ph

Repeat-Until-Success circuits with fixed-point oblivious amplitude amplification

classification 🪐 quant-ph
keywords successprocedureamplificationamplitudeobliviousprobabilityquantumstate
0
0 comments X
read the original abstract

Certain quantum operations can be built more efficiently through a procedure known as Repeat-Until-Success. Differently from other non-deterministic quantum operations, this procedure provides a classical flag which certifies the success or failure of the procedure and, in the latter case, a recovery step allows the restoration of the quantum state to its original condition. The procedure can then be repeated until success is achieved. After success is certified, the RUS procedure can be equated to a coherent gate. However, this is not the case when the operation needs to be conditioned on the state of other qubits, possibly being in a superposition state. In this situation, the final operation depends on the failure and success history and introduces a "distortion" that, even after the final success, depends on the past outcomes. We quantify the distortion and show that it can be reduced by increasing the probability of success towards unity. While this can be achieved via oblivious amplitude amplification when the initial success probability is known, we propose the use of fixed-point oblivious amplitude amplification to reduce this unwanted distortions below any given threshold even without knowing the initial success probability.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.