var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fwww.qurmit.org%2Fpublication-info%2Fpreprint.bib&jsonp=1&owner=none&folding=1&nocache=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fwww.qurmit.org%2Fpublication-info%2Fpreprint.bib&jsonp=1&owner=none&folding=1&nocache=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fwww.qurmit.org%2Fpublication-info%2Fpreprint.bib&jsonp=1&owner=none&folding=1&nocache=1\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
    2. \n
  2. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
    3. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2023\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Equivalent noise properties of scalable continuous-variable cluster states.\n \n \n \n\n\n \n Walshe, B. W.; Alexander, R. N.; Matsuura, T.; Baragiola, B. Q.; and Menicucci, N. C.\n\n\n \n\n\n\n 2023.\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\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@misc{walshe2023equivalent,\n\tarchiveprefix = {arXiv},\n\tauthor = {Blayney W. Walshe and Rafael N. Alexander and Takaya Matsuura and Ben Q. Baragiola and Nicolas C. Menicucci},\n\tdate-added = {2023-05-30 15:57:30 +1000},\n\tdate-modified = {2023-05-30 15:57:30 +1000},\n\teprint = {2305.11630},\n\tprimaryclass = {quant-ph},\n\ttitle = {Equivalent noise properties of scalable continuous-variable cluster states},\n\tyear = {2023}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Quantum lattice models that preserve continuous translation symmetry.\n \n \n \n\n\n \n Lewis, D. G.; Kempf, A.; and Menicucci, N. C.\n\n\n \n\n\n\n 2023.\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\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@misc{lewis2023quantum,\n\tarchiveprefix = {arXiv},\n\tauthor = {Dominic G. Lewis and Achim Kempf and Nicolas C. Menicucci},\n\tdate-added = {2023-03-31 11:25:03 +1100},\n\tdate-modified = {2023-03-31 11:25:03 +1100},\n\teprint = {2303.07649},\n\tprimaryclass = {quant-ph},\n\ttitle = {Quantum lattice models that preserve continuous translation symmetry},\n\tyear = {2023}}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2022\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n The Zak transform: a framework for quantum computation with the Gottesman-Kitaev-Preskill code.\n \n \n \n \n\n\n \n Pantaleoni, G.; Baragiola, B. Q.; and Menicucci, N. C.\n\n\n \n\n\n\n 2022.\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n 
@misc{https://doi.org/10.48550/arxiv.2210.09494,\n\tauthor = {Pantaleoni, Giacomo and Baragiola, Ben Q. and Menicucci, Nicolas C.},\n\tcopyright = {Creative Commons Attribution 4.0 International},\n\tdoi = {10.48550/ARXIV.2210.09494},\n\tkeywords = {Quantum Physics (quant-ph), FOS: Physical sciences, FOS: Physical sciences},\n\tpublisher = {arXiv},\n\ttitle = {The Zak transform: a framework for quantum computation with the Gottesman-Kitaev-Preskill code},\n\turl = {https://arxiv.org/abs/2210.09494},\n\tyear = {2022},\n\tbdsk-url-1 = {https://arxiv.org/abs/2210.09494},\n\tbdsk-url-2 = {https://doi.org/10.48550/ARXIV.2210.09494}}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2021\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n An efficient, concatenated, bosonic code for additive Gaussian noise.\n \n \n \n \n\n\n \n Fukui, K.; and Menicucci, N. C.\n\n\n \n\n\n\n 2021.\n \n\n\n\n
\n\n\n\n \n \n \"An arxiv\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 9 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@misc{fukui2021efficient,\n\tabstract = {Bosonic codes offer noise resilience for quantum information processing. A common type of noise in this setting is additive Gaussian noise, and a long-standing open problem is to design a concatenated code that achieves the hashing bound for this noise channel. Here we achieve this goal using a Gottesman-Kitaev-Preskill (GKP) code to detect and discard error-prone qubits, concatenated with a quantum parity code to handle the residual errors. Our method employs a linear-time decoder and has applications in a wide range of quantum computation and communication scenarios.},\n\tarchiveprefix = {arXiv},\n\tauthor = {Kosuke Fukui and Nicolas C. Menicucci},\n\tdate-added = {2021-02-05 09:36:06 +1100},\n\tdate-modified = {2021-02-05 09:37:58 +1100},\n\teprint = {2102.01374},\n\tprimaryclass = {quant-ph},\n\ttitle = {An efficient, concatenated, bosonic code for additive Gaussian noise},\n\turl_arxiv = {https://arxiv.org/abs/2102.01374},\n\tyear = {2021}}\n
\n
\n\n\n
\n Bosonic codes offer noise resilience for quantum information processing. A common type of noise in this setting is additive Gaussian noise, and a long-standing open problem is to design a concatenated code that achieves the hashing bound for this noise channel. Here we achieve this goal using a Gottesman-Kitaev-Preskill (GKP) code to detect and discard error-prone qubits, concatenated with a quantum parity code to handle the residual errors. Our method employs a linear-time decoder and has applications in a wide range of quantum computation and communication scenarios.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);