A minimum control ancilla driven quantum computation scheme with repeat-until-success style gate generation
classification
🪐 quant-ph
keywords
ancillauniversalcomputationquantumcontroldrivengateinteractions
read the original abstract
Some two qubit interactions are singly sufficient for universal quantum computation but not without the use of an ancilla. Recent schemes for universal quantum computation have focused on hybrid physical systems using ancillae. In them, the application of resources is shifted to the ancilla system. We consider which 2-qubit interactions are universal in ancilla schemes where direct connections between main register qubits are forbidden. By the use of ancilla driven operations and repeat-until-success style random gates, a single fixed symmetric gate can be universal be control of the number of repetitions alone.
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.