Amazon scientists coauthor 13 QIP 2021 quantum computing papers

海外精选
海外精选的内容汇集了全球优质的亚马逊云科技相关技术内容。同时,内容中提到的“AWS” 是 “Amazon Web Services” 的缩写,在此网站不作为商标展示。
0
0
{"value":"Quantum computers are an emerging technology that, in the long run, promises to perform some computations much more rapidly — even exponentially more rapidly — than classical computers can. Where classical computers represent information using bits, quantum computers use quantum bits, or qubits, which take advantage of the quantum phenomena of superposition and entanglement.\n\nIn 2019, Amazon announced the formation of the new ++[Amazon Web Services Center for Quantum Computing](https://aws.amazon.com/blogs/aws/amazon-braket-get-started-with-quantum-computing/)++, led by ++[Oskar Painter](https://www.amazon.science/author/oskar-painter)++, head of quantum hardware at Amazon Web Services and the John G. Braun Professor of Applied Physics at Caltech, and ++[Fernando Brandão](https://www.amazon.science/author/fernando-brandao)++, head of quantum algorithms at Amazon Web Services and Bren Professor of Theoretical Physics at Caltech. The center began construction on a new research space on the Caltech campus last year.\n\nResearchers affiliated with the center — including Brandão and Amazon Scholars ++[John Preskill](https://www.amazon.science/blog/amazon-scholar-john-preskill-on-the-aws-quantum-computing-effort)++ and ++[Liang Jiang](https://www.linkedin.com/in/liang-jiang-bb55a110/)++ — are coauthors of 13 papers accepted to this week's Conference on Quantum Information Processing (QIP), the premier conference on the theory of quantum computation and information. Those papers fall into three broad categories:\n\n\n#### **Quantum error correction and fault tolerance**\n\n\nBecause most of today's qubits are noisy (and thus error prone), ++[quantum error correction](https://www.amazon.science/tag/quantum-error-correction)++ is crucial to all existing quantum computer designs. In a classical computer, error correction involves looking at a sequence of bits that have mathematical relationships with each other and identifying bits that violate those relationships. Looking at the value of a qubit, however, destroys quantum information, so quantum error correction is even more challenging and complex than its classical analogue. These papers make progress both on the design of quantum error correction schemes and in applying the tools of quantum error correction to other fields, from quantum metrology to black-hole physics.\n\n![image.png](https://dev-media.amazoncloud.cn/30d183c291734eb486c19c5b9112d7e6_image.png)\n\nThe projection decoder for the 2-D color code of distance d = 7 on the lattice L2D, a figure from \"++[The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes](https://www.amazon.science/publications/the-cost-of-universality-a-comparative-study-of-the-overhead-of-state-distillation-and-code-switching-with-color-codes)++\".\n\n**\"++[The XZZX surface code](https://arxiv.org/pdf/2009.07851.pdf)++\"**\nPablo Bonilla Ataides, David Tuckett, Stephen Bartlett, ++[Steven Flammia](https://scholar.google.com/citations?user=-VnX0xYAAAAJ&hl=en)++, and Benjamin Brown\n\n**\"++[The ghost in the radiation: Robust encodings of the black hole interior](https://arxiv.org/pdf/2003.05451.pdf)++\"**\nIsaac Kim, Eugene Tang, and **John Preskill**\n\n**\"++[The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes](https://www.amazon.science/publications/the-cost-of-universality-a-comparative-study-of-the-overhead-of-state-distillation-and-code-switching-with-color-codes)++\"**\nMichael Beverland, ++[Aleksander Kubica](https://www.amazon.science/latest-news/the-quantum-gambit)++, and Krysta M. Svore\n\n**\"++[Quantum coding with low-depth random circuits](https://arxiv.org/pdf/2010.09775)++\"**\nMichael Gullans, Stefan Krastanov, David Huse, **Liang Jiang**, and **Steven Flammia**\n\n\n#### **Quantum algorithms and quantum computing applications**\n\n\nWhere a classical bit can have a value of either zero or one, a qubit can have a value of zero, one, or a superposition of the two. Performing a measurement on a qubit, however, causes it to fall out of superposition. The art of designing a quantum algorithm is to encode a problem into a string of entangled qubits so that, when the qubits fall out of superposition, their values represent the solution to the problem. These papers find new use cases for quantum computers, in areas from chemistry to machine learning, and also give insights into their limitations.\n\n![image.png](https://dev-media.amazoncloud.cn/63810c4970e8450d85656cc50c5311db_image.png)\n\nSummary of a series of maps for Haar-random 1-D circuits with weak measurements, a figure from \"++[Efficient classical simulation of random shallow 2D quantum circuits](https://www.amazon.science/publications/efficient-classical-simulation-of-random-shallow-2d-quantum-circuits)++\".\n\n**\"++[Efficient classical simulation of random shallow 2D quantum circuits](https://www.amazon.science/publications/efficient-classical-simulation-of-random-shallow-2d-quantum-circuits)++\"**\nJohn Napp, Rolando La Placa, Alexander Dalzell, **++[Fernando Brandão](https://www.amazon.science/author/fernando-brandao)++**, and Aram Harrow\n\n**\"++[Nearly tight Trotterization of correlated electrons](https://www.amazon.science/publications/nearly-tight-trotterization-of-correlated-electrons)++\"**\nYuan Su, Hsin-Yuan Huang, and **++[Earl Campbell](https://www.amazon.science/author/earl-campbell)++**\n\n**\"++[Random quantum circuits anti-concentrate in log depth](https://arxiv.org/pdf/2011.12277)++\"**\nAlexander Dalzell, Nicholas Hunter-Jones, and **Fernando Brandão** \n\n**\"++[Fundamental aspects of solving quantum problems with machine learning](https://www.mcqst.de/qip2021/program/friday.html)++\"**\nHsin-Yuan Huang, Richard Kueng, Michael Broughton, Masoud Mohseni, Ryan Babbush, Sergio Boixo, Hartmut Neven, Jarrod McClean, and **John Preskill**\n\n**\"++[Characterization of solvable spin models via graph invariants](https://arxiv.org/pdf/2003.05465)++\"**\nAdrian Chapman and **Steven Flammia**\n\n\n#### **Quantum metrology and communication**\n\n\nMany important applications of quantum computing will depend on quantum communication, or conveying quantum information from one point to another without losing entanglement and superposition, and quantum metrology, or performing accurate measurements on quantum systems. These papers address problems in both fields.\n\n**\"++[Enhanced energy-constrained quantum communication over bosonic Gaussian channels using multi-channel strategies](https://www.mcqst.de/qip2021/program/monday.html)++\"**\n**++[Kyungjoo Noh](https://www.amazon.science/author/kyungjoo-noh)++**, Stefano Pirandola, and **Liang Jiang**\n\n**\"++[Bipartite energy-time uncertainty relation for quantum metrology with noise](https://www.mcqst.de/qip2021/program/monday.html)++\"**\nPhilippe Faist, Mischa Woods, Victor V. Albert, Joseph M. Renes, Jens Eisert, and **John Preskill**\n\n**\"++[Asymptotic theory of quantum channel estimation](https://arxiv.org/pdf/2003.10559.pdf)++\"**\nSisi Zhou and **Liang Jiang**\n\n**\"++[Using quantum metrological bounds in quantum error correction: A simple proof of the approximate Eastin-Knill theorem](https://www.mcqst.de/qip2021/program/monday.html)++\"**\n**Aleksander Kubica** and Rafał Demkowicz-Dobrzański\n\n**Amazon Web Services quantum researcher wins quantum chess tournament**\n\nAleksander Kubica, a coauthor of two papers at QIP 2021, also won last year's first-ever ++[quantum chess tournament](https://www.amazon.science/latest-news/the-quantum-gambit)++.\n\nABOUT THE AUTHOR\n\n#### **[Larry Hardesty](https://www.amazon.science/author/larry-hardesty)**\n\nLarry Hardesty is the editor of the Amazon Science blog. Previously, he was a senior editor at MIT Technology Review and the computer science writer at the MIT News Office.","render":"<p>Quantum computers are an emerging technology that, in the long run, promises to perform some computations much more rapidly — even exponentially more rapidly — than classical computers can. Where classical computers represent information using bits, quantum computers use quantum bits, or qubits, which take advantage of the quantum phenomena of superposition and entanglement.</p>\n<p>In 2019, Amazon announced the formation of the new <ins><a href=\"https://aws.amazon.com/blogs/aws/amazon-braket-get-started-with-quantum-computing/\" target=\"_blank\">Amazon Web Services Center for Quantum Computing</a></ins>, led by <ins><a href=\"https://www.amazon.science/author/oskar-painter\" target=\"_blank\">Oskar Painter</a></ins>, head of quantum hardware at Amazon Web Services and the John G. Braun Professor of Applied Physics at Caltech, and <ins><a href=\"https://www.amazon.science/author/fernando-brandao\" target=\"_blank\">Fernando Brandão</a></ins>, head of quantum algorithms at Amazon Web Services and Bren Professor of Theoretical Physics at Caltech. The center began construction on a new research space on the Caltech campus last year.</p>\n<p>Researchers affiliated with the center — including Brandão and Amazon Scholars <ins><a href=\"https://www.amazon.science/blog/amazon-scholar-john-preskill-on-the-aws-quantum-computing-effort\" target=\"_blank\">John Preskill</a></ins> and <ins><a href=\"https://www.linkedin.com/in/liang-jiang-bb55a110/\" target=\"_blank\">Liang Jiang</a></ins> — are coauthors of 13 papers accepted to this week’s Conference on Quantum Information Processing (QIP), the premier conference on the theory of quantum computation and information. Those papers fall into three broad categories:</p>\n<h4><a id=\"Quantum_error_correction_and_fault_tolerance_7\"></a><strong>Quantum error correction and fault tolerance</strong></h4>\n<p>Because most of today’s qubits are noisy (and thus error prone), <ins><a href=\"https://www.amazon.science/tag/quantum-error-correction\" target=\"_blank\">quantum error correction</a></ins> is crucial to all existing quantum computer designs. In a classical computer, error correction involves looking at a sequence of bits that have mathematical relationships with each other and identifying bits that violate those relationships. Looking at the value of a qubit, however, destroys quantum information, so quantum error correction is even more challenging and complex than its classical analogue. These papers make progress both on the design of quantum error correction schemes and in applying the tools of quantum error correction to other fields, from quantum metrology to black-hole physics.</p>\n<p><img src=\"https://dev-media.amazoncloud.cn/30d183c291734eb486c19c5b9112d7e6_image.png\" alt=\"image.png\" /></p>\n<p>The projection decoder for the 2-D color code of distance d = 7 on the lattice L2D, a figure from “<ins><a href=\"https://www.amazon.science/publications/the-cost-of-universality-a-comparative-study-of-the-overhead-of-state-distillation-and-code-switching-with-color-codes\" target=\"_blank\">The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes</a></ins>”.</p>\n<p><strong>&quot;<ins><a href=\"https://arxiv.org/pdf/2009.07851.pdf\" target=\"_blank\">The XZZX surface code</a></ins>&quot;</strong><br />\nPablo Bonilla Ataides, David Tuckett, Stephen Bartlett, <ins><a href=\"https://scholar.google.com/citations?user=-VnX0xYAAAAJ&amp;hl=en\" target=\"_blank\">Steven Flammia</a></ins>, and Benjamin Brown</p>\n<p><strong>&quot;<ins><a href=\"https://arxiv.org/pdf/2003.05451.pdf\" target=\"_blank\">The ghost in the radiation: Robust encodings of the black hole interior</a></ins>&quot;</strong><br />\nIsaac Kim, Eugene Tang, and <strong>John Preskill</strong></p>\n<p><strong>&quot;<ins><a href=\"https://www.amazon.science/publications/the-cost-of-universality-a-comparative-study-of-the-overhead-of-state-distillation-and-code-switching-with-color-codes\" target=\"_blank\">The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes</a></ins>&quot;</strong><br />\nMichael Beverland, <ins><a href=\"https://www.amazon.science/latest-news/the-quantum-gambit\" target=\"_blank\">Aleksander Kubica</a></ins>, and Krysta M. Svore</p>\n<p><strong>&quot;<ins><a href=\"https://arxiv.org/pdf/2010.09775\" target=\"_blank\">Quantum coding with low-depth random circuits</a></ins>&quot;</strong><br />\nMichael Gullans, Stefan Krastanov, David Huse, <strong>Liang Jiang</strong>, and <strong>Steven Flammia</strong></p>\n<h4><a id=\"Quantum_algorithms_and_quantum_computing_applications_29\"></a><strong>Quantum algorithms and quantum computing applications</strong></h4>\n<p>Where a classical bit can have a value of either zero or one, a qubit can have a value of zero, one, or a superposition of the two. Performing a measurement on a qubit, however, causes it to fall out of superposition. The art of designing a quantum algorithm is to encode a problem into a string of entangled qubits so that, when the qubits fall out of superposition, their values represent the solution to the problem. These papers find new use cases for quantum computers, in areas from chemistry to machine learning, and also give insights into their limitations.</p>\n<p><img src=\"https://dev-media.amazoncloud.cn/63810c4970e8450d85656cc50c5311db_image.png\" alt=\"image.png\" /></p>\n<p>Summary of a series of maps for Haar-random 1-D circuits with weak measurements, a figure from “<ins><a href=\"https://www.amazon.science/publications/efficient-classical-simulation-of-random-shallow-2d-quantum-circuits\" target=\"_blank\">Efficient classical simulation of random shallow 2D quantum circuits</a></ins>”.</p>\n<p><strong>&quot;<ins><a href=\"https://www.amazon.science/publications/efficient-classical-simulation-of-random-shallow-2d-quantum-circuits\" target=\"_blank\">Efficient classical simulation of random shallow 2D quantum circuits</a></ins>&quot;</strong><br />\nJohn Napp, Rolando La Placa, Alexander Dalzell, <strong><ins><a href=\"https://www.amazon.science/author/fernando-brandao\" target=\"_blank\">Fernando Brandão</a></ins></strong>, and Aram Harrow</p>\n<p><strong>&quot;<ins><a href=\"https://www.amazon.science/publications/nearly-tight-trotterization-of-correlated-electrons\" target=\"_blank\">Nearly tight Trotterization of correlated electrons</a></ins>&quot;</strong><br />\nYuan Su, Hsin-Yuan Huang, and <strong><ins><a href=\"https://www.amazon.science/author/earl-campbell\" target=\"_blank\">Earl Campbell</a></ins></strong></p>\n<p><strong>&quot;<ins><a href=\"https://arxiv.org/pdf/2011.12277\" target=\"_blank\">Random quantum circuits anti-concentrate in log depth</a></ins>&quot;</strong><br />\nAlexander Dalzell, Nicholas Hunter-Jones, and <strong>Fernando Brandão</strong></p>\n<p><strong>&quot;<ins><a href=\"https://www.mcqst.de/qip2021/program/friday.html\" target=\"_blank\">Fundamental aspects of solving quantum problems with machine learning</a></ins>&quot;</strong><br />\nHsin-Yuan Huang, Richard Kueng, Michael Broughton, Masoud Mohseni, Ryan Babbush, Sergio Boixo, Hartmut Neven, Jarrod McClean, and <strong>John Preskill</strong></p>\n<p><strong>&quot;<ins><a href=\"https://arxiv.org/pdf/2003.05465\" target=\"_blank\">Characterization of solvable spin models via graph invariants</a></ins>&quot;</strong><br />\nAdrian Chapman and <strong>Steven Flammia</strong></p>\n<h4><a id=\"Quantum_metrology_and_communication_54\"></a><strong>Quantum metrology and communication</strong></h4>\n<p>Many important applications of quantum computing will depend on quantum communication, or conveying quantum information from one point to another without losing entanglement and superposition, and quantum metrology, or performing accurate measurements on quantum systems. These papers address problems in both fields.</p>\n<p><strong>&quot;<ins><a href=\"https://www.mcqst.de/qip2021/program/monday.html\" target=\"_blank\">Enhanced energy-constrained quantum communication over bosonic Gaussian channels using multi-channel strategies</a></ins>&quot;</strong><br />\n<strong><ins><a href=\"https://www.amazon.science/author/kyungjoo-noh\" target=\"_blank\">Kyungjoo Noh</a></ins></strong>, Stefano Pirandola, and <strong>Liang Jiang</strong></p>\n<p><strong>&quot;<ins><a href=\"https://www.mcqst.de/qip2021/program/monday.html\" target=\"_blank\">Bipartite energy-time uncertainty relation for quantum metrology with noise</a></ins>&quot;</strong><br />\nPhilippe Faist, Mischa Woods, Victor V. Albert, Joseph M. Renes, Jens Eisert, and <strong>John Preskill</strong></p>\n<p><strong>&quot;<ins><a href=\"https://arxiv.org/pdf/2003.10559.pdf\" target=\"_blank\">Asymptotic theory of quantum channel estimation</a></ins>&quot;</strong><br />\nSisi Zhou and <strong>Liang Jiang</strong></p>\n<p><strong>&quot;<ins><a href=\"https://www.mcqst.de/qip2021/program/monday.html\" target=\"_blank\">Using quantum metrological bounds in quantum error correction: A simple proof of the approximate Eastin-Knill theorem</a></ins>&quot;</strong><br />\n<strong>Aleksander Kubica</strong> and Rafał Demkowicz-Dobrzański</p>\n<p><strong>Amazon Web Services quantum researcher wins quantum chess tournament</strong></p>\n<p>Aleksander Kubica, a coauthor of two papers at QIP 2021, also won last year’s first-ever <ins><a href=\"https://www.amazon.science/latest-news/the-quantum-gambit\" target=\"_blank\">quantum chess tournament</a></ins>.</p>\n<p>ABOUT THE AUTHOR</p>\n<h4><a id=\"Larry_Hardestyhttpswwwamazonscienceauthorlarryhardesty_77\"></a><strong><a href=\"https://www.amazon.science/author/larry-hardesty\" target=\"_blank\">Larry Hardesty</a></strong></h4>\n<p>Larry Hardesty is the editor of the Amazon Science blog. Previously, he was a senior editor at MIT Technology Review and the computer science writer at the MIT News Office.</p>\n"}
目录
亚马逊云科技解决方案 基于行业客户应用场景及技术领域的解决方案
联系亚马逊云科技专家
亚马逊云科技解决方案
基于行业客户应用场景及技术领域的解决方案
联系专家
0
目录
关闭
contact-us