Universal quantum computation with unlabelled qubits
From MaRDI portal
Abstract: We show that an n-th root of the Walsh-Hadamard transform (obtained from the Hadamard gate and a cyclic permutation of the qubits), together with two diagonal matrices, namely a local qubit-flip (for a fixed but arbitrary qubit) and a non-local phase-flip (for a fixed but arbitrary coefficient), can do universal quantum computation on n qubits. A quantum computation, making use of n qubits and based on these operations, is then a word of variable length, but whose letters are always taken from an alphabet of cardinality three. Therefore, in contrast with other universal sets, no choice of qubit lines is needed for the application of the operations described here. A quantum algorithm based on this set can be interpreted as a discrete diffusion of a quantum particle on a de Bruijn graph, corrected on-the-fly by auxiliary modifications of the phases associated to the arcs.
Recommendations
- QUANTUM COMPUTATION BY MEASUREMENTS
- Both Toffoli and Controlled-NOT need little help to universal quantum computing
- The universality of the quantum Fourier transform in forming the basis of quantum computing algorithms
- Universal quantum computation via quantum controlled classical operations
- Automata, Languages and Programming
Cited in
(5)- Universal quantum computation with spin-1/2 pairs and Heisenberg exchange
- Universal Sets of Quantum Information Processing Primitives and their optimal use
- Unordered tuples in quantum computation
- Universal quantum computation via quantum controlled classical operations
- LIMIT THEOREMS FOR QUANTUM WALKS DRIVEN BY MANY COINS
This page was built for publication: Universal quantum computation with unlabelled qubits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5478413)
