Universal quantum computation via quantum controlled classical operations

Abstract

A universal set of gates for (classical or quantum) computation is a set of gates that can be used to approximate any other operation. It is well known that a universal set for classical computation augmented with the Hadamard gate results in universal quantum computing. Motivated by the latter, we pose the following question: can one perform universal quantum computation by supplementing a set of classical gates with a quantum control, and a set of quantum gates operating solely on the latter? In this work we provide an affirmative answer to this question by considering a computational model that consists of $2n$ target bits together with a set of classical gates controlled by log$(2n+1)$ ancillary qubits. We show that this model is equivalent to a quantum computer operating on $n$ qubits. Furthermore, we show that even a primitive computer that is capable of implementing only SWAP gates, can be lifted to universal quantum computing, if aided with an appropriate quantum control of logarithmic size. Our results thus exemplify the information processing power brought forth by the quantum control system.

11 pages, 4 figures, published version

References in corpus (9)

• Steering, Entanglement, Nonlocality, and the EPR Paradox
• A Quantum Gate between a Flying Optical Photon and a Single Trapped Atom
• From three-photon GHZ states to ballistic universal quantum computation
• Computational power of correlations
• A Simple Proof that Toffoli and Hadamard are Quantum Universal
• Experimental Quantum Communication Enhancement by Superposing Trajectories
• Both Toffoli and Controlled-NOT need little help to do universal quantum computation
• Fusion-based quantum computation
• Deterministic photonic quantum computation in a synthetic time dimension