Universality of Computation in Real Quantum Theory
In: EPL 104, 20006 (2013); (2012)
Online
report
Recently de La Torre et al. [1] 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 an entangling gate for quantum computation. Here we prove universality of C-NOT with local gates for Real Quantum Theory (RQT), showing that such universality would not be sufficient for the result, whereas local discriminability and the qubit structure play a crucial role. For reversible computation, generally an extra rebit is needed for RQT. As a byproduct we also provide a short proof of universality of C-NOT for CQT.
Titel: |
Universality of Computation in Real Quantum Theory
|
---|---|
Autor/in / Beteiligte Person: | Belenchia, Alessio ; D'Ariano, Giacomo Mauro ; Perinotti, Paolo |
Link: | |
Quelle: | EPL 104, 20006 (2013); (2012) |
Veröffentlichung: | 2012 |
Medientyp: | report |
DOI: | 10.1209/0295-5075/104/20006 |
Schlagwort: |
|
Sonstiges: |
|