Universal quantum computation via quantum controlled classical operations
arXiv:2104.06424 · doi:10.1088/1751-8121/ac4393
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 target bits together with a set of classical gates controlled by log ancillary qubits. We show that this model is equivalent to a quantum computer operating on 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.
arXiv comment11 pages, 4 figures, published version
References in corpus (28)
- Elementary gates for quantum computation
- Steering, Entanglement, Nonlocality, and the EPR Paradox
- Experimental One-Way Quantum Computing
- Measurement-based quantum computation
- Two-Bit Gates are Universal for Quantum Computation
- Scalable photonic quantum computation through cavity-assisted interaction
- Quantum Computing Using Dissipation to Remain in a Decoherence-Free Subspace
- A Quantum Gate between a Flying Optical Photon and a Single Trapped Atom
- A photon-photon quantum gate based on a single atom in an optical resonator
- Computational advantage from quantum-controlled ordering of gates
- Repeat-Until-Success Quantum Computing
- Enhanced communication with the assistance of indefinite causal order
- From three-photon GHZ states to ballistic universal quantum computation
- Exponential Communication Complexity Advantage from Quantum Superposition of the Direction of Communication
- Computational power of correlations
- Repeat-Until-Success quantum computing using stationary and flying qubits
- 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
- Communication through coherent control of quantum channels
- Communication through quantum-controlled noise
- Ancilla-Driven Universal Quantum Computation
- Fusion-based quantum computation
- Universal Quantum Computing with Arbitrary Continuous-Variable Encoding
- Deterministic photonic quantum computation in a synthetic time dimension
- Encoded Universality in Physical Implementations of a Quantum Computer
- Ancilla-driven quantum computation for qudits and continuous variables
- A minimum control ancilla driven quantum computation scheme with repeat-until-success style gate generation