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

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.

References in corpus (13)

• Quantum Mechanics helps in searching for a needle in a haystack
• Simulated Quantum Computation of Molecular Energies
• Quantum Amplitude Amplification and Estimation
• A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
• Elucidating Reaction Mechanisms on Quantum Computers
• Fixed-point quantum search with an optimal number of queries
• A different kind of quantum search
• Novel constructions for the fault-tolerant Toffoli gate
• Efficient synthesis of universal Repeat-Until-Success circuits
• Quantum Neuron: an elementary building block for machine learning on quantum computers
• Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and T circuits
• Floating Point Representations in Quantum Circuit Synthesis
• Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitaries

Cited by in corpus (10)

• Single-particle digitization strategy for quantum computation of a ${\varphi }^4$ scalar field theory
• Implementation of Measurement Reduction for the Variational Quantum Eigensolver
• Realization of a quantum neural network using repeat-until-success circuits in a superconducting quantum processor
• Implementing smooth functions of a Hermitian matrix on a quantum computer
• Unitary Partitioning and the Contextual Subspace Variational Quantum Eigensolver
• Automatic Post-selection by Ancillae Thermalisation
• An Amplitude-Based Implementation of the Unit Step Function on a Quantum Computer
• Quantum Iterative Methods for Solving Differential Equations with Application to Computational Fluid Dynamics
• Block Lanczos method for excited states on a quantum computer
• Stochastic Schrödinger Equations for Quantum Reverse Diffusion