Annovi, Filippo
(2015)
Exploring Quantum Speed-up Through Cluster-state Computers, [Dissertation thesis], Alma Mater Studiorum Università di Bologna.
Dottorato di ricerca in
Science, cognition and technology, 27 Ciclo. DOI 10.6092/unibo/amsdottorato/7008.
Documenti full-text disponibili:
Abstract
The aim of this thesis is to investigate the nature of quantum computation and the question of the quantum speed-up over classical computation by comparing two different quantum computational frameworks, the traditional quantum circuit model and the cluster-state quantum computer. After an introductory survey of the theoretical and epistemological questions concerning quantum computation, the first part of this thesis provides a presentation of cluster-state computation suitable for a philosophical audience. In spite of the computational equivalence between the two frameworks, their differences can be considered as structural. Entanglement is shown to play a fundamental role in both quantum circuits and cluster-state computers; this supports, from a new perspective, the argument that entanglement can reasonably explain the quantum speed-up over classical computation. However, quantum circuits and cluster-state computers diverge with regard to one of the explanations of quantum computation that actually accords a central role to entanglement, i.e. the Everett interpretation. It is argued that, while cluster-state quantum computation does not show an Everettian failure in accounting for the computational processes, it threatens that interpretation of being not-explanatory. This analysis presented here should be integrated in a more general work in order to include also further frameworks of quantum computation, e.g. topological quantum computation. However, what is revealed by this work is that the speed-up question does not capture all that is at stake: both quantum circuits and cluster-state computers achieve the speed-up, but the challenges that they posit go besides that specific question. Then, the existence of alternative equivalent quantum computational models suggests that the ultimate question should be moved from the speed-up to a sort of “representation theorem” for quantum computation, to be meant as the general goal of identifying the physical features underlying these alternative frameworks that allow for labelling those frameworks as “quantum computation”.
Abstract
The aim of this thesis is to investigate the nature of quantum computation and the question of the quantum speed-up over classical computation by comparing two different quantum computational frameworks, the traditional quantum circuit model and the cluster-state quantum computer. After an introductory survey of the theoretical and epistemological questions concerning quantum computation, the first part of this thesis provides a presentation of cluster-state computation suitable for a philosophical audience. In spite of the computational equivalence between the two frameworks, their differences can be considered as structural. Entanglement is shown to play a fundamental role in both quantum circuits and cluster-state computers; this supports, from a new perspective, the argument that entanglement can reasonably explain the quantum speed-up over classical computation. However, quantum circuits and cluster-state computers diverge with regard to one of the explanations of quantum computation that actually accords a central role to entanglement, i.e. the Everett interpretation. It is argued that, while cluster-state quantum computation does not show an Everettian failure in accounting for the computational processes, it threatens that interpretation of being not-explanatory. This analysis presented here should be integrated in a more general work in order to include also further frameworks of quantum computation, e.g. topological quantum computation. However, what is revealed by this work is that the speed-up question does not capture all that is at stake: both quantum circuits and cluster-state computers achieve the speed-up, but the challenges that they posit go besides that specific question. Then, the existence of alternative equivalent quantum computational models suggests that the ultimate question should be moved from the speed-up to a sort of “representation theorem” for quantum computation, to be meant as the general goal of identifying the physical features underlying these alternative frameworks that allow for labelling those frameworks as “quantum computation”.
Tipologia del documento
Tesi di dottorato
Autore
Annovi, Filippo
Supervisore
Dottorato di ricerca
Scuola di dottorato
Scienze umanistiche
Ciclo
27
Coordinatore
Settore disciplinare
Settore concorsuale
Parole chiave
Quantum Computation; Quantum Computing; ; Classical Computation; Quantum Speed-up; Cluster-state Quantum Computers; Quantum Circuits; Entanglement; Everett Interpretation; Philosophy of Physics; Quantum Mechanics
URN:NBN
DOI
10.6092/unibo/amsdottorato/7008
Data di discussione
28 Maggio 2015
URI
Altri metadati
Tipologia del documento
Tesi di dottorato
Autore
Annovi, Filippo
Supervisore
Dottorato di ricerca
Scuola di dottorato
Scienze umanistiche
Ciclo
27
Coordinatore
Settore disciplinare
Settore concorsuale
Parole chiave
Quantum Computation; Quantum Computing; ; Classical Computation; Quantum Speed-up; Cluster-state Quantum Computers; Quantum Circuits; Entanglement; Everett Interpretation; Philosophy of Physics; Quantum Mechanics
URN:NBN
DOI
10.6092/unibo/amsdottorato/7008
Data di discussione
28 Maggio 2015
URI
Statistica sui download
Gestione del documento: