Efficient Synthesis of Universal Repeat-Until-Success Quantum Circuits
Efficient Synthesis of Universal Repeat-Until-Success Quantum Circuits
Recently it was shown that the resources required to implement unitary operations on a quantum computer can be reduced by using probabilistic quantum circuits called repeat-until-success (RUS) circuits. However, the previously best-known algorithm to synthesize a RUS circuit for a given target unitary requires exponential classical runtime. We present a …