Volume 104, Number 2, October 2013
|Number of page(s)||4|
|Published online||26 November 2013|
Universality of computation in real quantum theory
1 SISSA - via Bonomea 265, 34136 Trieste, Italy
2 QUIT Group, Dipartimento di Fisica, Università di Pavia - via Bassi 6, 27100 Pavia, Italy
3 Istituto Nazionale di Fisica Nucleare, Gruppo IV - via Bassi 6, 27100 Pavia, Italy
Received: 9 August 2013
Accepted: 28 October 2013
Recently de la Torre et al. (Phys. Rev. Lett., 109 (2012) 090403) reconstructed Quantum Theory from its local structure on the basis of local discriminability and the existence of a one-parameter group of bipartite transformations containing an entangling gate. This result relies on universality of any entangling gate for quantum computation. Here we prove universality of C-NOT with local gates for Real Quantum Theory (RQT), showing that the universality requirement would not be sufficient for the result, whereas local discriminability and the local qubit structure play a crucial role. For reversible computation, generally an extra rebit is needed for RQT. As a by-product we also provide a short proof of universality of C-NOT for CQT.
PACS: 03.67.-a – Quantum information / 03.65.Ta – Foundations of quantum mechanics; measurement theory / 03.67.Ac – Quantum algorithms, protocols, and simulations
© EPLA, 2013
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.