Universal quantum computation via quantum controlled classical operations
From MaRDI portal
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.
Recommendations
- Classically-controlled quantum computation
- Classically controlled quantum computation
- Universal quantum computation with unlabelled qubits
- Universality of quantum Turing machines with deterministic control
- Automata, Languages and Programming
- Universal quantum computation on the power of quantum non-demolition measurements
- A unified approach to quantum computation and classical reversible computation
- Universal quantum computation in a hidden basis
- Universal quantum computation with ideal Clifford gates and noisy ancillas
Cites work
- A new universal and fault-tolerant quantum basis
- Encoded universality from a single physical interaction
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Realizable Universal Quantum Logic Gates
- Scalable trapped ion quantum computation with a probabilistic ion-photon mapping
- Steering, entanglement, nonlocality, and the Einstein-Podolsky-Rosen paradox
- The simplest proof of Burnside's theorem on matrix algebras
- Twisted graph states for ancilla-driven universal quantum computation
Cited in
(10)- Classical emulation of a quantum computer
- Classically-controlled quantum computation
- Quantum circuits cannot control unknown operations
- scientific article; zbMATH DE number 5320183 (Why is no real title available?)
- Both Toffoli and Controlled-NOT need little help to universal quantum computing
- On a measurement-free quantum lambda calculus with classical control
- Universal photonic quantum computation via time-delayed feedback
- Signal-based classical emulation of a universal quantum computer
- Universal quantum computation with unlabelled qubits
- Universal Classical Optical Computing Inspired by Quantum Information Process
This page was built for publication: Universal quantum computation via quantum controlled classical operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5049658)