\n \n \n
\n
\n\n \n \n \n \n \n Subsystem methods for continuous-variable quantum computing with the Gottesman-Kitaev-Preskill code.\n \n \n \n\n\n \n PANTALEONI, G.\n\n\n \n\n\n\n Ph.D. Thesis, RMIT University, 2021.\n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n\n\n\n
\n
@phdthesis{PANTALEONIGiacomo2021Smfc,\n\tabstract = {We introduce a decomposition of the Hilbert space of continuous-variable quantum mechanics into two separate subsystems, by providing a tensor-product basis for said Hilbert space. One subsystem is 2-dimensional and is interpreted as "logical", while the remaining subsystem is another quantum mode. The decomposition allows one to extract qubits that are compatible with the Gottesman-Kitaev-Preskill code from any continuous-variable state. We will then show that any continuous-variable computational scheme carries qubit information. We argue how, and in which sense, this construction bridges the gap between standard, qubit-based quantum computing and continuous-variable quantum computing. Finally, we apply the decomposition to various situations of interest for continuous-variable quantum computing: in particular, we reveal the logical information carried by continuous-variable cluster states in their idealized, infinite-energy version and in their physical approximations.},\n\tauthor = {PANTALEONI, Giacomo},\n\tdate-added = {2021-08-27 16:17:31 +1000},\n\tdate-modified = {2021-08-27 16:18:00 +1000},\n\tkeywords = {GKP;Quantum computing;Continuous-variable;Cluster states;Gaussian states;Gottesman-Kitaev-Preskill},\n\tschool = {RMIT University},\n\ttitle = {Subsystem methods for continuous-variable quantum computing with the {Gottesman-Kitaev-Preskill} code},\n\tyear = {2021}}\n\n
\n
\n\n\n
\n We introduce a decomposition of the Hilbert space of continuous-variable quantum mechanics into two separate subsystems, by providing a tensor-product basis for said Hilbert space. One subsystem is 2-dimensional and is interpreted as \"logical\", while the remaining subsystem is another quantum mode. The decomposition allows one to extract qubits that are compatible with the Gottesman-Kitaev-Preskill code from any continuous-variable state. We will then show that any continuous-variable computational scheme carries qubit information. We argue how, and in which sense, this construction bridges the gap between standard, qubit-based quantum computing and continuous-variable quantum computing. Finally, we apply the decomposition to various situations of interest for continuous-variable quantum computing: in particular, we reveal the logical information carried by continuous-variable cluster states in their idealized, infinite-energy version and in their physical approximations.\n
\n\n\n
\n\n\n\n\n\n