Fault-tolerant quantum computation with a neutral atom processor
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908401223598080 |
|---|---|
| author | Reichardt, Ben W. Paetznick, Adam Aasen, David Basov, Ivan Bello-Rivas, Juan M. Bonderson, Parsa Chao, Rui van Dam, Wim Hastings, Matthew B. Mishmash, Ryan V. Paz, Andres da Silva, Marcus P. Sundaram, Aarthi Svore, Krysta M. Vaschillo, Alexander Wang, Zhenghan Zanner, Matt Cairncross, William B. Chen, Cheng-An Crow, Daniel Kim, Hyosub Kindem, Jonathan M. King, Jonathan McDonald, Michael Norcia, Matthew A. Ryou, Albert Stone, Mark Wadleigh, Laura Barnes, Katrina Battaglino, Peter Bohdanowicz, Thomas C. Booth, Graham Brown, Andrew Brown, Mark O. Cassella, Kayleigh Coxe, Robin Epstein, Jeffrey M. Feldkamp, Max Griger, Christopher Halperin, Eli Heinz, Andre Hummel, Frederic Jaffe, Matthew Jones, Antonia M. W. Kapit, Eliot Kotru, Krish Lauigan, Joseph Li, Ming Marjanovic, Jan Megidish, Eli Meredith, Matthew Morshead, Ryan Muniz, Juan A. Narayanaswami, Sandeep Nishiguchi, Ciro Paule, Timothy Pawlak, Kelly A. Pudenz, Kristen L. Pérez, David Rodríguez Simon, Jon Smull, Aaron Stack, Daniel Urbanek, Miroslav van de Veerdonk, René J. M. Vendeiro, Zachary Weverka, Robert T. Wilkason, Thomas Wu, Tsung-Yao Xie, Xin Zalys-Geller, Evan Zhang, Xiaogang Bloom, Benjamin J. |
| author_facet | Reichardt, Ben W. Paetznick, Adam Aasen, David Basov, Ivan Bello-Rivas, Juan M. Bonderson, Parsa Chao, Rui van Dam, Wim Hastings, Matthew B. Mishmash, Ryan V. Paz, Andres da Silva, Marcus P. Sundaram, Aarthi Svore, Krysta M. Vaschillo, Alexander Wang, Zhenghan Zanner, Matt Cairncross, William B. Chen, Cheng-An Crow, Daniel Kim, Hyosub Kindem, Jonathan M. King, Jonathan McDonald, Michael Norcia, Matthew A. Ryou, Albert Stone, Mark Wadleigh, Laura Barnes, Katrina Battaglino, Peter Bohdanowicz, Thomas C. Booth, Graham Brown, Andrew Brown, Mark O. Cassella, Kayleigh Coxe, Robin Epstein, Jeffrey M. Feldkamp, Max Griger, Christopher Halperin, Eli Heinz, Andre Hummel, Frederic Jaffe, Matthew Jones, Antonia M. W. Kapit, Eliot Kotru, Krish Lauigan, Joseph Li, Ming Marjanovic, Jan Megidish, Eli Meredith, Matthew Morshead, Ryan Muniz, Juan A. Narayanaswami, Sandeep Nishiguchi, Ciro Paule, Timothy Pawlak, Kelly A. Pudenz, Kristen L. Pérez, David Rodríguez Simon, Jon Smull, Aaron Stack, Daniel Urbanek, Miroslav van de Veerdonk, René J. M. Vendeiro, Zachary Weverka, Robert T. Wilkason, Thomas Wu, Tsung-Yao Xie, Xin Zalys-Geller, Evan Zhang, Xiaogang Bloom, Benjamin J. |
| contents | Quantum computing experiments are transitioning from running on physical qubits to using encoded, logical qubits. Fault-tolerant computation can identify and correct errors, and has the potential to enable the dramatically reduced logical error rates required for valuable algorithms. However, it requires flexible control of high-fidelity operations performed on large numbers of qubits. We demonstrate fault-tolerant quantum computation on a quantum processor with 256 qubits, each an individual neutral Ytterbium atom. The operations are designed so that key error sources convert to atom loss, which can be detected by imaging. Full connectivity is enabled by atom movement. We demonstrate the entanglement of 24 logical qubits encoded into 48 atoms, at once catching errors and correcting for, on average 1.8, lost atoms. We also implement the Bernstein-Vazirani algorithm with up to 28 logical qubits encoded into 112 atoms, showing better-than-physical error rates. In both cases, "erasure conversion," changing errors into a form that can be detected independently from qubit state, improves circuit performance. These results begin to clear a path for achieving scientific quantum advantage with a programmable neutral atom quantum processor. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_11822 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Fault-tolerant quantum computation with a neutral atom processor Reichardt, Ben W. Paetznick, Adam Aasen, David Basov, Ivan Bello-Rivas, Juan M. Bonderson, Parsa Chao, Rui van Dam, Wim Hastings, Matthew B. Mishmash, Ryan V. Paz, Andres da Silva, Marcus P. Sundaram, Aarthi Svore, Krysta M. Vaschillo, Alexander Wang, Zhenghan Zanner, Matt Cairncross, William B. Chen, Cheng-An Crow, Daniel Kim, Hyosub Kindem, Jonathan M. King, Jonathan McDonald, Michael Norcia, Matthew A. Ryou, Albert Stone, Mark Wadleigh, Laura Barnes, Katrina Battaglino, Peter Bohdanowicz, Thomas C. Booth, Graham Brown, Andrew Brown, Mark O. Cassella, Kayleigh Coxe, Robin Epstein, Jeffrey M. Feldkamp, Max Griger, Christopher Halperin, Eli Heinz, Andre Hummel, Frederic Jaffe, Matthew Jones, Antonia M. W. Kapit, Eliot Kotru, Krish Lauigan, Joseph Li, Ming Marjanovic, Jan Megidish, Eli Meredith, Matthew Morshead, Ryan Muniz, Juan A. Narayanaswami, Sandeep Nishiguchi, Ciro Paule, Timothy Pawlak, Kelly A. Pudenz, Kristen L. Pérez, David Rodríguez Simon, Jon Smull, Aaron Stack, Daniel Urbanek, Miroslav van de Veerdonk, René J. M. Vendeiro, Zachary Weverka, Robert T. Wilkason, Thomas Wu, Tsung-Yao Xie, Xin Zalys-Geller, Evan Zhang, Xiaogang Bloom, Benjamin J. Quantum Physics Atomic Physics Quantum computing experiments are transitioning from running on physical qubits to using encoded, logical qubits. Fault-tolerant computation can identify and correct errors, and has the potential to enable the dramatically reduced logical error rates required for valuable algorithms. However, it requires flexible control of high-fidelity operations performed on large numbers of qubits. We demonstrate fault-tolerant quantum computation on a quantum processor with 256 qubits, each an individual neutral Ytterbium atom. The operations are designed so that key error sources convert to atom loss, which can be detected by imaging. Full connectivity is enabled by atom movement. We demonstrate the entanglement of 24 logical qubits encoded into 48 atoms, at once catching errors and correcting for, on average 1.8, lost atoms. We also implement the Bernstein-Vazirani algorithm with up to 28 logical qubits encoded into 112 atoms, showing better-than-physical error rates. In both cases, "erasure conversion," changing errors into a form that can be detected independently from qubit state, improves circuit performance. These results begin to clear a path for achieving scientific quantum advantage with a programmable neutral atom quantum processor. |
| title | Fault-tolerant quantum computation with a neutral atom processor |
| topic | Quantum Physics Atomic Physics |
| url | https://arxiv.org/abs/2411.11822 |