Author: "Fowler, Austin" - Searchworks@Jio Institute Digital Library Search Results

Your search keyword '"Fowler, Austin"' showing total 300 results

Start Over Author "Fowler, Austin"

300 results on '"Fowler, Austin"'

1. Demonstrating dynamic surface codes

Author: Eickbusch, Alec, McEwen, Matt, Sivak, Volodymyr, Bourassa, Alexandre, Atalaya, Juan, Claes, Jahan, Kafri, Dvir, Gidney, Craig, Warren, Christopher W., Gross, Jonathan, Opremcak, Alex, Miao, Nicholas Zobrist Kevin C., Roberts, Gabrielle, Satzinger, Kevin J., Bengtsson, Andreas, Neeley, Matthew, Livingston, William P., Greene, Alex, Rajeev, Acharya, Beni, Laleh Aghababaie, Aigeldinger, Georg, Alcaraz, Ross, Andersen, Trond I., Ansmann, Markus, Frank, Arute, Arya, Kunal, Asfaw, Abraham, Babbush, Ryan, Ballard, Brian, Bardin, Joseph C., Bilmes, Alexander, Jenna, Bovaird, Bowers, Dylan, Brill, Leon, Broughton, Michael, Browne, David A., Buchea, Brett, Buckley, Bob B., Tim, Burger, Burkett, Brian, Bushnell, Nicholas, Cabrera, Anthony, Campero, Juan, Chang, Hung-Shen, Chiaro, Ben, Chih, Liang-Ying, Cleland, Agnetta Y., Cogan, Josh, Collins, Roberto, Conner, Paul, Courtney, William, Alexander, Crook, L., Curtin, Ben, Das, Sayan, Barba, Alexander Del Toro, Demura, Sean, De Lorenzo, Laura, Di Paolo, Agustin, Donohoe, Paul, Drozdov, Ilya K., Dunsworth, Andrew, Elbag, Aviv Moshe, Elzouka, Mahmoud, Erickson, Catherine, Ferreira, Vinicius S., Burgos, Leslie Flores, Forati, Ebrahim, Fowler, Austin G., Foxen, Brooks, Ganjam, Suhas, Gonzalo, Garcia, Gasca, Robert, Genois, Élie, Giang, William, Gilboa, Dar, Gosula, Raja, Dau, Alejandro Grajales, Dietrich, Graumann, Ha, Tan, Habegger, Steve, Hansen, Monica, Harrigan, Matthew P., Harrington, Sean D., Heslin, Stephen, Heu, Paula, Higgott, Oscar, Hiltermann, Reno, Hilton, Jeremy, Huang, Hsin-Yuan, Huff, Ashley, Huggins, William J., Jeffrey, Evan, Jiang, Zhang, Jin, Xiaoxuan, Jones, Cody, Joshi, Chaitali, Juhas, Pavol, Kabel, Andreas, Kang, Hui, Amir, Karamlou, H., Kechedzhi, Kostyantyn, Khaire, Trupti, Khattar, Tanuj, Khezri, Mostafa, Kim, Seon, Kobrin, Bryce, Korotkov, Alexander N., Kostritsa, Fedor, Kreikebaum, John Mark, Kurilovich, Vladislav D., Landhuis, David, Tiano, Lange-Dei, Langley, Brandon W., Lau, Kim-Ming, Ledford, Justin, Lee, Kenny, Lester, Brian J., Guevel, Loïck Le, Wing, Li, Yan, Lill, Alexander T., Locharla, Aditya, Lucero, Erik, Lundahl, Daniel, Lunt, Aaron, Madhuk, Sid, Maloney, Ashley, Mandrà, Salvatore, Martin, Leigh S., Martin, Orion, Maxfield, Cameron, McClean, Jarrod R., Meeks, Seneca, Anthony, Megrant, Molavi, Reza, Molina, Sebastian, Montazeri, Shirin, Movassagh, Ramis, Newman, Michael, Nguyen, Anthony, Nguyen, Murray, Ni, Chia-Hung, Oas, Logan, Orosco, Raymond, Ottosson, Kristoffer, Pizzuto, Alex, Potter, Rebecca, Pritchard, Orion, Quintana, Chris, Ramachandran, Ganesh, Reagor, Matthew J., Rhodes, David M., Rosenberg, Eliott, Rossi, Elizabeth, Sankaragomathi, Kannan, Schurkus, Henry F., Shearn, Michael J., Shorter, Aaron, Shutty, Noah, Shvarts, Vladimir, Small, Spencer, Smith, W. Clarke, Springer, Sofia, Sterling, George, Suchard, Jordan, Szasz, Aaron, Sztein, Alex, Thor, Douglas, Tomita, Eifu, Torres, Alfredo, Torunbalci, M. Mert, Vaishnav, Abeer, Vargas, Justin, Sergey, Vdovichev, Vidal, Guifre, Heidweiller, Catherine Vollgraff, Waltman, Steven, Waltz, Jonathan, Wang, Shannon X., Ware, Brayden, Weidel, Travis, White, Theodore, Wong, Kristi, Woo, Bryan W. K., Woodson, Maddy, Xing, Cheng, Yao, Z. Jamie, Yeh, Ping, Ying, Bicheng, Yoo, Juhwan, Yosri, Noureldin, Young, Grayson, Zalcman, Adam, Yaxing, Zhang, Zhu, Ningfeng, Boixo, Sergio, Kelly, Julian, Smelyanskiy, Vadim, Neven, Hartmut, Bacon, Dave, Chen, Zijun, Klimov, Paul V., Roushan, Pedram, Neill, Charles, Chen, Yu, and Morvan, Alexis
Subjects: Quantum Physics
Abstract: A remarkable characteristic of quantum computing is the potential for reliable computation despite faulty qubits. This can be achieved through quantum error correction, which is typically implemented by repeatedly applying static syndrome checks, permitting correction of logical information. Recently, the development of time-dynamic approaches to error correction has uncovered new codes and new code implementations. In this work, we experimentally demonstrate three time-dynamic implementations of the surface code, each offering a unique solution to hardware design challenges and introducing flexibility in surface code realization. First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three. Second, we walk a surface code, swapping the role of data and measure qubits each round, achieving error correction with built-in removal of accumulated non-computational errors. Finally, we realize the surface code using iSWAP gates instead of the traditional CNOT, extending the set of viable gates for error correction without additional overhead. We measure the error suppression factor when scaling from distance-3 to distance-5 codes of $\Lambda_{35,\text{hex}} = 2.15(2)$, $\Lambda_{35,\text{walk}} = 1.69(6)$, and $\Lambda_{35,\text{iSWAP}} = 1.56(2)$, achieving state-of-the-art error suppression for each. With detailed error budgeting, we explore their performance trade-offs and implications for hardware design. This work demonstrates that dynamic circuit approaches satisfy the demands for fault-tolerance and opens new alternative avenues for scalable hardware design., Comment: 11 pages, 5 figures, Supplementary Information
Published: 2024

2. Scaling and logic in the color code on a superconducting quantum processor

Author: Lacroix, Nathan, Bourassa, Alexandre, Heras, Francisco J. H., Zhang, Lei M., Bausch, Johannes, Senior, Andrew W., Edlich, Thomas, Shutty, Noah, Sivak, Volodymyr, Bengtsson, Andreas, McEwen, Matt, Higgott, Oscar, Kafri, Dvir, Claes, Jahan, Morvan, Alexis, Chen, Zijun, Zalcman, Adam, Madhuk, Sid, Acharya, Rajeev, Beni, Laleh Aghababaie, Aigeldinger, Georg, Alcaraz, Ross, Andersen, Trond I., Ansmann, Markus, Arute, Frank, Arya, Kunal, Asfaw, Abraham, Atalaya, Juan, Babbush, Ryan, Ballard, Brian, Bardin, Joseph C., Bilmes, Alexander, Blackwell, Sam, Bovaird, Jenna, Bowers, Dylan, Brill, Leon, Broughton, Michael, Browne, David A., Buchea, Brett, Buckley, Bob B., Burger, Tim, Burkett, Brian, Bushnell, Nicholas, Cabrera, Anthony, Campero, Juan, Chang, Hung-Shen, Chiaro, Ben, Chih, Liang-Ying, Cleland, Agnetta Y., Cogan, Josh, Collins, Roberto, Conner, Paul, Courtney, William, Crook, Alexander L., Curtin, Ben, Das, Sayan, Demura, Sean, De Lorenzo, Laura, Di Paolo, Agustin, Donohoe, Paul, Drozdov, Ilya, Dunsworth, Andrew, Eickbusch, Alec, Elbag, Aviv Moshe, Elzouka, Mahmoud, Erickson, Catherine, Ferreira, Vinicius S., Burgos, Leslie Flores, Forati, Ebrahim, Fowler, Austin G., Foxen, Brooks, Ganjam, Suhas, Garcia, Gonzalo, Gasca, Robert, Genois, Élie, Giang, William, Gilboa, Dar, Gosula, Raja, Dau, Alejandro Grajales, Graumann, Dietrich, Greene, Alex, Gross, Jonathan A., Ha, Tan, Habegger, Steve, Hansen, Monica, Harrigan, Matthew P., Harrington, Sean D., Heslin, Stephen, Heu, Paula, Hiltermann, Reno, Hilton, Jeremy, Hong, Sabrina, Huang, Hsin-Yuan, Huff, Ashley, Huggins, William J., Jeffrey, Evan, Jiang, Zhang, Jin, Xiaoxuan, Joshi, Chaitali, Juhas, Pavol, Kabel, Andreas, Kang, Hui, Karamlou, Amir H., Kechedzhi, Kostyantyn, Khaire, Trupti, Khattar, Tanuj, Khezri, Mostafa, Kim, Seon, Klimov, Paul V., Kobrin, Bryce, Korotkov, Alexander N., Kostritsa, Fedor, Kreikebaum, John Mark, Kurilovich, Vladislav D., Landhuis, David, Lange-Dei, Tiano, Langley, Brandon W., Laptev, Pavel, Lau, Kim-Ming, Ledford, Justin, Lee, Kenny, Lester, Brian J., Guevel, Loïck Le, Li, Wing Yan, Li, Yin, Lill, Alexander T., Livingston, William P., Locharla, Aditya, Lucero, Erik, Lundahl, Daniel, Lunt, Aaron, Maloney, Ashley, Mandrà, Salvatore, Martin, Leigh S., Martin, Orion, Maxfield, Cameron, McClean, Jarrod R., Meeks, Seneca, Megrant, Anthony, Miao, Kevin C., Molavi, Reza, Molina, Sebastian, Montazeri, Shirin, Movassagh, Ramis, Neill, Charles, Newman, Michael, Nguyen, Anthony, Nguyen, Murray, Ni, Chia-Hung, Niu, Murphy Y., Oas, Logan, Oliver, William D., Orosco, Raymond, Ottosson, Kristoffer, Pizzuto, Alex, Potter, Rebecca, Pritchard, Orion, Quintana, Chris, Ramachandran, Ganesh, Reagor, Matthew J., Resnick, Rachel, Rhodes, David M., Roberts, Gabrielle, Rosenberg, Eliott, Rosenfeld, Emma, Rossi, Elizabeth, Roushan, Pedram, Sankaragomathi, Kannan, Schurkus, Henry F., Shearn, Michael J., Shorter, Aaron, Shvarts, Vladimir, Small, Spencer, Smith, W. Clarke, Springer, Sofia, Sterling, George, Suchard, Jordan, Szasz, Aaron, Sztein, Alex, Thor, Douglas, Tomita, Eifu, Torres, Alfredo, Torunbalci, M. Mert, Vaishnav, Abeer, Vargas, Justin, Vdovichev, Sergey, Vidal, Guifre, Heidweiller, Catherine Vollgraff, Waltman, Steven, Waltz, Jonathan, Wang, Shannon X., Ware, Brayden, Weidel, Travis, White, Theodore, Wong, Kristi, Woo, Bryan W. K., Woodson, Maddy, Xing, Cheng, Yao, Z. Jamie, Yeh, Ping, Ying, Bicheng, Yoo, Juhwan, Yosri, Noureldin, Young, Grayson, Zhang, Yaxing, Zhu, Ningfeng, Zobrist, Nicholas, Neven, Hartmut, Kohli, Pushmeet, Davies, Alex, Boixo, Sergio, Kelly, Julian, Jones, Cody, Gidney, Craig, and Satzinger, Kevin J.
Subjects: Quantum Physics
Abstract: Quantum error correction is essential for bridging the gap between the error rates of physical devices and the extremely low logical error rates required for quantum algorithms. Recent error-correction demonstrations on superconducting processors have focused primarily on the surface code, which offers a high error threshold but poses limitations for logical operations. In contrast, the color code enables much more efficient logic, although it requires more complex stabilizer measurements and decoding techniques. Measuring these stabilizers in planar architectures such as superconducting qubits is challenging, and so far, realizations of color codes have not addressed performance scaling with code size on any platform. Here, we present a comprehensive demonstration of the color code on a superconducting processor, achieving logical error suppression and performing logical operations. Scaling the code distance from three to five suppresses logical errors by a factor of $\Lambda_{3/5}$ = 1.56(4). Simulations indicate this performance is below the threshold of the color code, and furthermore that the color code may be more efficient than the surface code with modest device improvements. Using logical randomized benchmarking, we find that transversal Clifford gates add an error of only 0.0027(3), which is substantially less than the error of an idling error correction cycle. We inject magic states, a key resource for universal computation, achieving fidelities exceeding 99% with post-selection (retaining about 75% of the data). Finally, we successfully teleport logical states between distance-three color codes using lattice surgery, with teleported state fidelities between 86.5(1)% and 90.7(1)%. This work establishes the color code as a compelling research direction to realize fault-tolerant quantum computation on superconducting processors in the near future.
Published: 2024

3. Observation of disorder-free localization and efficient disorder averaging on a quantum processor

Author: Gyawali, Gaurav, Cochran, Tyler, Lensky, Yuri, Rosenberg, Eliott, Karamlou, Amir H., Kechedzhi, Kostyantyn, Berndtsson, Julia, Westerhout, Tom, Asfaw, Abraham, Abanin, Dmitry, Acharya, Rajeev, Beni, Laleh Aghababaie, Andersen, Trond I., Ansmann, Markus, Arute, Frank, Arya, Kunal, Astrakhantsev, Nikita, Atalaya, Juan, Babbush, Ryan, Ballard, Brian, Bardin, Joseph C., Bengtsson, Andreas, Bilmes, Alexander, Bortoli, Gina, Bourassa, Alexandre, Bovaird, Jenna, Brill, Leon, Broughton, Michael, Browne, David A., Buchea, Brett, Buckley, Bob B., Buell, David A., Burger, Tim, Burkett, Brian, Bushnell, Nicholas, Cabrera, Anthony, Campero, Juan, Chang, Hung-Shen, Chen, Zijun, Chiaro, Ben, Claes, Jahan, Cleland, Agnetta Y., Cogan, Josh, Collins, Roberto, Conner, Paul, Courtney, William, Crook, Alexander L., Das, Sayan, Debroy, Dripto M., De Lorenzo, Laura, Barba, Alexander Del Toro, Demura, Sean, Di Paolo, Agustin, Donohoe, Paul, Drozdov, Ilya, Dunsworth, Andrew, Earle, Clint, Eickbusch, Alec, Elbag, Aviv Moshe, Elzouka, Mahmoud, Erickson, Catherine, Faoro, Lara, Fatemi, Reza, Ferreira, Vinicius S., Burgos, Leslie Flores, Forati, Ebrahim, Fowler, Austin G., Foxen, Brooks, Ganjam, Suhas, Gasca, Robert, Giang, William, Gidney, Craig, Gilboa, Dar, Gosula, Raja, Dau, Alejandro Grajales, Graumann, Dietrich, Greene, Alex, Gross, Jonathan A., Habegger, Steve, Hamilton, Michael C., Hansen, Monica, Harrigan, Matthew P., Harrington, Sean D., Heslin, Stephen, Heu, Paula, Hill, Gordon, Hilton, Jeremy, Hoffmann, Markus R., Huang, Hsin-Yuan, Huff, Ashley, Huggins, William J., Ioffe, Lev B., Isakov, Sergei V., Jeffrey, Evan, Jiang, Zhang, Jones, Cody, Jordan, Stephen, Joshi, Chaitali, Juhas, Pavol, Kafri, Dvir, Kang, Hui, Khaire, Trupti, Khattar, Tanuj, Khezri, Mostafa, Kieferová, Mária, Kim, Seon, Klimov, Paul V., Klots, Andrey R., Kobrin, Bryce, Korotkov, Alexander N., Kostritsa, Fedor, Kreikebaum, John Mark, Kurilovich, Vladislav D., Landhuis, David, Lange-Dei, Tiano, Langley, Brandon W., Laptev, Pavel, Lau, Kim-Ming, Guevel, Loïck Le, Ledford, Justin, Lee, Joonho, Lee, Kenny, Lester, Brian J., Li, Wing Yan, Lill, Alexander T., Liu, Wayne, Livingston, William P., Locharla, Aditya, Lundahl, Daniel, Lunt, Aaron, Madhuk, Sid, Maloney, Ashley, Mandrà, Salvatore, Martin, Leigh S., Martin, Steven, Martin, Orion, Maxfield, Cameron, McClean, Jarrod R., McEwen, Matt, Meeks, Seneca, Megrant, Anthony, Mi, Xiao, Miao, Kevin C., Mieszala, Amanda, Molina, Sebastian, Montazeri, Shirin, Morvan, Alexis, Movassagh, Ramis, Neill, Charles, Nersisyan, Ani, Newman, Michael, Nguyen, Anthony, Nguyen, Murray, Ni, Chia-Hung, Niu, Murphy Yuezhen, Oliver, William D., Ottosson, Kristoffer, Pizzuto, Alex, Potter, Rebecca, Pritchard, Orion, Pryadko, Leonid P., Quintana, Chris, Reagor, Matthew J., Rhodes, David M., Roberts, Gabrielle, Rocque, Charles, Rubin, Nicholas C., Saei, Negar, Sankaragomathi, Kannan, Satzinger, Kevin J., Schurkus, Henry F., Schuster, Christopher, Shearn, Michael J., Shorter, Aaron, Shutty, Noah, Shvarts, Vladimir, Sivak, Volodymyr, Skruzny, Jindra, Small, Spencer, Smith, W. Clarke, Springer, Sofia, Sterling, George, Suchard, Jordan, Szalay, Marco, Szasz, Aaron, Sztein, Alex, Thor, Douglas, Torunbalci, M. Mert, Vaishnav, Abeer, Vdovichev, Sergey, Vidal, Guifré, Heidweiller, Catherine Vollgraff, Waltman, Steven, Wang, Shannon X., White, Theodore, Wong, Kristi, Woo, Bryan W. K., Xing, Cheng, Yao, Z. Jamie, Yeh, Ping, Ying, Bicheng, Yoo, Juhwan, Yosri, Noureldin, Young, Grayson, Zalcman, Adam, Zhang, Yaxing, Zhu, Ningfeng, Zobrist, Nicholas, Boixo, Sergio, Kelly, Julian, Lucero, Erik, Chen, Yu, Smelyanskiy, Vadim, Neven, Hartmut, Kovrizhin, Dmitry, Knolle, Johannes, Halimeh, Jad C., Aleiner, Igor, Moessner, Roderich, and Roushan, Pedram
Subjects: Quantum Physics, Condensed Matter - Disordered Systems and Neural Networks, Condensed Matter - Strongly Correlated Electrons, High Energy Physics - Lattice
Abstract: One of the most challenging problems in the computational study of localization in quantum manybody systems is to capture the effects of rare events, which requires sampling over exponentially many disorder realizations. We implement an efficient procedure on a quantum processor, leveraging quantum parallelism, to efficiently sample over all disorder realizations. We observe localization without disorder in quantum many-body dynamics in one and two dimensions: perturbations do not diffuse even though both the generator of evolution and the initial states are fully translationally invariant. The disorder strength as well as its density can be readily tuned using the initial state. Furthermore, we demonstrate the versatility of our platform by measuring Renyi entropies. Our method could also be extended to higher moments of the physical observables and disorder learning.
Published: 2024

4. Visualizing Dynamics of Charges and Strings in (2+1)D Lattice Gauge Theories

Author: Cochran, Tyler A., Jobst, Bernhard, Rosenberg, Eliott, Lensky, Yuri D., Gyawali, Gaurav, Eassa, Norhan, Will, Melissa, Abanin, Dmitry, Acharya, Rajeev, Beni, Laleh Aghababaie, Andersen, Trond I., Ansmann, Markus, Arute, Frank, Arya, Kunal, Asfaw, Abraham, Atalaya, Juan, Babbush, Ryan, Ballard, Brian, Bardin, Joseph C., Bengtsson, Andreas, Bilmes, Alexander, Bourassa, Alexandre, Bovaird, Jenna, Broughton, Michael, Browne, David A., Buchea, Brett, Buckley, Bob B., Burger, Tim, Burkett, Brian, Bushnell, Nicholas, Cabrera, Anthony, Campero, Juan, Chang, Hung-Shen, Chen, Zijun, Chiaro, Ben, Claes, Jahan, Cleland, Agnetta Y., Cogan, Josh, Collins, Roberto, Conner, Paul, Courtney, William, Crook, Alexander L., Curtin, Ben, Das, Sayan, Demura, Sean, De Lorenzo, Laura, Di Paolo, Agustin, Donohoe, Paul, Drozdov, Ilya, Dunsworth, Andrew, Eickbusch, Alec, Elbag, Aviv Moshe, Elzouka, Mahmoud, Erickson, Catherine, Ferreira, Vinicius S., Burgos, Leslie Flores, Forati, Ebrahim, Fowler, Austin G., Foxen, Brooks, Ganjam, Suhas, Gasca, Robert, Genois, Élie, Giang, William, Gilboa, Dar, Gosula, Raja, Dau, Alejandro Grajales, Graumann, Dietrich, Greene, Alex, Gross, Jonathan A., Habegger, Steve, Hansen, Monica, Harrigan, Matthew P., Harrington, Sean D., Heu, Paula, Higgott, Oscar, Hilton, Jeremy, Huang, Hsin-Yuan, Huff, Ashley, Huggins, William J., Jeffrey, Evan, Jiang, Zhang, Jones, Cody, Joshi, Chaitali, Juhas, Pavol, Kafri, Dvir, Kang, Hui, Karamlou, Amir H., Kechedzhi, Kostyantyn, Khaire, Trupti, Khattar, Tanuj, Khezri, Mostafa, Kim, Seon, Klimov, Paul V., Kobrin, Bryce, Korotkov, Alexander N., Kostritsa, Fedor, Kreikebaum, John Mark, Kurilovich, Vladislav D., Landhuis, David, Lange-Dei, Tiano, Langley, Brandon W., Lau, Kim-Ming, Ledford, Justin, Lee, Kenny, Lester, Brian J., Guevel, Loïck Le, Li, Wing Yan, Lill, Alexander T., Livingston, William P., Locharla, Aditya, Lundahl, Daniel, Lunt, Aaron, Madhuk, Sid, Maloney, Ashley, Mandrà, Salvatore, Martin, Leigh S., Martin, Orion, Maxfield, Cameron, McClean, Jarrod R., McEwen, Matt, Meeks, Seneca, Megrant, Anthony, Miao, Kevin C., Molavi, Reza, Molina, Sebastian, Montazeri, Shirin, Movassagh, Ramis, Neill, Charles, Newman, Michael, Nguyen, Anthony, Nguyen, Murray, Ni, Chia-Hung, Niu, Murphy Yuezhen, Oliver, William D., Ottosson, Kristoffer, Pizzuto, Alex, Potter, Rebecca, Pritchard, Orion, Quintana, Chris, Ramachandran, Ganesh, Reagor, Matthew J., Rhodes, David M., Roberts, Gabrielle, Sankaragomathi, Kannan, Satzinger, Kevin J., Schurkus, Henry F., Shearn, Michael J., Shorter, Aaron, Shutty, Noah, Shvarts, Vladimir, Sivak, Volodymyr, Small, Spencer, Smith, W. Clarke, Springer, Sofia, Sterling, George, Suchard, Jordan, Szasz, Aaron, Sztein, Alex, Thor, Douglas, Torunbalci, M. Mert, Vaishnav, Abeer, Vargas, Justin, Vdovichev, Sergey, Vidal, Guifre, Heidweiller, Catherine Vollgraff, Waltman, Steven, Wang, Shannon X., Ware, Brayden, White, Theodore, Wong, Kristi, Woo, Bryan W. K., Xing, Cheng, Yao, Z. Jamie, Yeh, Ping, Ying, Bicheng, Yoo, Juhwan, Yosri, Noureldin, Young, Grayson, Zalcman, Adam, Zhang, Yaxing, Zhu, Ningfeng, Zobris, Nicholas, Boixo, Sergio, Kelly, Julian, Lucero, Erik, Chen, Yu, Smelyanskiy, Vadim, Neven, Hartmut, Gammon-Smith, Adam, Pollmann, Frank, Knap, Michael, and Roushan, Pedram
Subjects: Quantum Physics, Condensed Matter - Strongly Correlated Electrons, High Energy Physics - Lattice
Abstract: Lattice gauge theories (LGTs) can be employed to understand a wide range of phenomena, from elementary particle scattering in high-energy physics to effective descriptions of many-body interactions in materials. Studying dynamical properties of emergent phases can be challenging as it requires solving many-body problems that are generally beyond perturbative limits. We investigate the dynamics of local excitations in a $\mathbb{Z}_2$ LGT using a two-dimensional lattice of superconducting qubits. We first construct a simple variational circuit which prepares low-energy states that have a large overlap with the ground state; then we create particles with local gates and simulate their quantum dynamics via a discretized time evolution. As the effective magnetic field is increased, our measurements show signatures of transitioning from deconfined to confined dynamics. For confined excitations, the magnetic field induces a tension in the string connecting them. Our method allows us to experimentally image string dynamics in a (2+1)D LGT from which we uncover two distinct regimes inside the confining phase: for weak confinement the string fluctuates strongly in the transverse direction, while for strong confinement transverse fluctuations are effectively frozen. In addition, we demonstrate a resonance condition at which dynamical string breaking is facilitated. Our LGT implementation on a quantum processor presents a novel set of techniques for investigating emergent particle and string dynamics.
Published: 2024

5. Quantum error correction below the surface code threshold

Author: Acharya, Rajeev, Aghababaie-Beni, Laleh, Aleiner, Igor, Andersen, Trond I., Ansmann, Markus, Arute, Frank, Arya, Kunal, Asfaw, Abraham, Astrakhantsev, Nikita, Atalaya, Juan, Babbush, Ryan, Bacon, Dave, Ballard, Brian, Bardin, Joseph C., Bausch, Johannes, Bengtsson, Andreas, Bilmes, Alexander, Blackwell, Sam, Boixo, Sergio, Bortoli, Gina, Bourassa, Alexandre, Bovaird, Jenna, Brill, Leon, Broughton, Michael, Browne, David A., Buchea, Brett, Buckley, Bob B., Buell, David A., Burger, Tim, Burkett, Brian, Bushnell, Nicholas, Cabrera, Anthony, Campero, Juan, Chang, Hung-Shen, Chen, Yu, Chen, Zijun, Chiaro, Ben, Chik, Desmond, Chou, Charina, Claes, Jahan, Cleland, Agnetta Y., Cogan, Josh, Collins, Roberto, Conner, Paul, Courtney, William, Crook, Alexander L., Curtin, Ben, Das, Sayan, Davies, Alex, De Lorenzo, Laura, Debroy, Dripto M., Demura, Sean, Devoret, Michel, Di Paolo, Agustin, Donohoe, Paul, Drozdov, Ilya, Dunsworth, Andrew, Earle, Clint, Edlich, Thomas, Eickbusch, Alec, Elbag, Aviv Moshe, Elzouka, Mahmoud, Erickson, Catherine, Faoro, Lara, Farhi, Edward, Ferreira, Vinicius S., Burgos, Leslie Flores, Forati, Ebrahim, Fowler, Austin G., Foxen, Brooks, Ganjam, Suhas, Garcia, Gonzalo, Gasca, Robert, Genois, Élie, Giang, William, Gidney, Craig, Gilboa, Dar, Gosula, Raja, Dau, Alejandro Grajales, Graumann, Dietrich, Greene, Alex, Gross, Jonathan A., Habegger, Steve, Hall, John, Hamilton, Michael C., Hansen, Monica, Harrigan, Matthew P., Harrington, Sean D., Heras, Francisco J. H., Heslin, Stephen, Heu, Paula, Higgott, Oscar, Hill, Gordon, Hilton, Jeremy, Holland, George, Hong, Sabrina, Huang, Hsin-Yuan, Huff, Ashley, Huggins, William J., Ioffe, Lev B., Isakov, Sergei V., Iveland, Justin, Jeffrey, Evan, Jiang, Zhang, Jones, Cody, Jordan, Stephen, Joshi, Chaitali, Juhas, Pavol, Kafri, Dvir, Kang, Hui, Karamlou, Amir H., Kechedzhi, Kostyantyn, Kelly, Julian, Khaire, Trupti, Khattar, Tanuj, Khezri, Mostafa, Kim, Seon, Klimov, Paul V., Klots, Andrey R., Kobrin, Bryce, Kohli, Pushmeet, Korotkov, Alexander N., Kostritsa, Fedor, Kothari, Robin, Kozlovskii, Borislav, Kreikebaum, John Mark, Kurilovich, Vladislav D., Lacroix, Nathan, Landhuis, David, Lange-Dei, Tiano, Langley, Brandon W., Laptev, Pavel, Lau, Kim-Ming, Guevel, Loïck Le, Ledford, Justin, Lee, Kenny, Lensky, Yuri D., Leon, Shannon, Lester, Brian J., Li, Wing Yan, Li, Yin, Lill, Alexander T., Liu, Wayne, Livingston, William P., Locharla, Aditya, Lucero, Erik, Lundahl, Daniel, Lunt, Aaron, Madhuk, Sid, Malone, Fionn D., Maloney, Ashley, Mandrá, Salvatore, Martin, Leigh S., Martin, Steven, Martin, Orion, Maxfield, Cameron, McClean, Jarrod R., McEwen, Matt, Meeks, Seneca, Megrant, Anthony, Mi, Xiao, Miao, Kevin C., Mieszala, Amanda, Molavi, Reza, Molina, Sebastian, Montazeri, Shirin, Morvan, Alexis, Movassagh, Ramis, Mruczkiewicz, Wojciech, Naaman, Ofer, Neeley, Matthew, Neill, Charles, Nersisyan, Ani, Neven, Hartmut, Newman, Michael, Ng, Jiun How, Nguyen, Anthony, Nguyen, Murray, Ni, Chia-Hung, O'Brien, Thomas E., Oliver, William D., Opremcak, Alex, Ottosson, Kristoffer, Petukhov, Andre, Pizzuto, Alex, Platt, John, Potter, Rebecca, Pritchard, Orion, Pryadko, Leonid P., Quintana, Chris, Ramachandran, Ganesh, Reagor, Matthew J., Rhodes, David M., Roberts, Gabrielle, Rosenberg, Eliott, Rosenfeld, Emma, Roushan, Pedram, Rubin, Nicholas C., Saei, Negar, Sank, Daniel, Sankaragomathi, Kannan, Satzinger, Kevin J., Schurkus, Henry F., Schuster, Christopher, Senior, Andrew W., Shearn, Michael J., Shorter, Aaron, Shutty, Noah, Shvarts, Vladimir, Singh, Shraddha, Sivak, Volodymyr, Skruzny, Jindra, Small, Spencer, Smelyanskiy, Vadim, Smith, W. Clarke, Somma, Rolando D., Springer, Sofia, Sterling, George, Strain, Doug, Suchard, Jordan, Szasz, Aaron, Sztein, Alex, Thor, Douglas, Torres, Alfredo, Torunbalci, M. Mert, Vaishnav, Abeer, Vargas, Justin, Vdovichev, Sergey, Vidal, Guifre, Villalonga, Benjamin, Heidweiller, Catherine Vollgraff, Waltman, Steven, Wang, Shannon X., Ware, Brayden, Weber, Kate, White, Theodore, Wong, Kristi, Woo, Bryan W. K., Xing, Cheng, Yao, Z. Jamie, Yeh, Ping, Ying, Bicheng, Yoo, Juhwan, Yosri, Noureldin, Young, Grayson, Zalcman, Adam, Zhang, Yaxing, Zhu, Ningfeng, and Zobrist, Nicholas
Subjects: Quantum Physics
Abstract: Quantum error correction provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, where the logical error rate is suppressed exponentially as more qubits are added. However, this exponential suppression only occurs if the physical error rate is below a critical threshold. In this work, we present two surface code memories operating below this threshold: a distance-7 code and a distance-5 code integrated with a real-time decoder. The logical error rate of our larger quantum memory is suppressed by a factor of $\Lambda$ = 2.14 $\pm$ 0.02 when increasing the code distance by two, culminating in a 101-qubit distance-7 code with 0.143% $\pm$ 0.003% error per cycle of error correction. This logical memory is also beyond break-even, exceeding its best physical qubit's lifetime by a factor of 2.4 $\pm$ 0.3. We maintain below-threshold performance when decoding in real time, achieving an average decoder latency of 63 $\mu$s at distance-5 up to a million cycles, with a cycle time of 1.1 $\mu$s. To probe the limits of our error-correction performance, we run repetition codes up to distance-29 and find that logical performance is limited by rare correlated error events occurring approximately once every hour, or 3 $\times$ 10$^9$ cycles. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms., Comment: 10 pages, 4 figures, Supplementary Information
Published: 2024

6. An iterative transversal CNOT decoder

Author: Wan, Kwok Ho, Webber, Mark, Fowler, Austin G., and Hensinger, Winfried K.
Subjects: Quantum Physics
Abstract: Modern platforms for potential qubit candidates, such as trapped ions or neutral atoms, allow long range connectivity between distant physical qubits through shuttling. This opens up an avenue for transversal logical CNOT gates between distant logical qubits, whereby physical CNOT gates are performed between each corresponding physical qubit on the control and target logical qubits. However, the transversal CNOT can propagate errors from one logical qubit to another, leading to correlated errors between logical qubits. We have developed a multi-pass iterative decoder that decodes each logical qubit separately to deal with this correlated error. We show that under circuit-level noise and only $\mathcal{O}(1)$ code cycles, a threshold can still persist, and the logical error rate will not be significantly degraded, matching the sub-threshold logical error rate scaling of $p^{\lfloor\frac{d}{2}\rfloor}$ for a distance $d$ rotated surface code.
Published: 2024

7. Thermalization and Criticality on an Analog-Digital Quantum Simulator

Author: Andersen, Trond I., Astrakhantsev, Nikita, Karamlou, Amir H., Berndtsson, Julia, Motruk, Johannes, Szasz, Aaron, Gross, Jonathan A., Schuckert, Alexander, Westerhout, Tom, Zhang, Yaxing, Forati, Ebrahim, Rossi, Dario, Kobrin, Bryce, Di Paolo, Agustin, Klots, Andrey R., Drozdov, Ilya, Kurilovich, Vladislav D., Petukhov, Andre, Ioffe, Lev B., Elben, Andreas, Rath, Aniket, Vitale, Vittorio, Vermersch, Benoit, Acharya, Rajeev, Beni, Laleh Aghababaie, Anderson, Kyle, Ansmann, Markus, Arute, Frank, Arya, Kunal, Asfaw, Abraham, Atalaya, Juan, Ballard, Brian, Bardin, Joseph C., Bengtsson, Andreas, Bilmes, Alexander, Bortoli, Gina, Bourassa, Alexandre, Bovaird, Jenna, Brill, Leon, Broughton, Michael, Browne, David A., Buchea, Brett, Buckley, Bob B., Buell, David A., Burger, Tim, Burkett, Brian, Bushnell, Nicholas, Cabrera, Anthony, Campero, Juan, Chang, Hung-Shen, Chen, Zijun, Chiaro, Ben, Claes, Jahan, Cleland, Agnetta Y., Cogan, Josh, Collins, Roberto, Conner, Paul, Courtney, William, Crook, Alexander L., Das, Sayan, Debroy, Dripto M., De Lorenzo, Laura, Barba, Alexander Del Toro, Demura, Sean, Donohoe, Paul, Dunsworth, Andrew, Earle, Clint, Eickbusch, Alec, Elbag, Aviv Moshe, Elzouka, Mahmoud, Erickson, Catherine, Faoro, Lara, Fatemi, Reza, Ferreira, Vinicius S., Burgos, Leslie Flores, Fowler, Austin G., Foxen, Brooks, Ganjam, Suhas, Gasca, Robert, Giang, William, Gidney, Craig, Gilboa, Dar, Giustina, Marissa, Gosula, Raja, Dau, Alejandro Grajales, Graumann, Dietrich, Greene, Alex, Habegger, Steve, Hamilton, Michael C., Hansen, Monica, Harrigan, Matthew P., Harrington, Sean D., Heslin, Stephen, Heu, Paula, Hill, Gordon, Hoffmann, Markus R., Huang, Hsin-Yuan, Huang, Trent, Huff, Ashley, Huggins, William J., Isakov, Sergei V., Jeffrey, Evan, Jiang, Zhang, Jones, Cody, Jordan, Stephen, Joshi, Chaitali, Juhas, Pavol, Kafri, Dvir, Kang, Hui, Kechedzhi, Kostyantyn, Khaire, Trupti, Khattar, Tanuj, Khezri, Mostafa, Kieferová, Mária, Kim, Seon, Kitaev, Alexei, Klimov, Paul V., Korotkov, Alexander N., Kostritsa, Fedor, Kreikebaum, John Mark, Landhuis, David, Langley, Brandon W., Laptev, Pavel, Lau, Kim-Ming, Guevel, Loïck Le, Ledford, Justin, Lee, Joonho, Lee, Kenny, Lensky, Yuri D., Lester, Brian J., Li, Wing Yan, Lill, Alexander T., Liu, Wayne, Livingston, William P., Locharla, Aditya, Lundahl, Daniel, Lunt, Aaron, Madhuk, Sid, Maloney, Ashley, Mandrà, Salvatore, Martin, Leigh S., Martin, Orion, Martin, Steven, Maxfield, Cameron, McClean, Jarrod R., McEwen, Matt, Meeks, Seneca, Miao, Kevin C., Mieszala, Amanda, Molina, Sebastian, Montazeri, Shirin, Morvan, Alexis, Movassagh, Ramis, Neill, Charles, Nersisyan, Ani, Newman, Michael, Nguyen, Anthony, Nguyen, Murray, Ni, Chia-Hung, Niu, Murphy Yuezhen, Oliver, William D., Ottosson, Kristoffer, Pizzuto, Alex, Potter, Rebecca, Pritchard, Orion, Pryadko, Leonid P., Quintana, Chris, Reagor, Matthew J., Rhodes, David M., Roberts, Gabrielle, Rocque, Charles, Rosenberg, Eliott, Rubin, Nicholas C., Saei, Negar, Sankaragomathi, Kannan, Satzinger, Kevin J., Schurkus, Henry F., Schuster, Christopher, Shearn, Michael J., Shorter, Aaron, Shutty, Noah, Shvarts, Vladimir, Sivak, Volodymyr, Skruzny, Jindra, Small, Spencer, Smith, W. Clarke, Springer, Sofia, Sterling, George, Suchard, Jordan, Szalay, Marco, Sztein, Alex, Thor, Douglas, Torres, Alfredo, Torunbalci, M. Mert, Vaishnav, Abeer, Vdovichev, Sergey, Villalonga, Benjamin, Heidweiller, Catherine Vollgraff, Waltman, Steven, Wang, Shannon X., White, Theodore, Wong, Kristi, Woo, Bryan W., Xing, Cheng, Yao, Z. Jamie, Yeh, Ping, Ying, Bicheng, Yoo, Juhwan, Yosri, Noureldin, Young, Grayson, Zalcman, Adam, Zhu, Ningfeng, Zobrist, Nicholas, Neven, Hartmut, Babbush, Ryan, Boixo, Sergio, Hilton, Jeremy, Lucero, Erik, Megrant, Anthony, Kelly, Julian, Chen, Yu, Smelyanskiy, Vadim, Vidal, Guifre, Roushan, Pedram, Lauchli, Andreas M., Abanin, Dmitry A., and Mi, Xiao
Subjects: Quantum Physics, Condensed Matter - Mesoscale and Nanoscale Physics, Condensed Matter - Strongly Correlated Electrons
Abstract: Understanding how interacting particles approach thermal equilibrium is a major challenge of quantum simulators. Unlocking the full potential of such systems toward this goal requires flexible initial state preparation, precise time evolution, and extensive probes for final state characterization. We present a quantum simulator comprising 69 superconducting qubits which supports both universal quantum gates and high-fidelity analog evolution, with performance beyond the reach of classical simulation in cross-entropy benchmarking experiments. Emulating a two-dimensional (2D) XY quantum magnet, we leverage a wide range of measurement techniques to study quantum states after ramps from an antiferromagnetic initial state. We observe signatures of the classical Kosterlitz-Thouless phase transition, as well as strong deviations from Kibble-Zurek scaling predictions attributed to the interplay between quantum and classical coarsening of the correlated domains. This interpretation is corroborated by injecting variable energy density into the initial state, which enables studying the effects of the eigenstate thermalization hypothesis (ETH) in targeted parts of the eigenspectrum. Finally, we digitally prepare the system in pairwise-entangled dimer states and image the transport of energy and vorticity during thermalization. These results establish the efficacy of superconducting analog-digital quantum processors for preparing states across many-body spectra and unveiling their thermalization dynamics.
Published: 2024

8. Dynamics of magnetization at infinite temperature in a Heisenberg spin chain

Author: Rosenberg, Eliott, Andersen, Trond, Samajdar, Rhine, Petukhov, Andre, Hoke, Jesse, Abanin, Dmitry, Bengtsson, Andreas, Drozdov, Ilya, Erickson, Catherine, Klimov, Paul, Mi, Xiao, Morvan, Alexis, Neeley, Matthew, Neill, Charles, Acharya, Rajeev, Allen, Richard, Anderson, Kyle, Ansmann, Markus, Arute, Frank, Arya, Kunal, Asfaw, Abraham, Atalaya, Juan, Bardin, Joseph, Bilmes, A., Bortoli, Gina, Bourassa, Alexandre, Bovaird, Jenna, Brill, Leon, Broughton, Michael, Buckley, Bob B., Buell, David, Burger, Tim, Burkett, Brian, Bushnell, Nicholas, Campero, Juan, Chang, Hung-Shen, Chen, Zijun, Chiaro, Benjamin, Chik, Desmond, Cogan, Josh, Collins, Roberto, Conner, Paul, Courtney, William, Crook, Alexander, Curtin, Ben, Debroy, Dripto, Barba, Alexander Del Toro, Demura, Sean, Di Paolo, Agustin, Dunsworth, Andrew, Earle, Clint, Farhi, E., Fatemi, Reza, Ferreira, Vinicius, Flores, Leslie, Forati, Ebrahim, Fowler, Austin, Foxen, Brooks, Garcia, Gonzalo, Genois, Élie, Giang, William, Gidney, Craig, Gilboa, Dar, Giustina, Marissa, Gosula, Raja, Dau, Alejandro Grajales, Gross, Jonathan, Habegger, Steve, Hamilton, Michael, Hansen, Monica, Harrigan, Matthew, Harrington, Sean, Heu, Paula, Hill, Gordon, Hoffmann, Markus, Hong, Sabrina, Huang, Trent, Huff, Ashley, Huggins, William, Ioffe, Lev, Isakov, Sergei, Iveland, Justin, Jeffrey, Evan, Jiang, Zhang, Jones, Cody, Juhas, Pavol, Kafri, D., Khattar, Tanuj, Khezri, Mostafa, Kieferová, Mária, Kim, Seon, Kitaev, Alexei, Klots, Andrey, Korotkov, Alexander, Kostritsa, Fedor, Kreikebaum, John Mark, Landhuis, David, Laptev, Pavel, Lau, Kim Ming, Laws, Lily, Lee, Joonho, Lee, Kenneth, Lensky, Yuri, Lester, Brian, Lill, Alexander, Liu, Wayne, Livingston, William P., Locharla, A., Mandrà, Salvatore, Martin, Orion, Martin, Steven, McClean, Jarrod, McEwen, Matthew, Meeks, Seneca, Miao, Kevin, Mieszala, Amanda, Montazeri, Shirin, Movassagh, Ramis, Mruczkiewicz, Wojciech, Nersisyan, Ani, Newman, Michael, Ng, Jiun How, Nguyen, Anthony, Nguyen, Murray, Niu, M., O'Brien, Thomas, Omonije, Seun, Opremcak, Alex, Potter, Rebecca, Pryadko, Leonid, Quintana, Chris, Rhodes, David, Rocque, Charles, Rubin, N., Saei, Negar, Sank, Daniel, Sankaragomathi, Kannan, Satzinger, Kevin, Schurkus, Henry, Schuster, Christopher, Shearn, Michael, Shorter, Aaron, Shutty, Noah, Shvarts, Vladimir, Sivak, Volodymyr, Skruzny, Jindra, Smith, Clarke, Somma, Rolando, Sterling, George, Strain, Doug, Szalay, Marco, Thor, Douglas, Torres, Alfredo, Vidal, Guifre, Villalonga, Benjamin, Heidweiller, Catherine Vollgraff, White, Theodore, Woo, Bryan, Xing, Cheng, Yao, Jamie, Yeh, Ping, Yoo, Juhwan, Young, Grayson, Zalcman, Adam, Zhang, Yaxing, Zhu, Ningfeng, Zobrist, Nicholas, Neven, Hartmut, Babbush, Ryan, Bacon, Dave, Boixo, Sergio, Hilton, Jeremy, Lucero, Erik, Megrant, Anthony, Kelly, Julian, Chen, Yu, Smelyanskiy, Vadim, Khemani, Vedika, Gopalakrishnan, Sarang, Prosen, Tomaž, and Roushan, Pedram
Subjects: Quantum Physics
Abstract: Understanding universal aspects of quantum dynamics is an unresolved problem in statistical mechanics. In particular, the spin dynamics of the 1D Heisenberg model were conjectured to belong to the Kardar-Parisi-Zhang (KPZ) universality class based on the scaling of the infinite-temperature spin-spin correlation function. In a chain of 46 superconducting qubits, we study the probability distribution, $P(\mathcal{M})$, of the magnetization transferred across the chain's center. The first two moments of $P(\mathcal{M})$ show superdiffusive behavior, a hallmark of KPZ universality. However, the third and fourth moments rule out the KPZ conjecture and allow for evaluating other theories. Our results highlight the importance of studying higher moments in determining dynamic universality classes and provide key insights into universal behavior in quantum systems.
Published: 2023
Full Text: View/download PDF

9. Measurement-induced entanglement and teleportation on a noisy quantum processor

Author: Hoke, Jesse C., Ippoliti, Matteo, Rosenberg, Eliott, Abanin, Dmitry, Acharya, Rajeev, Andersen, Trond I., Ansmann, Markus, Arute, Frank, Arya, Kunal, Asfaw, Abraham, Atalaya, Juan, Bardin, Joseph C., Bengtsson, Andreas, Bortoli, Gina, Bourassa, Alexandre, Bovaird, Jenna, Brill, Leon, Broughton, Michael, Buckley, Bob B., Buell, David A., Burger, Tim, Burkett, Brian, Bushnell, Nicholas, Chen, Zijun, Chiaro, Ben, Chik, Desmond, Cogan, Josh, Collins, Roberto, Conner, Paul, Courtney, William, Crook, Alexander L., Curtin, Ben, Dau, Alejandro Grajales, Debroy, Dripto M., Barba, Alexander Del Toro, Demura, Sean, Di Paolo, Augustin, Drozdov, Ilya K., Dunsworth, Andrew, Eppens, Daniel, Erickson, Catherine, Farhi, Edward, Fatemi, Reza, Ferreira, Vinicius S., Burgos, Leslie Flores, Forati, Ebrahim, Fowler, Austin G., Foxen, Brooks, Giang, William, Gidney, Craig, Gilboa, Dar, Giustina, Marissa, Gosula, Raja, Gross, Jonathan A., Habegger, Steve, Hamilton, Michael C., Hansen, Monica, Harrigan, Matthew P., Harrington, Sean D., Heu, Paula, Hoffmann, Markus R., Hong, Sabrina, Huang, Trent, Huff, Ashley, Huggins, William J., Isakov, Sergei V., Iveland, Justin, Jeffrey, Evan, Jones, Cody, Juhas, Pavol, Kafri, Dvir, Kechedzhi, Kostyantyn, Khattar, Tanuj, Khezri, Mostafa, Kieferová, Mária, Kim, Seon, Kitaev, Alexei, Klimov, Paul V., Klots, Andrey R., Korotkov, Alexander N., Kostritsa, Fedor, Kreikebaum, John Mark, Landhuis, David, Laptev, Pavel, Lau, Kim-Ming, Laws, Lily, Lee, Joonho, Lee, Kenny W., Lensky, Yuri D., Lester, Brian J., Lill, Alexander T., Liu, Wayne, Locharla, Aditya, Martin, Orion, McClean, Jarrod R., McEwen, Matt, Miao, Kevin C., Mieszala, Amanda, Montazeri, Shirin, Morvan, Alexis, Movassagh, Ramis, Mruczkiewicz, Wojciech, Neeley, Matthew, Neill, Charles, Nersisyan, Ani, Newman, Michael, Ng, Jiun H., Nguyen, Anthony, Nguyen, Murray, Niu, Murphy Yuezhen, O'Brien, Tom E., Omonije, Seun, Opremcak, Alex, Petukhov, Andre, Potter, Rebecca, Pryadko, Leonid P., Quintana, Chris, Rocque, Charles, Rubin, Nicholas C., Saei, Negar, Sank, Daniel, Sankaragomathi, Kannan, Satzinger, Kevin J., Schurkus, Henry F., Schuster, Christopher, Shearn, Michael J., Shorter, Aaron, Shutty, Noah, Shvarts, Vlad, Skruzny, Jindra, Smith, W. Clarke, Somma, Rolando D., Sterling, George, Strain, Douglas, Szalay, Marco, Torres, Alfredo, Vidal, Guifre, Villalonga, Benjamin, Heidweiller, Catherine Vollgraff, White, Ted, Woo, Bryan W. K., Xing, Cheng, Yao, Z. Jamie., Yeh, Ping, Yoo, Juhwan, Young, Grayson, Zalcman, Adam, Zhang, Yaxing, Zhu, Ningfeng, Zobrist, Nicholas, Neven, Harmut, Babbush, Ryan, Bacon, Dave, Boixo, Sergio, Hilton, Jeremy, Lucero, Erik, Megrant, Anthony, Kelly, Julian, Chen, Yu, Smelyanskiy, Vadim, Mi, Xiao, Khemani, Vedika, and Roushan, Pedram
Subjects: Quantum Physics, Condensed Matter - Statistical Mechanics, High Energy Physics - Theory
Abstract: Measurement has a special role in quantum theory: by collapsing the wavefunction it can enable phenomena such as teleportation and thereby alter the "arrow of time" that constrains unitary evolution. When integrated in many-body dynamics, measurements can lead to emergent patterns of quantum information in space-time that go beyond established paradigms for characterizing phases, either in or out of equilibrium. On present-day NISQ processors, the experimental realization of this physics is challenging due to noise, hardware limitations, and the stochastic nature of quantum measurement. Here we address each of these experimental challenges and investigate measurement-induced quantum information phases on up to 70 superconducting qubits. By leveraging the interchangeability of space and time, we use a duality mapping, to avoid mid-circuit measurement and access different manifestations of the underlying phases -- from entanglement scaling to measurement-induced teleportation -- in a unified way. We obtain finite-size signatures of a phase transition with a decoding protocol that correlates the experimental measurement record with classical simulation data. The phases display sharply different sensitivity to noise, which we exploit to turn an inherent hardware limitation into a useful diagnostic. Our work demonstrates an approach to realize measurement-induced physics at scales that are at the limits of current NISQ processors.
Published: 2023
Full Text: View/download PDF

10. Overcoming leakage in scalable quantum error correction

Author: Miao, Kevin C., McEwen, Matt, Atalaya, Juan, Kafri, Dvir, Pryadko, Leonid P., Bengtsson, Andreas, Opremcak, Alex, Satzinger, Kevin J., Chen, Zijun, Klimov, Paul V., Quintana, Chris, Acharya, Rajeev, Anderson, Kyle, Ansmann, Markus, Arute, Frank, Arya, Kunal, Asfaw, Abraham, Bardin, Joseph C., Bourassa, Alexandre, Bovaird, Jenna, Brill, Leon, Buckley, Bob B., Buell, David A., Burger, Tim, Burkett, Brian, Bushnell, Nicholas, Campero, Juan, Chiaro, Ben, Collins, Roberto, Conner, Paul, Crook, Alexander L., Curtin, Ben, Debroy, Dripto M., Demura, Sean, Dunsworth, Andrew, Erickson, Catherine, Fatemi, Reza, Ferreira, Vinicius S., Burgos, Leslie Flores, Forati, Ebrahim, Fowler, Austin G., Foxen, Brooks, Garcia, Gonzalo, Giang, William, Gidney, Craig, Giustina, Marissa, Gosula, Raja, Dau, Alejandro Grajales, Gross, Jonathan A., Hamilton, Michael C., Harrington, Sean D., Heu, Paula, Hilton, Jeremy, Hoffmann, Markus R., Hong, Sabrina, Huang, Trent, Huff, Ashley, Iveland, Justin, Jeffrey, Evan, Jiang, Zhang, Jones, Cody, Kelly, Julian, Kim, Seon, Kostritsa, Fedor, Kreikebaum, John Mark, Landhuis, David, Laptev, Pavel, Laws, Lily, Lee, Kenny, Lester, Brian J., Lill, Alexander T., Liu, Wayne, Locharla, Aditya, Lucero, Erik, Martin, Steven, Megrant, Anthony, Mi, Xiao, Montazeri, Shirin, Morvan, Alexis, Naaman, Ofer, Neeley, Matthew, Neill, Charles, Nersisyan, Ani, Newman, Michael, Ng, Jiun How, Nguyen, Anthony, Nguyen, Murray, Potter, Rebecca, Rocque, Charles, Roushan, Pedram, Sankaragomathi, Kannan, Schuster, Christopher, Shearn, Michael J., Shorter, Aaron, Shutty, Noah, Shvarts, Vladimir, Skruzny, Jindra, Smith, W. Clarke, Sterling, George, Szalay, Marco, Thor, Douglas, Torres, Alfredo, White, Theodore, Woo, Bryan W. K., Yao, Z. Jamie, Yeh, Ping, Yoo, Juhwan, Young, Grayson, Zalcman, Adam, Zhu, Ningfeng, Zobrist, Nicholas, Neven, Hartmut, Smelyanskiy, Vadim, Petukhov, Andre, Korotkov, Alexander N., Sank, Daniel, and Chen, Yu
Subjects: Quantum Physics
Abstract: Leakage of quantum information out of computational states into higher energy states represents a major challenge in the pursuit of quantum error correction (QEC). In a QEC circuit, leakage builds over time and spreads through multi-qubit interactions. This leads to correlated errors that degrade the exponential suppression of logical error with scale, challenging the feasibility of QEC as a path towards fault-tolerant quantum computation. Here, we demonstrate the execution of a distance-3 surface code and distance-21 bit-flip code on a Sycamore quantum processor where leakage is removed from all qubits in each cycle. This shortens the lifetime of leakage and curtails its ability to spread and induce correlated errors. We report a ten-fold reduction in steady-state leakage population on the data qubits encoding the logical state and an average leakage population of less than $1 \times 10^{-3}$ throughout the entire device. The leakage removal process itself efficiently returns leakage population back to the computational basis, and adding it to a code circuit prevents leakage from inducing correlated error across cycles, restoring a fundamental assumption of QEC. With this demonstration that leakage can be contained, we resolve a key challenge for practical QEC at scale., Comment: Main text: 7 pages, 5 figures
Published: 2022
Full Text: View/download PDF

11. Non-Abelian braiding of graph vertices in a superconducting processor

Author: Andersen, Trond I., Lensky, Yuri D., Kechedzhi, Kostyantyn, Drozdov, Ilya, Bengtsson, Andreas, Hong, Sabrina, Morvan, Alexis, Mi, Xiao, Opremcak, Alex, Acharya, Rajeev, Allen, Richard, Ansmann, Markus, Arute, Frank, Arya, Kunal, Asfaw, Abraham, Atalaya, Juan, Babbush, Ryan, Bacon, Dave, Bardin, Joseph C., Bortoli, Gina, Bourassa, Alexandre, Bovaird, Jenna, Brill, Leon, Broughton, Michael, Buckley, Bob B., Buell, David A., Burger, Tim, Burkett, Brian, Bushnell, Nicholas, Chen, Zijun, Chiaro, Ben, Chik, Desmond, Chou, Charina, Cogan, Josh, Collins, Roberto, Conner, Paul, Courtney, William, Crook, Alexander L., Curtin, Ben, Debroy, Dripto M., Barba, Alexander Del Toro, Demura, Sean, Dunsworth, Andrew, Eppens, Daniel, Erickson, Catherine, Faoro, Lara, Farhi, Edward, Fatemi, Reza, Ferreira, Vinicius S., Burgos, Leslie Flores, Forati, Ebrahim, Fowler, Austin G., Foxen, Brooks, Giang, William, Gidney, Craig, Gilboa, Dar, Giustina, Marissa, Gosula, Raja, Dau, Alejandro Grajales, Gross, Jonathan A., Habegger, Steve, Hamilton, Michael C., Hansen, Monica, Harrigan, Matthew P., Harrington, Sean D., Heu, Paula, Hilton, Jeremy, Hoffmann, Markus R., Huang, Trent, Huff, Ashley, Huggins, William J., Ioffe, Lev B., Isakov, Sergei V., Iveland, Justin, Jeffrey, Evan, Jiang, Zhang, Jones, Cody, Juhas, Pavol, Kafri, Dvir, Khattar, Tanuj, Khezri, Mostafa, Kieferová, Mária, Kim, Seon, Kitaev, Alexei, Klimov, Paul V., Klots, Andrey R., Korotkov, Alexander N., Kostritsa, Fedor, Kreikebaum, John Mark, Landhuis, David, Laptev, Pavel, Lau, Kim-Ming, Laws, Lily, Lee, Joonho, Lee, Kenny, Lester, Brian J., Lill, Alexander, Liu, Wayne, Locharla, Aditya, Lucero, Erik, Malone, Fionn D., Martin, Orion, McClean, Jarrod R., McCourt, Trevor, McEwen, Matt, Miao, Kevin C., Mieszala, Amanda, Mohseni, Masoud, Montazeri, Shirin, Mount, Emily, Movassagh, Ramis, Mruczkiewicz, Wojciech, Naaman, Ofer, Neeley, Matthew, Neill, Charles, Nersisyan, Ani, Newman, Michael, Ng, Jiun How, Nguyen, Anthony, Nguyen, Murray, Niu, Murphy Yuezhen, O'Brien, Thomas E., Omonije, Seun, Petukhov, Andre, Potter, Rebecca, Pryadko, Leonid P., Quintana, Chris, Rocque, Charles, Rubin, Nicholas C., Saei, Negar, Sank, Daniel, Sankaragomathi, Kannan, Satzinger, Kevin J., Schurkus, Henry F., Schuster, Christopher, Shearn, Michael J., Shorter, Aaron, Shutty, Noah, Shvarts, Vladimir, Skruzny, Jindra, Smith, W. Clarke, Somma, Rolando, Sterling, George, Strain, Doug, Szalay, Marco, Torres, Alfredo, Vidal, Guifre, Villalonga, Benjamin, Heidweiller, Catherine Vollgraff, White, Theodore, Woo, Bryan W. K., Xing, Cheng, Yao, Z. Jamie, Yeh, Ping, Yoo, Juhwan, Young, Grayson, Zalcman, Adam, Zhang, Yaxing, Zhu, Ningfeng, Zobrist, Nicholas, Neven, Hartmut, Boixo, Sergio, Megrant, Anthony, Kelly, Julian, Chen, Yu, Smelyanskiy, Vadim, Kim, Eun-Ah, Aleiner, Igor, and Roushan, Pedram
Subjects: Quantum Physics, Condensed Matter - Mesoscale and Nanoscale Physics, Condensed Matter - Other Condensed Matter
Abstract: Indistinguishability of particles is a fundamental principle of quantum mechanics. For all elementary and quasiparticles observed to date - including fermions, bosons, and Abelian anyons - this principle guarantees that the braiding of identical particles leaves the system unchanged. However, in two spatial dimensions, an intriguing possibility exists: braiding of non-Abelian anyons causes rotations in a space of topologically degenerate wavefunctions. Hence, it can change the observables of the system without violating the principle of indistinguishability. Despite the well developed mathematical description of non-Abelian anyons and numerous theoretical proposals, the experimental observation of their exchange statistics has remained elusive for decades. Controllable many-body quantum states generated on quantum processors offer another path for exploring these fundamental phenomena. While efforts on conventional solid-state platforms typically involve Hamiltonian dynamics of quasi-particles, superconducting quantum processors allow for directly manipulating the many-body wavefunction via unitary gates. Building on predictions that stabilizer codes can host projective non-Abelian Ising anyons, we implement a generalized stabilizer code and unitary protocol to create and braid them. This allows us to experimentally verify the fusion rules of the anyons and braid them to realize their statistics. We then study the prospect of employing the anyons for quantum computation and utilize braiding to create an entangled state of anyons encoding three logical qubits. Our work provides new insights about non-Abelian braiding and - through the future inclusion of error correction to achieve topological protection - could open a path toward fault-tolerant quantum computing.
Published: 2022

12. Suppressing quantum errors by scaling a surface code logical qubit

Author: Acharya, Rajeev, Aleiner, Igor, Allen, Richard, Andersen, Trond I., Ansmann, Markus, Arute, Frank, Arya, Kunal, Asfaw, Abraham, Atalaya, Juan, Babbush, Ryan, Bacon, Dave, Bardin, Joseph C., Basso, Joao, Bengtsson, Andreas, Boixo, Sergio, Bortoli, Gina, Bourassa, Alexandre, Bovaird, Jenna, Brill, Leon, Broughton, Michael, Buckley, Bob B., Buell, David A., Burger, Tim, Burkett, Brian, Bushnell, Nicholas, Chen, Yu, Chen, Zijun, Chiaro, Ben, Cogan, Josh, Collins, Roberto, Conner, Paul, Courtney, William, Crook, Alexander L., Curtin, Ben, Debroy, Dripto M., Barba, Alexander Del Toro, Demura, Sean, Dunsworth, Andrew, Eppens, Daniel, Erickson, Catherine, Faoro, Lara, Farhi, Edward, Fatemi, Reza, Burgos, Leslie Flores, Forati, Ebrahim, Fowler, Austin G., Foxen, Brooks, Giang, William, Gidney, Craig, Gilboa, Dar, Giustina, Marissa, Dau, Alejandro Grajales, Gross, Jonathan A., Habegger, Steve, Hamilton, Michael C., Harrigan, Matthew P., Harrington, Sean D., Higgott, Oscar, Hilton, Jeremy, Hoffmann, Markus, Hong, Sabrina, Huang, Trent, Huff, Ashley, Huggins, William J., Ioffe, Lev B., Isakov, Sergei V., Iveland, Justin, Jeffrey, Evan, Jiang, Zhang, Jones, Cody, Juhas, Pavol, Kafri, Dvir, Kechedzhi, Kostyantyn, Kelly, Julian, Khattar, Tanuj, Khezri, Mostafa, Kieferová, Mária, Kim, Seon, Kitaev, Alexei, Klimov, Paul V., Klots, Andrey R., Korotkov, Alexander N., Kostritsa, Fedor, Kreikebaum, John Mark, Landhuis, David, Laptev, Pavel, Lau, Kim-Ming, Laws, Lily, Lee, Joonho, Lee, Kenny, Lester, Brian J., Lill, Alexander, Liu, Wayne, Locharla, Aditya, Lucero, Erik, Malone, Fionn D., Marshall, Jeffrey, Martin, Orion, McClean, Jarrod R., Mccourt, Trevor, McEwen, Matt, Megrant, Anthony, Costa, Bernardo Meurer, Mi, Xiao, Miao, Kevin C., Mohseni, Masoud, Montazeri, Shirin, Morvan, Alexis, Mount, Emily, Mruczkiewicz, Wojciech, Naaman, Ofer, Neeley, Matthew, Neill, Charles, Nersisyan, Ani, Neven, Hartmut, Newman, Michael, Ng, Jiun How, Nguyen, Anthony, Nguyen, Murray, Niu, Murphy Yuezhen, O'Brien, Thomas E., Opremcak, Alex, Platt, John, Petukhov, Andre, Potter, Rebecca, Pryadko, Leonid P., Quintana, Chris, Roushan, Pedram, Rubin, Nicholas C., Saei, Negar, Sank, Daniel, Sankaragomathi, Kannan, Satzinger, Kevin J., Schurkus, Henry F., Schuster, Christopher, Shearn, Michael J., Shorter, Aaron, Shvarts, Vladimir, Skruzny, Jindra, Smelyanskiy, Vadim, Smith, W. Clarke, Sterling, George, Strain, Doug, Szalay, Marco, Torres, Alfredo, Vidal, Guifre, Villalonga, Benjamin, Heidweiller, Catherine Vollgraff, White, Theodore, Xing, Cheng, Yao, Z. Jamie, Yeh, Ping, Yoo, Juhwan, Young, Grayson, Zalcman, Adam, Zhang, Yaxing, and Zhu, Ningfeng
Subjects: Quantum Physics
Abstract: Practical quantum computing will require error rates that are well below what is achievable with physical qubits. Quantum error correction offers a path to algorithmically-relevant error rates by encoding logical qubits within many physical qubits, where increasing the number of physical qubits enhances protection against physical errors. However, introducing more qubits also increases the number of error sources, so the density of errors must be sufficiently low in order for logical performance to improve with increasing code size. Here, we report the measurement of logical qubit performance scaling across multiple code sizes, and demonstrate that our system of superconducting qubits has sufficient performance to overcome the additional errors from increasing qubit number. We find our distance-5 surface code logical qubit modestly outperforms an ensemble of distance-3 logical qubits on average, both in terms of logical error probability over 25 cycles and logical error per cycle ($2.914\%\pm 0.016\%$ compared to $3.028\%\pm 0.023\%$). To investigate damaging, low-probability error sources, we run a distance-25 repetition code and observe a $1.7\times10^{-6}$ logical error per round floor set by a single high-energy event ($1.6\times10^{-7}$ when excluding this event). We are able to accurately model our experiment, and from this model we can extract error budgets that highlight the biggest challenges for future systems. These results mark the first experimental demonstration where quantum error correction begins to improve performance with increasing qubit number, illuminating the path to reaching the logical error rates required for computation., Comment: Main text: 6 pages, 4 figures. v2: Update author list, references, Fig. S12, Table IV
Published: 2022

13. Formation of robust bound states of interacting microwave photons

Author: Morvan, Alexis, Andersen, Trond I., Mi, Xiao, Neill, Charles, Petukhov, Andre, Kechedzhi, Kostyantyn, Abanin, Dmitry, Acharya, Rajeev, Arute, Frank, Arya, Kunal, Asfaw, Abraham, Atalaya, Juan, Babbush, Ryan, Bacon, Dave, Bardin, Joseph C., Basso, Joao, Bengtsson, Andreas, Bortoli, Gina, Bourassa, Alexandre, Bovaird, Jenna, Brill, Leon, Broughton, Michael, Buckley, Bob B., Buell, David A., Burger, Tim, Burkett, Brian, Bushnell, Nicholas, Chen, Zijun, Chiaro, Ben, Collins, Roberto, Conner, Paul, Courtney, William, Crook, Alexander L., Curtin, Ben, Debroy, Dripto M., Barba, Alexander Del Toro, Demura, Sean, Dunsworth, Andrew, Eppens, Daniel, Erickson, Catherine, Faoro, Lara, Farhi, Edward, Fatemi, Reza, Burgos, Leslie Flores, Forati, Ebrahim, Fowler, Austin G., Foxen, Brooks, Giang, William, Gidney, Craig, Gilboa, Dar, Giustina, Marissa, Dau, Alejandro Grajales, Gross, Jonathan A., Habegger, Steve, Hamilton, Michael C., Harrigan, Matthew P., Harrington, Sean D., Hilton, Jeremy, Hoffmann, Markus, Hong, Sabrina, Huang, Trent, Huff, Ashley, Huggins, William J., Isakov, Sergei V., Iveland, Justin, Jeffrey, Evan, Jiang, Zhang, Jones, Cody, Juhas, Pavol, Kafri, Dvir, Khattar, Tanuj, Khezri, Mostafa, Kieferova, Marika, Kim, Seon, Kitaev, Alexei, Klimov, Paul V., Klots, Andrey R., Korotkov, Alexander N., Kostritsa, Fedor, Kreikebaum, John Mark, Landhuis, David, Laptev, Pavel, Lau, Kim-Ming, Laws, Lily, Lee, Joonho, Lee, Kenny, Lester, Brian J., Lill, Alexander, Liu, Wayne, Locharla, Aditya, Lucero, Erik, Malone, Fionn D., Martin, Orion, McClean, Jarrod R., McEwen, Matt, Costa, Bernardo Meurer, Miao, Kevin C., Mohseni, Masoud, Montazeri, Shirin, Mount, Emily, Mruczkiewicz, Wojciech, Naaman, Ofer, Neeley, Matthew, Nersisyan, Ani, Newman, Michael, Nguyen, Anthony, Nguyen, Murray, Niu, Murphy Yuezhen, O'Brien, Thomas E., Olenewa, Ricardo, Opremcak, Alex, Potter, Rebecca, Quintana, Chris, Rubin, Nicholas C., Saei, Negar, Sank, Daniel, Sankaragomathi, Kannan, Satzinger, Kevin J., Schurkus, Henry F., Schuster, Christopher, Shearn, Michael J., Shorter, Aaron, Shvarts, Vladimir, Skruzny, Jindra, Smith, W. Clarke, Sterling, George, Strain, Doug, Su, Yuan, Szalay, Marco, Torres, Alfredo, Vidal, Guifre, Villalonga, Benjamin, Heidweiller, Catherine Vollgraff, White, Theodore, Xing, Cheng, Yao, Z. Jamie, Yeh, Ping, Yoo, Juhwan, Zalcman, Adam, Zhang, Yaxing, Zhu, Ningfeng, Neven, Hartmut, Boixo, Sergio, Megrant, Anthony, Kelly, Julian, Chen, Yu, Smelyanskiy, Vadim, Aleiner, Igor, Ioffe, Lev B., and Roushan, Pedram
Subjects: Quantum Physics, Condensed Matter - Mesoscale and Nanoscale Physics, Condensed Matter - Other Condensed Matter
Abstract: Systems of correlated particles appear in many fields of science and represent some of the most intractable puzzles in nature. The computational challenge in these systems arises when interactions become comparable to other energy scales, which makes the state of each particle depend on all other particles. The lack of general solutions for the 3-body problem and acceptable theory for strongly correlated electrons shows that our understanding of correlated systems fades when the particle number or the interaction strength increases. One of the hallmarks of interacting systems is the formation of multi-particle bound states. In a ring of 24 superconducting qubits, we develop a high fidelity parameterizable fSim gate that we use to implement the periodic quantum circuit of the spin-1/2 XXZ model, an archetypal model of interaction. By placing microwave photons in adjacent qubit sites, we study the propagation of these excitations and observe their bound nature for up to 5 photons. We devise a phase sensitive method for constructing the few-body spectrum of the bound states and extract their pseudo-charge by introducing a synthetic flux. By introducing interactions between the ring and additional qubits, we observe an unexpected resilience of the bound states to integrability breaking. This finding goes against the common wisdom that bound states in non-integrable systems are unstable when their energies overlap with the continuum spectrum. Our work provides experimental evidence for bound states of interacting photons and discovers their stability beyond the integrability limit., Comment: 7 pages + 15 pages supplements
Published: 2022
Full Text: View/download PDF

14. Pipelined correlated minimum weight perfect matching of the surface code

Author: Paler, Alexandru and Fowler, Austin G.
Subjects: Quantum Physics
Abstract: We describe a pipeline approach to decoding the surface code using minimum weight perfect matching, including taking into account correlations between detection events. An independent no-communication parallelizable processing stage reweights the graph according to likely correlations, followed by another no-communication parallelizable stage for high confidence matching. A later general stage finishes the matching. This is a simplification of previous correlated matching techniques which required a complex interaction between general matching and re-weighting the graph. Despite this simplification, which gives correlated matching a better chance of achieving real-time processing, we find the logical error rate practically unchanged. We validate the new algorithm on the fully fault-tolerant toric, unrotated, and rotated surface codes, all with standard depolarizing noise. We expect these techniques to be applicable to a wide range of other decoders.
Published: 2022
Full Text: View/download PDF

15. Noise-resilient Edge Modes on a Chain of Superconducting Qubits

Author: Mi, Xiao, Sonner, Michael, Niu, Murphy Yuezhen, Lee, Kenneth W., Foxen, Brooks, Acharya, Rajeev, Aleiner, Igor, Andersen, Trond I., Arute, Frank, Arya, Kunal, Asfaw, Abraham, Atalaya, Juan, Babbush, Ryan, Bacon, Dave, Bardin, Joseph C., Basso, Joao, Bengtsson, Andreas, Bortoli, Gina, Bourassa, Alexandre, Brill, Leon, Broughton, Michael, Buckley, Bob B., Buell, David A., Burkett, Brian, Bushnell, Nicholas, Chen, Zijun, Chiaro, Benjamin, Collins, Roberto, Conner, Paul, Courtney, William, Crook, Alexander L., Debroy, Dripto M., Demura, Sean, Dunsworth, Andrew, Eppens, Daniel, Erickson, Catherine, Faoro, Lara, Farhi, Edward, Fatemi, Reza, Flores, Leslie, Forati, Ebrahim, Fowler, Austin G., Giang, William, Gidney, Craig, Gilboa, Dar, Giustina, Marissa, Dau, Alejandro Grajales, Gross, Jonathan A., Habegger, Steve, Harrigan, Matthew P., Hilton, Jeremy, Hoffmann, Markus, Hong, Sabrina, Huang, Trent, Huff, Ashley, Huggins, William J., Ioffe, Lev B., Isakov, Sergei V., Iveland, Justin, Jeffrey, Evan, Jiang, Zhang, Jones, Cody, Kafri, Dvir, Kechedzhi, Kostyantyn, Khattar, Tanuj, Kim, Seon, Kitaev, Alexei, Klimov, Paul V., Klots, Andrey R., Korotkov, Alexander N., Kostritsa, Fedor, Kreikebaum, J. M., Landhuis, David, Laptev, Pavel, Lau, Kim-Ming, Lee, Joonho, Laws, Lily, Liu, Wayne, Locharla, Aditya, Lucero, Erik, Martin, Orion, McClean, Jarrod R., McEwen, Matt, Costa, Bernardo Meurer, Miao, Kevin C., Mohseni, Masoud, Montazeri, Shirin, Morvan, Alexis, Mount, Emily, Mruczkiewicz, Wojciech, Naaman, Ofer, Neeley, Matthew, Neill, Charles, Newman, Michael, O'Brien, Thomas E., Opremcak, Alex, Petukhov, Andre, Potter, Rebecca, Quintana, Chris, Rubin, Nicholas C., Saei, Negar, Sank, Daniel, Sankaragomathi, Kannan, Satzinger, Kevin J., Schuster, Christopher, Shearn, Michael J., Shvarts, Vladimir, Strain, Doug, Su, Yuan, Szalay, Marco, Vidal, Guifre, Villalonga, Benjamin, Vollgraff-Heidweiller, Catherine, White, Theodore, Yao, Z. Jamie, Yeh, Ping, Yoo, Juhwan, Zalcman, Adam, Zhang, Yaxing, Zhu, Ningfeng, Neven, Hartmut, Boixo, Sergio, Megrant, Anthony, Chen, Yu, Kelly, Julian, Smelyanskiy, Vadim, Abanin, Dmitry A., and Roushan, Pedram
Subjects: Quantum Physics, Condensed Matter - Mesoscale and Nanoscale Physics, Condensed Matter - Other Condensed Matter
Abstract: Inherent symmetry of a quantum system may protect its otherwise fragile states. Leveraging such protection requires testing its robustness against uncontrolled environmental interactions. Using 47 superconducting qubits, we implement the one-dimensional kicked Ising model which exhibits non-local Majorana edge modes (MEMs) with $\mathbb{Z}_2$ parity symmetry. Remarkably, we find that any multi-qubit Pauli operator overlapping with the MEMs exhibits a uniform late-time decay rate comparable to single-qubit relaxation rates, irrespective of its size or composition. This characteristic allows us to accurately reconstruct the exponentially localized spatial profiles of the MEMs. Furthermore, the MEMs are found to be resilient against certain symmetry-breaking noise owing to a prethermalization mechanism. Our work elucidates the complex interplay between noise and symmetry-protected edge modes in a solid-state environment.
Published: 2022
Full Text: View/download PDF

16. Overcoming leakage in quantum error correction

Author: Miao, Kevin C., McEwen, Matt, Atalaya, Juan, Kafri, Dvir, Pryadko, Leonid P., Bengtsson, Andreas, Opremcak, Alex, Satzinger, Kevin J., Chen, Zijun, Klimov, Paul V., Quintana, Chris, Acharya, Rajeev, Anderson, Kyle, Ansmann, Markus, Arute, Frank, Arya, Kunal, Asfaw, Abraham, Bardin, Joseph C., Bourassa, Alexandre, Bovaird, Jenna, Brill, Leon, Buckley, Bob B., Buell, David A., Burger, Tim, Burkett, Brian, Bushnell, Nicholas, Campero, Juan, Chiaro, Ben, Collins, Roberto, Conner, Paul, Crook, Alexander L., Curtin, Ben, Debroy, Dripto M., Demura, Sean, Dunsworth, Andrew, Erickson, Catherine, Fatemi, Reza, Ferreira, Vinicius S., Burgos, Leslie Flores, Forati, Ebrahim, Fowler, Austin G., Foxen, Brooks, Garcia, Gonzalo, Giang, William, Gidney, Craig, Giustina, Marissa, Gosula, Raja, Dau, Alejandro Grajales, Gross, Jonathan A., Hamilton, Michael C., Harrington, Sean D., Heu, Paula, Hilton, Jeremy, Hoffmann, Markus R., Hong, Sabrina, Huang, Trent, Huff, Ashley, Iveland, Justin, Jeffrey, Evan, Jiang, Zhang, Jones, Cody, Kelly, Julian, Kim, Seon, Kostritsa, Fedor, Kreikebaum, John Mark, Landhuis, David, Laptev, Pavel, Laws, Lily, Lee, Kenny, Lester, Brian J., Lill, Alexander T., Liu, Wayne, Locharla, Aditya, Lucero, Erik, Martin, Steven, Megrant, Anthony, Mi, Xiao, Montazeri, Shirin, Morvan, Alexis, Naaman, Ofer, Neeley, Matthew, Neill, Charles, Nersisyan, Ani, Newman, Michael, Ng, Jiun How, Nguyen, Anthony, Nguyen, Murray, Potter, Rebecca, Rocque, Charles, Roushan, Pedram, Sankaragomathi, Kannan, Schurkus, Henry F., Schuster, Christopher, Shearn, Michael J., Shorter, Aaron, Shutty, Noah, Shvarts, Vladimir, Skruzny, Jindra, Smith, W. Clarke, Sterling, George, Szalay, Marco, Thor, Douglas, Torres, Alfredo, White, Theodore, Woo, Bryan W. K., Yao, Z. Jamie, Yeh, Ping, Yoo, Juhwan, Young, Grayson, Zalcman, Adam, Zhu, Ningfeng, Zobrist, Nicholas, Neven, Hartmut, Smelyanskiy, Vadim, Petukhov, Andre, Korotkov, Alexander N., Sank, Daniel, and Chen, Yu
Published: 2023
Full Text: View/download PDF

17. A Fault-Tolerant Honeycomb Memory

Author: Gidney, Craig, Newman, Michael, Fowler, Austin, and Broughton, Michael
Subjects: Quantum Physics
Abstract: Recently, Hastings & Haah introduced a quantum memory defined on the honeycomb lattice. Remarkably, this honeycomb code assembles weight-six parity checks using only two-local measurements. The sparse connectivity and two-local measurements are desirable features for certain hardware, while the weight-six parity checks enable robust performance in the circuit model. In this work, we quantify the robustness of logical qubits preserved by the honeycomb code using a correlated minimum-weight perfect-matching decoder. Using Monte Carlo sampling, we estimate the honeycomb code's threshold in different error models, and project how efficiently it can reach the "teraquop regime" where trillions of quantum logical operations can be executed reliably. We perform the same estimates for the rotated surface code, and find a threshold of $0.2\%-0.3\%$ for the honeycomb code compared to a threshold of $0.5\%-0.7\%$ for the surface code in a controlled-not circuit model. In a circuit model with native two-body measurements, the honeycomb code achieves a threshold of $1.5\% < p <2.0\%$, where $p$ is the collective error rate of the two-body measurement gate - including both measurement and correlated data depolarization error processes. With such gates at a physical error rate of $10^{-3}$, we project that the honeycomb code can reach the teraquop regime with only $600$ physical qubits., Comment: 17 pages, 10 figures, 2 tables
Published: 2021
Full Text: View/download PDF

18. Observation of Time-Crystalline Eigenstate Order on a Quantum Processor

Author: Mi, Xiao, Ippoliti, Matteo, Quintana, Chris, Greene, Ami, Chen, Zijun, Gross, Jonathan, Arute, Frank, Arya, Kunal, Atalaya, Juan, Babbush, Ryan, Bardin, Joseph C., Basso, Joao, Bengtsson, Andreas, Bilmes, Alexander, Bourassa, Alexandre, Brill, Leon, Broughton, Michael, Buckley, Bob B., Buell, David A., Burkett, Brian, Bushnell, Nicholas, Chiaro, Benjamin, Collins, Roberto, Courtney, William, Debroy, Dripto, Demura, Sean, Derk, Alan R., Dunsworth, Andrew, Eppens, Daniel, Erickson, Catherine, Farhi, Edward, Fowler, Austin G., Foxen, Brooks, Gidney, Craig, Giustina, Marissa, Harrigan, Matthew P., Harrington, Sean D., Hilton, Jeremy, Ho, Alan, Hong, Sabrina, Huang, Trent, Huff, Ashley, Huggins, William J., Ioffe, L. B., Isakov, Sergei V., Iveland, Justin, Jeffrey, Evan, Jiang, Zhang, Jones, Cody, Kafri, Dvir, Khattar, Tanuj, Kim, Seon, Kitaev, Alexei, Klimov, Paul V., Korotkov, Alexander N., Kostritsa, Fedor, Landhuis, David, Laptev, Pavel, Lee, Joonho, Lee, Kenny, Locharla, Aditya, Lucero, Erik, Martin, Orion, McClean, Jarrod R., McCourt, Trevor, McEwen, Matt, Miao, Kevin C., Mohseni, Masoud, Montazeri, Shirin, Mruczkiewicz, Wojciech, Naaman, Ofer, Neeley, Matthew, Neill, Charles, Newman, Michael, Niu, Murphy Yuezhen, Brien, Thomas E. O\', Opremcak, Alex, Ostby, Eric, Pato, Balint, Petukhov, Andre, Rubin, Nicholas C., Sank, Daniel, Satzinger, Kevin J., Shvarts, Vladimir, Su, Yuan, Strain, Doug, Szalay, Marco, Trevithick, Matthew D., Villalonga, Benjamin, White, Theodore, Yao, Z. Jamie, Yeh, Ping, Yoo, Juhwan, Zalcman, Adam, Neven, Hartmut, Boixo, Sergio, Smelyanskiy, Vadim, Megrant, Anthony, Kelly, Julian, Chen, Yu, Sondhi, S. L., Moessner, Roderich, Kechedzhi, Kostyantyn, Khemani, Vedika, and Roushan, Pedram
Subjects: Quantum Physics, Condensed Matter - Disordered Systems and Neural Networks, Condensed Matter - Statistical Mechanics, Condensed Matter - Strongly Correlated Electrons
Abstract: Quantum many-body systems display rich phase structure in their low-temperature equilibrium states. However, much of nature is not in thermal equilibrium. Remarkably, it was recently predicted that out-of-equilibrium systems can exhibit novel dynamical phases that may otherwise be forbidden by equilibrium thermodynamics, a paradigmatic example being the discrete time crystal (DTC). Concretely, dynamical phases can be defined in periodically driven many-body localized systems via the concept of eigenstate order. In eigenstate-ordered phases, the entire many-body spectrum exhibits quantum correlations and long-range order, with characteristic signatures in late-time dynamics from all initial states. It is, however, challenging to experimentally distinguish such stable phases from transient phenomena, wherein few select states can mask typical behavior. Here we implement a continuous family of tunable CPHASE gates on an array of superconducting qubits to experimentally observe an eigenstate-ordered DTC. We demonstrate the characteristic spatiotemporal response of a DTC for generic initial states. Our work employs a time-reversal protocol that discriminates external decoherence from intrinsic thermalization, and leverages quantum typicality to circumvent the exponential cost of densely sampling the eigenspectrum. In addition, we locate the phase transition out of the DTC with an experimental finite-size analysis. These results establish a scalable approach to study non-equilibrium phases of matter on current quantum processors.
Published: 2021
Full Text: View/download PDF

19. Resolving catastrophic error bursts from cosmic rays in large arrays of superconducting qubits

Author: McEwen, Matt, Faoro, Lara, Arya, Kunal, Dunsworth, Andrew, Huang, Trent, Kim, Seon, Burkett, Brian, Fowler, Austin, Arute, Frank, Bardin, Joseph C., Bengtsson, Andreas, Bilmes, Alexander, Buckley, Bob B., Bushnell, Nicholas, Chen, Zijun, Collins, Roberto, Demura, Sean, Derk, Alan R., Erickson, Catherine, Giustina, Marissa, Harrington, Sean D., Hong, Sabrina, Jeffrey, Evan, Kelly, Julian, Klimov, Paul V., Kostritsa, Fedor, Laptev, Pavel, Locharla, Aditya, Mi, Xiao, Miao, Kevin C., Montazeri, Shirin, Mutus, Josh, Naaman, Ofer, Neeley, Matthew, Neill, Charles, Opremcak, Alex, Quintana, Chris, Redd, Nicholas, Roushan, Pedram, Sank, Daniel, Satzinger, Kevin J., Shvarts, Vladimir, White, Theodore, Yao, Z. Jamie, Yeh, Ping, Yoo, Juhwan, Chen, Yu, Smelyanskiy, Vadim, Martinis, John M., Neven, Hartmut, Megrant, Anthony, Ioffe, Lev, and Barends, Rami
Subjects: Quantum Physics
Abstract: Scalable quantum computing can become a reality with error correction, provided coherent qubits can be constructed in large arrays. The key premise is that physical errors can remain both small and sufficiently uncorrelated as devices scale, so that logical error rates can be exponentially suppressed. However, energetic impacts from cosmic rays and latent radioactivity violate both of these assumptions. An impinging particle ionizes the substrate, radiating high energy phonons that induce a burst of quasiparticles, destroying qubit coherence throughout the device. High-energy radiation has been identified as a source of error in pilot superconducting quantum devices, but lacking a measurement technique able to resolve a single event in detail, the effect on large scale algorithms and error correction in particular remains an open question. Elucidating the physics involved requires operating large numbers of qubits at the same rapid timescales as in error correction, exposing the event's evolution in time and spread in space. Here, we directly observe high-energy rays impacting a large-scale quantum processor. We introduce a rapid space and time-multiplexed measurement method and identify large bursts of quasiparticles that simultaneously and severely limit the energy coherence of all qubits, causing chip-wide failure. We track the events from their initial localised impact to high error rates across the chip. Our results provide direct insights into the scale and dynamics of these damaging error bursts in large-scale devices, and highlight the necessity of mitigation to enable quantum computing to scale.
Published: 2021
Full Text: View/download PDF

20. Exponential suppression of bit or phase flip errors with repetitive error correction

Author: Chen, Zijun, Satzinger, Kevin J., Atalaya, Juan, Korotkov, Alexander N., Dunsworth, Andrew, Sank, Daniel, Quintana, Chris, McEwen, Matt, Barends, Rami, Klimov, Paul V., Hong, Sabrina, Jones, Cody, Petukhov, Andre, Kafri, Dvir, Demura, Sean, Burkett, Brian, Gidney, Craig, Fowler, Austin G., Putterman, Harald, Aleiner, Igor, Arute, Frank, Arya, Kunal, Babbush, Ryan, Bardin, Joseph C., Bengtsson, Andreas, Bourassa, Alexandre, Broughton, Michael, Buckley, Bob B., Buell, David A., Bushnell, Nicholas, Chiaro, Benjamin, Collins, Roberto, Courtney, William, Derk, Alan R., Eppens, Daniel, Erickson, Catherine, Farhi, Edward, Foxen, Brooks, Giustina, Marissa, Gross, Jonathan A., Harrigan, Matthew P., Harrington, Sean D., Hilton, Jeremy, Ho, Alan, Huang, Trent, Huggins, William J., Ioffe, L. B., Isakov, Sergei V., Jeffrey, Evan, Jiang, Zhang, Kechedzhi, Kostyantyn, Kim, Seon, Kostritsa, Fedor, Landhuis, David, Laptev, Pavel, Lucero, Erik, Martin, Orion, McClean, Jarrod R., McCourt, Trevor, Mi, Xiao, Miao, Kevin C., Mohseni, Masoud, Mruczkiewicz, Wojciech, Mutus, Josh, Naaman, Ofer, Neeley, Matthew, Neill, Charles, Newman, Michael, Niu, Murphy Yuezhen, O'Brien, Thomas E., Opremcak, Alex, Ostby, Eric, Pató, Bálint, Redd, Nicholas, Roushan, Pedram, Rubin, Nicholas C., Shvarts, Vladimir, Strain, Doug, Szalay, Marco, Trevithick, Matthew D., Villalonga, Benjamin, White, Theodore, Yao, Z. Jamie, Yeh, Ping, Zalcman, Adam, Neven, Hartmut, Boixo, Sergio, Smelyanskiy, Vadim, Chen, Yu, Megrant, Anthony, and Kelly, Julian
Subjects: Quantum Physics
Abstract: Realizing the potential of quantum computing will require achieving sufficiently low logical error rates. Many applications call for error rates in the $10^{-15}$ regime, but state-of-the-art quantum platforms typically have physical error rates near $10^{-3}$. Quantum error correction (QEC) promises to bridge this divide by distributing quantum logical information across many physical qubits so that errors can be detected and corrected. Logical errors are then exponentially suppressed as the number of physical qubits grows, provided that the physical error rates are below a certain threshold. QEC also requires that the errors are local and that performance is maintained over many rounds of error correction, two major outstanding experimental challenges. Here, we implement 1D repetition codes embedded in a 2D grid of superconducting qubits which demonstrate exponential suppression of bit or phase-flip errors, reducing logical error per round by more than $100\times$ when increasing the number of qubits from 5 to 21. Crucially, this error suppression is stable over 50 rounds of error correction. We also introduce a method for analyzing error correlations with high precision, and characterize the locality of errors in a device performing QEC for the first time. Finally, we perform error detection using a small 2D surface code logical qubit on the same device, and show that the results from both 1D and 2D codes agree with numerical simulations using a simple depolarizing error model. These findings demonstrate that superconducting qubits are on a viable path towards fault tolerant quantum computing.
Published: 2021
Full Text: View/download PDF

21. Time-crystalline eigenstate order on a quantum processor

Author: Mi, Xiao, Ippoliti, Matteo, Quintana, Chris, Greene, Ami, Chen, Zijun, Gross, Jonathan, Arute, Frank, Arya, Kunal, Atalaya, Juan, Babbush, Ryan, Bardin, Joseph C, Basso, Joao, Bengtsson, Andreas, Bilmes, Alexander, Bourassa, Alexandre, Brill, Leon, Broughton, Michael, Buckley, Bob B, Buell, David A, Burkett, Brian, Bushnell, Nicholas, Chiaro, Benjamin, Collins, Roberto, Courtney, William, Debroy, Dripto, Demura, Sean, Derk, Alan R, Dunsworth, Andrew, Eppens, Daniel, Erickson, Catherine, Farhi, Edward, Fowler, Austin G, Foxen, Brooks, Gidney, Craig, Giustina, Marissa, Harrigan, Matthew P, Harrington, Sean D, Hilton, Jeremy, Ho, Alan, Hong, Sabrina, Huang, Trent, Huff, Ashley, Huggins, William J, Ioffe, LB, Isakov, Sergei V, Iveland, Justin, Jeffrey, Evan, Jiang, Zhang, Jones, Cody, Kafri, Dvir, Khattar, Tanuj, Kim, Seon, Kitaev, Alexei, Klimov, Paul V, Korotkov, Alexander N, Kostritsa, Fedor, Landhuis, David, Laptev, Pavel, Lee, Joonho, Lee, Kenny, Locharla, Aditya, Lucero, Erik, Martin, Orion, McClean, Jarrod R, McCourt, Trevor, McEwen, Matt, Miao, Kevin C, Mohseni, Masoud, Montazeri, Shirin, Mruczkiewicz, Wojciech, Naaman, Ofer, Neeley, Matthew, Neill, Charles, Newman, Michael, Niu, Murphy Yuezhen, O’Brien, Thomas E, Opremcak, Alex, Ostby, Eric, Pato, Balint, Petukhov, Andre, Rubin, Nicholas C, Sank, Daniel, Satzinger, Kevin J, Shvarts, Vladimir, Su, Yuan, Strain, Doug, Szalay, Marco, Trevithick, Matthew D, Villalonga, Benjamin, White, Theodore, Yao, Z Jamie, Yeh, Ping, Yoo, Juhwan, Zalcman, Adam, Neven, Hartmut, Boixo, Sergio, Smelyanskiy, Vadim, Megrant, Anthony, Kelly, Julian, and Chen, Yu
Subjects: Cold Temperature, Phase Transition, Thermodynamics, General Science & Technology
Abstract: Quantum many-body systems display rich phase structure in their low-temperature equilibrium states1. However, much of nature is not in thermal equilibrium. Remarkably, it was recently predicted that out-of-equilibrium systems can exhibit novel dynamical phases2-8 that may otherwise be forbidden by equilibrium thermodynamics, a paradigmatic example being the discrete time crystal (DTC)7,9-15. Concretely, dynamical phases can be defined in periodically driven many-body-localized (MBL) systems via the concept of eigenstate order7,16,17. In eigenstate-ordered MBL phases, the entire many-body spectrum exhibits quantum correlations and long-range order, with characteristic signatures in late-time dynamics from all initial states. It is, however, challenging to experimentally distinguish such stable phases from transient phenomena, or from regimes in which the dynamics of a few select states can mask typical behaviour. Here we implement tunable controlled-phase (CPHASE) gates on an array of superconducting qubits to experimentally observe an MBL-DTC and demonstrate its characteristic spatiotemporal response for generic initial states7,9,10. Our work employs a time-reversal protocol to quantify the impact of external decoherence, and leverages quantum typicality to circumvent the exponential cost of densely sampling the eigenspectrum. Furthermore, we locate the phase transition out of the DTC with an experimental finite-size analysis. These results establish a scalable approach to studying non-equilibrium phases of matter on quantum processors.
Published: 2022

22. Information Scrambling in Computationally Complex Quantum Circuits

Author: Mi, Xiao, Roushan, Pedram, Quintana, Chris, Mandra, Salvatore, Marshall, Jeffrey, Neill, Charles, Arute, Frank, Arya, Kunal, Atalaya, Juan, Babbush, Ryan, Bardin, Joseph C., Barends, Rami, Bengtsson, Andreas, Boixo, Sergio, Bourassa, Alexandre, Broughton, Michael, Buckley, Bob B., Buell, David A., Burkett, Brian, Bushnell, Nicholas, Chen, Zijun, Chiaro, Benjamin, Collins, Roberto, Courtney, William, Demura, Sean, Derk, Alan R., Dunsworth, Andrew, Eppens, Daniel, Erickson, Catherine, Farhi, Edward, Fowler, Austin G., Foxen, Brooks, Gidney, Craig, Giustina, Marissa, Gross, Jonathan A., Harrigan, Matthew P., Harrington, Sean D., Hilton, Jeremy, Ho, Alan, Hong, Sabrina, Huang, Trent, Huggins, William J., Ioffe, L. B., Isakov, Sergei V., Jeffrey, Evan, Jiang, Zhang, Jones, Cody, Kafri, Dvir, Kelly, Julian, Kim, Seon, Kitaev, Alexei, Klimov, Paul V., Korotkov, Alexander N., Kostritsa, Fedor, Landhuis, David, Laptev, Pavel, Lucero, Erik, Martin, Orion, McClean, Jarrod R., McCourt, Trevor, McEwen, Matt, Megrant, Anthony, Miao, Kevin C., Mohseni, Masoud, Mruczkiewicz, Wojciech, Mutus, Josh, Naaman, Ofer, Neeley, Matthew, Newman, Michael, Niu, Murphy Yuezhen, O'Brien, Thomas E., Opremcak, Alex, Ostby, Eric, Pato, Balint, Petukhov, Andre, Redd, Nicholas, Rubin, Nicholas C., Sank, Daniel, Satzinger, Kevin J., Shvarts, Vladimir, Strain, Doug, Szalay, Marco, Trevithick, Matthew D., Villalonga, Benjamin, White, Theodore, Yao, Z. Jamie, Yeh, Ping, Zalcman, Adam, Neven, Hartmut, Aleiner, Igor, Kechedzhi, Kostyantyn, Smelyanskiy, Vadim, and Chen, Yu
Subjects: Quantum Physics, Condensed Matter - Strongly Correlated Electrons, High Energy Physics - Theory
Abstract: Interaction in quantum systems can spread initially localized quantum information into the many degrees of freedom of the entire system. Understanding this process, known as quantum scrambling, is the key to resolving various conundrums in physics. Here, by measuring the time-dependent evolution and fluctuation of out-of-time-order correlators, we experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We engineer quantum circuits that distinguish the two mechanisms associated with quantum scrambling, operator spreading and operator entanglement, and experimentally observe their respective signatures. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate. These results open the path to studying complex and practically relevant physical observables with near-term quantum processors.
Published: 2021
Full Text: View/download PDF

23. Observation of separated dynamics of charge and spin in the Fermi-Hubbard model

Author: Arute, Frank, Arya, Kunal, Babbush, Ryan, Bacon, Dave, Bardin, Joseph C., Barends, Rami, Bengtsson, Andreas, Boixo, Sergio, Broughton, Michael, Buckley, Bob B., Buell, David A., Burkett, Brian, Bushnell, Nicholas, Chen, Yu, Chen, Zijun, Chen, Yu-An, Chiaro, Ben, Collins, Roberto, Cotton, Stephen J., Courtney, William, Demura, Sean, Derk, Alan, Dunsworth, Andrew, Eppens, Daniel, Eckl, Thomas, Erickson, Catherine, Farhi, Edward, Fowler, Austin, Foxen, Brooks, Gidney, Craig, Giustina, Marissa, Graff, Rob, Gross, Jonathan A., Habegger, Steve, Harrigan, Matthew P., Ho, Alan, Hong, Sabrina, Huang, Trent, Huggins, William, Ioffe, Lev B., Isakov, Sergei V., Jeffrey, Evan, Jiang, Zhang, Jones, Cody, Kafri, Dvir, Kechedzhi, Kostyantyn, Kelly, Julian, Kim, Seon, Klimov, Paul V., Korotkov, Alexander N., Kostritsa, Fedor, Landhuis, David, Laptev, Pavel, Lindmark, Mike, Lucero, Erik, Marthaler, Michael, Martin, Orion, Martinis, John M., Marusczyk, Anika, McArdle, Sam, McClean, Jarrod R., McCourt, Trevor, McEwen, Matt, Megrant, Anthony, Mejuto-Zaera, Carlos, Mi, Xiao, Mohseni, Masoud, Mruczkiewicz, Wojciech, Mutus, Josh, Naaman, Ofer, Neeley, Matthew, Neill, Charles, Neven, Hartmut, Newman, Michael, Niu, Murphy Yuezhen, O'Brien, Thomas E., Ostby, Eric, Pató, Bálint, Petukhov, Andre, Putterman, Harald, Quintana, Chris, Reiner, Jan-Michael, Roushan, Pedram, Rubin, Nicholas C., Sank, Daniel, Satzinger, Kevin J., Smelyanskiy, Vadim, Strain, Doug, Sung, Kevin J., Schmitteckert, Peter, Szalay, Marco, Tubman, Norm M., Vainsencher, Amit, White, Theodore, Vogt, Nicolas, Yao, Z. Jamie, Yeh, Ping, Zalcman, Adam, and Zanker, Sebastian
Subjects: Quantum Physics
Abstract: Strongly correlated quantum systems give rise to many exotic physical phenomena, including high-temperature superconductivity. Simulating these systems on quantum computers may avoid the prohibitively high computational cost incurred in classical approaches. However, systematic errors and decoherence effects presented in current quantum devices make it difficult to achieve this. Here, we simulate the dynamics of the one-dimensional Fermi-Hubbard model using 16 qubits on a digital superconducting quantum processor. We observe separations in the spreading velocities of charge and spin densities in the highly excited regime, a regime that is beyond the conventional quasiparticle picture. To minimize systematic errors, we introduce an accurate gate calibration procedure that is fast enough to capture temporal drifts of the gate parameters. We also employ a sequence of error-mitigation techniques to reduce decoherence effects and residual systematic errors. These procedures allow us to simulate the time evolution of the model faithfully despite having over 600 two-qubit gates in our circuits. Our experiment charts a path to practical quantum simulation of strongly correlated phenomena using available quantum devices., Comment: 20 pages, 15 figures
Published: 2020

24. Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor

Author: Harrigan, Matthew P., Sung, Kevin J., Neeley, Matthew, Satzinger, Kevin J., Arute, Frank, Arya, Kunal, Atalaya, Juan, Bardin, Joseph C., Barends, Rami, Boixo, Sergio, Broughton, Michael, Buckley, Bob B., Buell, David A., Burkett, Brian, Bushnell, Nicholas, Chen, Yu, Chen, Zijun, Chiaro, Ben, Collins, Roberto, Courtney, William, Demura, Sean, Dunsworth, Andrew, Eppens, Daniel, Fowler, Austin, Foxen, Brooks, Gidney, Craig, Giustina, Marissa, Graff, Rob, Habegger, Steve, Ho, Alan, Hong, Sabrina, Huang, Trent, Ioffe, L. B., Isakov, Sergei V., Jeffrey, Evan, Jiang, Zhang, Jones, Cody, Kafri, Dvir, Kechedzhi, Kostyantyn, Kelly, Julian, Kim, Seon, Klimov, Paul V., Korotkov, Alexander N., Kostritsa, Fedor, Landhuis, David, Laptev, Pavel, Lindmark, Mike, Leib, Martin, Martin, Orion, Martinis, John M., McClean, Jarrod R., McEwen, Matt, Megrant, Anthony, Mi, Xiao, Mohseni, Masoud, Mruczkiewicz, Wojciech, Mutus, Josh, Naaman, Ofer, Neill, Charles, Neukart, Florian, Niu, Murphy Yuezhen, O'Brien, Thomas E., O'Gorman, Bryan, Ostby, Eric, Petukhov, Andre, Putterman, Harald, Quintana, Chris, Roushan, Pedram, Rubin, Nicholas C., Sank, Daniel, Skolik, Andrea, Smelyanskiy, Vadim, Strain, Doug, Streif, Michael, Szalay, Marco, Vainsencher, Amit, White, Theodore, Yao, Z. Jamie, Yeh, Ping, Zalcman, Adam, Zhou, Leo, Neven, Hartmut, Bacon, Dave, Lucero, Erik, Farhi, Edward, and Babbush, Ryan
Subjects: Quantum Physics
Abstract: We demonstrate the application of the Google Sycamore superconducting qubit quantum processor to combinatorial optimization problems with the quantum approximate optimization algorithm (QAOA). Like past QAOA experiments, we study performance for problems defined on the (planar) connectivity graph of our hardware; however, we also apply the QAOA to the Sherrington-Kirkpatrick model and MaxCut, both high dimensional graph problems for which the QAOA requires significant compilation. Experimental scans of the QAOA energy landscape show good agreement with theory across even the largest instances studied (23 qubits) and we are able to perform variational optimization successfully. For problems defined on our hardware graph we obtain an approximation ratio that is independent of problem size and observe, for the first time, that performance increases with circuit depth. For problems requiring compilation, performance decreases with problem size but still provides an advantage over random guessing for circuits involving several thousand gates. This behavior highlights the challenge of using near-term quantum computers to optimize problems on graphs differing from hardware connectivity. As these graphs are more representative of real world instances, our results advocate for more emphasis on such problems in the developing tradition of using the QAOA as a holistic, device-level benchmark of quantum processors., Comment: 19 pages, 15 figures
Published: 2020
Full Text: View/download PDF

25. Hartree-Fock on a superconducting qubit quantum computer

Author: Arute, Frank, Arya, Kunal, Babbush, Ryan, Bacon, Dave, Bardin, Joseph C., Barends, Rami, Boixo, Sergio, Broughton, Michael, Buckley, Bob B., Buell, David A., Burkett, Brian, Bushnell, Nicholas, Chen, Yu, Chen, Zijun, Chiaro, Benjamin, Collins, Roberto, Courtney, William, Demura, Sean, Dunsworth, Andrew, Eppens, Daniel, Farhi, Edward, Fowler, Austin, Foxen, Brooks, Gidney, Craig, Giustina, Marissa, Graff, Rob, Habegger, Steve, Harrigan, Matthew P., Ho, Alan, Hong, Sabrina, Huang, Trent, Huggins, William J., Ioffe, Lev, Isakov, Sergei V., Jeffrey, Evan, Jiang, Zhang, Jones, Cody, Kafri, Dvir, Kechedzhi, Kostyantyn, Kelly, Julian, Kim, Seon, Klimov, Paul V., Korotkov, Alexander, Kostritsa, Fedor, Landhuis, David, Laptev, Pavel, Lindmark, Mike, Lucero, Erik, Martin, Orion, Martinis, John M., McClean, Jarrod R., McEwen, Matt, Megrant, Anthony, Mi, Xiao, Mohseni, Masoud, Mruczkiewicz, Wojciech, Mutus, Josh, Naaman, Ofer, Neeley, Matthew, Neill, Charles, Neven, Hartmut, Niu, Murphy Yuezhen, O'Brien, Thomas E., Ostby, Eric, Petukhov, Andre, Putterman, Harald, Quintana, Chris, Roushan, Pedram, Rubin, Nicholas C., Sank, Daniel, Satzinger, Kevin J., Smelyanskiy, Vadim, Strain, Doug, Sung, Kevin J., Szalay, Marco, Takeshita, Tyler Y., Vainsencher, Amit, White, Theodore, Wiebe, Nathan, Yao, Z. Jamie, Yeh, Ping, and Zalcman, Adam
Subjects: Quantum Physics, Physics - Chemical Physics
Abstract: As the search continues for useful applications of noisy intermediate scale quantum devices, variational simulations of fermionic systems remain one of the most promising directions. Here, we perform a series of quantum simulations of chemistry the largest of which involved a dozen qubits, 78 two-qubit gates, and 114 one-qubit gates. We model the binding energy of ${\rm H}_6$, ${\rm H}_8$, ${\rm H}_{10}$ and ${\rm H}_{12}$ chains as well as the isomerization of diazene. We also demonstrate error-mitigation strategies based on $N$-representability which dramatically improve the effective fidelity of our experiments. Our parameterized ansatz circuits realize the Givens rotation approach to non-interacting fermion evolution, which we variationally optimize to prepare the Hartree-Fock wavefunction. This ubiquitous algorithmic primitive corresponds to a rotation of the orbital basis and is required by many proposals for correlated simulations of molecules and Hubbard models. Because non-interacting fermion evolutions are classically tractable to simulate, yet still generate highly entangled states over the computational basis, we use these experiments to benchmark the performance of our hardware while establishing a foundation for scaling up more complex correlated quantum simulations of chemistry., Comment: updated link to experiment code, new version containing expanded data sets and corrected figure label
Published: 2020
Full Text: View/download PDF

26. Exponential suppression of bit or phase errors with cyclic error correction

Author: Chen, Zijun, Satzinger, Kevin J, Atalaya, Juan, Korotkov, Alexander N, Dunsworth, Andrew, Sank, Daniel, Quintana, Chris, McEwen, Matt, Barends, Rami, Klimov, Paul V, Hong, Sabrina, Jones, Cody, Petukhov, Andre, Kafri, Dvir, Demura, Sean, Burkett, Brian, Gidney, Craig, Fowler, Austin G, Paler, Alexandru, Putterman, Harald, Aleiner, Igor, Arute, Frank, Arya, Kunal, Babbush, Ryan, Bardin, Joseph C, Bengtsson, Andreas, Bourassa, Alexandre, Broughton, Michael, Buckley, Bob B, Buell, David A, Bushnell, Nicholas, Chiaro, Benjamin, Collins, Roberto, Courtney, William, Derk, Alan R, Eppens, Daniel, Erickson, Catherine, Farhi, Edward, Foxen, Brooks, Giustina, Marissa, Greene, Ami, Gross, Jonathan A, Harrigan, Matthew P, Harrington, Sean D, Hilton, Jeremy, Ho, Alan, Huang, Trent, Huggins, William J, Ioffe, LB, Isakov, Sergei V, Jeffrey, Evan, Jiang, Zhang, Kechedzhi, Kostyantyn, Kim, Seon, Kitaev, Alexei, Kostritsa, Fedor, Landhuis, David, Laptev, Pavel, Lucero, Erik, Martin, Orion, McClean, Jarrod R, McCourt, Trevor, Mi, Xiao, Miao, Kevin C, Mohseni, Masoud, Montazeri, Shirin, Mruczkiewicz, Wojciech, Mutus, Josh, Naaman, Ofer, Neeley, Matthew, Neill, Charles, Newman, Michael, Niu, Murphy Yuezhen, O'Brien, Thomas E, Opremcak, Alex, Ostby, Eric, Pato, Balint, Redd, Nicholas, Roushan, Pedram, Rubin, Nicholas C, Shvarts, Vladimir, Strain, Doug, Szalay, Marco, Trevithick, Matthew D, Villalonga, Benjamin, White, Theodore, Yao, Z Jamie, Yeh, Ping, Yoo, Juhwan, Zalcman, Adam, Neven, Hartmut, Boixo, Sergio, Smelyanskiy, Vadim, Chen, Yu, Megrant, Anthony, and Kelly, Julian
Subjects: Google Quantum AI, General Science & Technology
Abstract: Realizing the potential of quantum computing requires sufficiently low logical error rates1. Many applications call for error rates as low as 10-15 (refs. 2-9), but state-of-the-art quantum platforms typically have physical error rates near 10-3 (refs. 10-14). Quantum error correction15-17 promises to bridge this divide by distributing quantum logical information across many physical qubits in such a way that errors can be detected and corrected. Errors on the encoded logical qubit state can be exponentially suppressed as the number of physical qubits grows, provided that the physical error rates are below a certain threshold and stable over the course of a computation. Here we implement one-dimensional repetition codes embedded in a two-dimensional grid of superconducting qubits that demonstrate exponential suppression of bit-flip or phase-flip errors, reducing logical error per round more than 100-fold when increasing the number of qubits from 5 to 21. Crucially, this error suppression is stable over 50 rounds of error correction. We also introduce a method for analysing error correlations with high precision, allowing us to characterize error locality while performing quantum error correction. Finally, we perform error detection with a small logical qubit using the 2D surface code on the same device18,19 and show that the results from both one- and two-dimensional codes agree with numerical simulations that use a simple depolarizing error model. These experimental demonstrations provide a foundation for building a scalable fault-tolerant quantum computer with superconducting qubits.
Published: 2021

27. Learning Non-Markovian Quantum Noise from Moir\'{e}-Enhanced Swap Spectroscopy with Deep Evolutionary Algorithm

Author: Niu, Murphy Yuezhen, Smelyanskyi, Vadim, Klimov, Paul, Boixo, Sergio, Barends, Rami, Kelly, Julian, Chen, Yu, Arya, Kunal, Burkett, Brian, Bacon, Dave, Chen, Zijun, Chiaro, Ben, Collins, Roberto, Dunsworth, Andrew, Foxen, Brooks, Fowler, Austin, Gidney, Craig, Giustina, Marissa, Graff, Rob, Huang, Trent, Jeffrey, Evan, Landhuis, David, Lucero, Erik, Megrant, Anthony, Mutus, Josh, Mi, Xiao, Naaman, Ofer, Neeley, Matthew, Neill, Charles, Quintana, Chris, Roushan, Pedram, Martinis, John M., and Neven, Hartmut
Subjects: Quantum Physics, Computer Science - Machine Learning
Abstract: Two-level-system (TLS) defects in amorphous dielectrics are a major source of noise and decoherence in solid-state qubits. Gate-dependent non-Markovian errors caused by TLS-qubit coupling are detrimental to fault-tolerant quantum computation and have not been rigorously treated in the existing literature. In this work, we derive the non-Markovian dynamics between TLS and qubits during a SWAP-like two-qubit gate and the associated average gate fidelity for frequency-tunable Transmon qubits. This gate dependent error model facilitates using qubits as sensors to simultaneously learn practical imperfections in both the qubit's environment and control waveforms. We combine the-state-of-art machine learning algorithm with Moir\'{e}-enhanced swap spectroscopy to achieve robust learning using noisy experimental data. Deep neural networks are used to represent the functional map from experimental data to TLS parameters and are trained through an evolutionary algorithm. Our method achieves the highest learning efficiency and robustness against experimental imperfections to-date, representing an important step towards in-situ quantum control optimization over environmental and control defects.
Published: 2019

28. Supplementary information for 'Quantum supremacy using a programmable superconducting processor'

Author: Arute, Frank, Arya, Kunal, Babbush, Ryan, Bacon, Dave, Bardin, Joseph C., Barends, Rami, Biswas, Rupak, Boixo, Sergio, Brandao, Fernando G. S. L., Buell, David A., Burkett, Brian, Chen, Yu, Chen, Zijun, Chiaro, Ben, Collins, Roberto, Courtney, William, Dunsworth, Andrew, Farhi, Edward, Foxen, Brooks, Fowler, Austin, Gidney, Craig, Giustina, Marissa, Graff, Rob, Guerin, Keith, Habegger, Steve, Harrigan, Matthew P., Hartmann, Michael J., Ho, Alan, Hoffmann, Markus R., Huang, Trent, Humble, Travis S., Isakov, Sergei V., Jeffrey, Evan, Jiang, Zhang, Kafri, Dvir, Kechedzhi, Kostyantyn, Kelly, Julian, Klimov, Paul V., Knysh, Sergey, Korotkov, Alexander N., Kostritsa, Fedor, Landhuis, David, Lindmark, Mike, Lucero, Erik, Lyakh, Dmitry, Mandra, Salvatore, McClean, Jarrod R., McEwen, Matt, Megrant, Anthony, Mi, Xiao, Michielsen, Kristel, Mohseni, Masoud, Mutus, Josh, Naaman, Ofer, Neeley, Matthew, Neill, Charles, Niu, Murphy Yuezhen, Ostby, Eric, Petukhov, Andre, Platt, John C., Quintana, Chris, Rieffel, Eleanor G., Roushan, Pedram, Rubin, Nicholas C., Sank, Daniel, Satzinger, Kevin J., Smelyanskiy, Vadim, Sung, Kevin J., Trevithick, Matthew D., Vainsencher, Amit, Villalonga, Benjamin, White, Theodore, Yao, Z. Jamie, Yeh, Ping, Zalcman, Adam, Neven, Hartmut, and Martinis, John M.
Subjects: Quantum Physics
Abstract: This is an updated version of supplementary information to accompany "Quantum supremacy using a programmable superconducting processor", an article published in the October 24, 2019 issue of Nature. The main article is freely available at https://www.nature.com/articles/s41586-019-1666-5. Summary of changes since arXiv:1910.11333v1 (submitted 23 Oct 2019): added URL for qFlex source code; added Erratum section; added Figure S41 comparing statistical and total uncertainty for log and linear XEB; new References [1,65]; miscellaneous updates for clarity and style consistency; miscellaneous typographical and formatting corrections., Comment: 67 pages, 51 figures
Published: 2019
Full Text: View/download PDF

29. OpenSurgery for Topological Assemblies

Author: Paler, Alexandru and Fowler, Austin G.
Subjects: Quantum Physics, Computer Science - Emerging Technologies
Abstract: Surface quantum error-correcting codes are the leading proposal for fault-tolerance within quantum computers. We present OpenSurgery, a scalable tool for the preparation of circuits protected by the surface code operated through lattice surgery. Lattice surgery is considered a resource efficient method to implement surface code computations. Resource efficiency refers to the number of physical qubits and the time necessary for executing a quantum computation. OpenSurgery is a first step towards methods that aid quantum algorithm design informed by the realities of the hardware architectures. OpenSurgery can: 1) lay out arbitrary quantum circuits, 2) estimate the quantum resources used for their execution, 3) visualise the resulting 3D topological assemblies. Source code is available at http://www.github.com/alexandrupaler/opensurgery., Comment: 4 pages including more details
Published: 2019

30. Flexible layout of surface code computations using AutoCCZ states

Author: Gidney, Craig and Fowler, Austin G.
Subjects: Quantum Physics
Abstract: We construct a self-correcting CCZ state (the "AutoCCZ") with embedded delayed choice CZs for completing gate teleportations. Using the AutoCCZ state we create efficient surface code spacetime layouts for both a depth-limited circuit (a ripply-carry addition) and a Clifford-limited circuit (a QROM read). Our layouts account for distillation and routing, are based on plausible physical assumptions for a large-scale superconducting qubit platform, and suggest that circuit-level Toffoli parallelism (e.g. using a carry-lookahead adder instead of a ripple-carry adder) will not reduce the execution time of computations involving fewer than five million physical qubits. We reduce the spacetime volume of delayed choice CZs by a factor of 4 compared to techniques from previous work (Fowler 2012), and make several improvements to the CCZ magic state factory from (Gidney 2019)., Comment: 16 pages, 18 figures
Published: 2019

31. A 28nm Bulk-CMOS 4-to-8GHz <2mW Cryogenic Pulse Modulator for Scalable Quantum Computing

Author: Bardin, Joseph C, Jeffrey, Evan, Lucero, Erik, Huang, Trent, Naaman, Ofer, Barends, Rami, White, Ted, Giustina, Marissa, Sank, Daniel, Roushan, Pedram, Arya, Kunal, Chiaro, Benjamin, Kelly, Julian, Chen, Jimmy, Burkett, Brian, Chen, Yu, Dunsworth, Andrew, Fowler, Austin, Foxen, Brooks, Gidney, Craig, Graff, Rob, Klimov, Paul, Mutus, Josh, McEwen, Matthew, Megrant, Anthony, Neeley, Matthew, Neill, Charles, Quintana, Chris, Vainsencher, Amit, Neven, Hartmut, and Martinis, John
Subjects: Quantum Physics
Abstract: Future quantum computing systems will require cryogenic integrated circuits to control and measure millions of qubits. In this paper, we report the design and characterization of a prototype cryogenic CMOS integrated circuit that has been optimized for the control of transmon qubits. The circuit has been integrated into a quantum measurement setup and its performance has been validated through multiple quantum control experiments., Comment: 13 pages, 7 figures
Published: 2019
Full Text: View/download PDF

32. Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization

Author: Kivlichan, Ian D., Gidney, Craig, Berry, Dominic W., Wiebe, Nathan, McClean, Jarrod, Sun, Wei, Jiang, Zhang, Rubin, Nicholas, Fowler, Austin, Aspuru-Guzik, Alán, Neven, Hartmut, and Babbush, Ryan
Subjects: Quantum Physics, Physics - Chemical Physics
Abstract: Recent work has deployed linear combinations of unitaries techniques to reduce the cost of fault-tolerant quantum simulations of correlated electron models. Here, we show that one can sometimes improve upon those results with optimized implementations of Trotter-Suzuki-based product formulas. We show that low-order Trotter methods perform surprisingly well when used with phase estimation to compute relative precision quantities (e.g. energies per unit cell), as is often the goal for condensed-phase systems. In this context, simulations of the Hubbard and plane-wave electronic structure models with $N < 10^5$ fermionic modes can be performed with roughly $O(1)$ and $O(N^2)$ T complexities. We perform numerics revealing tradeoffs between the error and gate complexity of a Trotter step; e.g., we show that split-operator techniques have less Trotter error than popular alternatives. By compiling to surface code fault-tolerant gates and assuming error rates of one part per thousand, we show that one can error-correct quantum simulations of interesting, classically intractable instances with a few hundred thousand physical qubits., Comment: 45 pages, 15 figures. Only difference from v3 is change to CC BY 4.0 license
Published: 2019
Full Text: View/download PDF

33. Reliable quantum circuits have defects

Author: Paler, Alexandru, Fowler, Austin G., and Wille, Robert
Subjects: Quantum Physics, Computer Science - Emerging Technologies
Abstract: State of the art quantum computing architectures are founded on the decision to use scalable but faulty quantum hardware in conjunction with an efficient error correcting code capable of tolerating high error rates. The promised effect of this decision is that the first large-scale practical quantum computer is within reach. Coming to grips with the strategy and the challenges of preparing reliable executions of an arbitrary quantum computation is not difficult. Moreover, the article explains why defects are good., Comment: preprint of the paper from XRDS
Published: 2019

34. Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation

Author: Gidney, Craig and Fowler, Austin G.
Subjects: Quantum Physics
Abstract: We present magic state factory constructions for producing $|CCZ\rangle$ states and $|T\rangle$ states. For the $|CCZ\rangle$ factory we apply the surface code lattice surgery construction techniques described by Fowler et al. to the fault-tolerant Toffoli. The resulting factory has a footprint of $12d \times 6d$ (where $d$ is the code distance) and produces one $|CCZ\rangle$ every $5.5d$ surface code cycles. Our $|T\rangle$ state factory uses the $|CCZ\rangle$ factory's output and a catalyst $|T\rangle$ state to exactly transform one $|CCZ\rangle$ state into two $|T\rangle$ states. It has a footprint 25% smaller than the factory of Fowler et al. but outputs $|T\rangle$ states twice as quickly. We show how to generalize the catalyzed transformation to arbitrary phase angles, and note that the case $\theta=22.5^\circ$ produces a particularly efficient circuit for producing $|\sqrt{T}\rangle$ states. Compared to using the $12d \times 8d \times 6.5d$ $|T\rangle$ factory of Fowler et al., our $|CCZ\rangle$ factory can quintuple the speed of algorithms that are dominated by the cost of applying Toffoli gates, including Shor's algorithm and the chemistry algorithm of Babbush et al.. Assuming a physical gate error rate of $10^{-3}$, our CCZ factory can produce $\sim 10^{10}$ states on average before an error occurs. This is sufficient for classically intractable instantiations of the chemistry algorithm, but for more demanding algorithms such as Shor's algorithm the mean number of states until failure can be increased to $\sim 10^{12}$ by increasing the factory footprint ~20%., Comment: 24 pages, 19 figures, 7 ancillary files
Published: 2018
Full Text: View/download PDF

35. Faster manipulation of large quantum circuits using wire label reference diagrams

Author: Paler, Alexandru, Fowler, Austin, and Wille, Robert
Subjects: Quantum Physics, Computer Science - Data Structures and Algorithms, Computer Science - Emerging Technologies
Abstract: Large scale quantum computing is highly anticipated, and quantum circuit design automation needs to keep up with the transition from small scale to large scale problems. Methods to support fast quantum circuit manipulations (e.g.~gate replacement, wire reordering, etc.) or specific circuit analysis operations have not been considered important and have been often implemented in a naive manner thus far. For example, quantum circuits are usually represented in term of one-dimensional gate lists or as directed acyclic graphs. Although implementations for quantum circuit manipulations are often only of polynomial complexity, the sheer number of possibilities to consider with increasing scales of quantum computations make these representations highly inefficient -- constituting a serious bottleneck. At the same time, quantum circuits have structural characteristics, which allow for more specific and faster approaches. This work utilises these characteristics by introducing a dedicated representation for large quantum circuits, namely wire label reference diagrams. We apply the representation to a set of very common circuit transformations, and develop corresponding solutions which achieve orders of magnitude performance improvements for circuits which include up to 80 000 qubits and 200 000 gates. The implementation of the proposed method is available online.
Published: 2018

36. Low overhead quantum computation using lattice surgery

Author: Fowler, Austin G. and Gidney, Craig
Subjects: Quantum Physics
Abstract: When calculating the overhead of a quantum algorithm made fault-tolerant using the surface code, many previous works have used defects and braids for logical qubit storage and state distillation. In this work, we show that lattice surgery reduces the storage overhead by over a factor of 4, and the distillation overhead by nearly a factor of 5, making it possible to run algorithms with $10^8$ T gates using only $3.7\times 10^5$ physical qubits capable of executing gates with error $p\sim 10^{-3}$. These numbers strongly suggest that defects and braids in the surface code should be deprecated in favor of lattice surgery., Comment: 15 pages, 26 figures, download source for algorithm overhead calculation spreadsheet and SketchUp 3D model of two-level state distillation. V2: Source actually contains spreadsheet and no unnecessary files. Spreadsheet and model in anc/ directory in source. V3: minor bug fixed in spreadsheet, runtimes now slightly longer. V4: minor bug fixed in logical Hadamard
Published: 2018

37. Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity

Author: Babbush, Ryan, Gidney, Craig, Berry, Dominic W., Wiebe, Nathan, McClean, Jarrod, Paler, Alexandru, Fowler, Austin, and Neven, Hartmut
Subjects: Quantum Physics, Condensed Matter - Strongly Correlated Electrons, Physics - Chemical Physics
Abstract: We construct quantum circuits which exactly encode the spectra of correlated electron models up to errors from rotation synthesis. By invoking these circuits as oracles within the recently introduced "qubitization" framework, one can use quantum phase estimation to sample states in the Hamiltonian eigenbasis with optimal query complexity $O(\lambda / \epsilon)$ where $\lambda$ is an absolute sum of Hamiltonian coefficients and $\epsilon$ is target precision. For both the Hubbard model and electronic structure Hamiltonian in a second quantized basis diagonalizing the Coulomb operator, our circuits have T gate complexity $O({N + \log (1/\epsilon}))$ where $N$ is number of orbitals in the basis. This enables sampling in the eigenbasis of electronic structure Hamiltonians with T complexity $O(N^3 /\epsilon + N^2 \log(1/\epsilon)/\epsilon)$. Compared to prior approaches, our algorithms are asymptotically more efficient in gate complexity and require fewer T gates near the classically intractable regime. Compiling to surface code fault-tolerant gates and assuming per gate error rates of one part in a thousand reveals that one can error correct phase estimation on interesting instances of these problems beyond the current capabilities of classical methods using only about a million superconducting qubits in a matter of hours., Comment: 39 pages, 25 figures, 9 tables; fixed minor errors from v1
Published: 2018
Full Text: View/download PDF

38. Synthesis of Arbitrary Quantum Circuits to Topological Assembly: Systematic, Online and Compact

Author: Paler, Alexandru, Fowler, Austin G., and Wille, Robert
Subjects: Quantum Physics
Abstract: It is challenging to transform an arbitrary quantum circuit into a form protected by surface code quantum error correcting codes (a variant of topological quantum error correction), especially if the goal is to minimise overhead. One of the issues is the efficient placement of magic state distillation sub circuits, so-called distillation boxes, in the space-time volume that abstracts the computation's required resources. This work presents a general, systematic, online method for the synthesis of such circuits. Distillation box placement is controlled by so-called schedulers. The work introduces a greedy scheduler generating compact box placements. The implemented software, whose source code is available online, is used to illustrate and discuss synthesis examples. Synthesis and optimisation improvements are proposed.
Published: 2017
Full Text: View/download PDF

39. Online Scheduled Execution of Quantum Circuits Protected by Surface Codes

Author: Paler, Alexandru, Fowler, Austin G., and Wille, Robert
Subjects: Quantum Physics
Abstract: Quantum circuits are the preferred formalism for expressing quantum information processing tasks. Quantum circuit design automation methods mostly use a waterfall approach and consider that high level circuit descriptions are hardware agnostic. This assumption has lead to a static circuit perspective: the number of quantum bits and quantum gates is determined before circuit execution and everything is considered reliable with zero probability of failure. Many different schemes for achieving reliable fault-tolerant quantum computation exist, with different schemes suitable for different architectures. A number of large experimental groups are developing architectures well suited to being protected by surface quantum error correcting codes. Such circuits could include unreliable logical elements, such as state distillation, whose failure can be determined only after their actual execution. Therefore, practical logical circuits, as envisaged by many groups, are likely to have a dynamic structure. This requires an online scheduling of their execution: one knows for sure what needs to be executed only after previous elements have finished executing. This work shows that scheduling shares similarities with place and route methods. The work also introduces the first online schedulers of quantum circuits protected by surface codes. The work also highlights scheduling efficiency by comparing the new methods with state of the art static scheduling of surface code protected fault-tolerant circuits., Comment: accepted in QIC
Published: 2017

40. A slightly smaller surface code S gate

Author: Gidney, Craig and Fowler, Austin
Subjects: Quantum Physics
Abstract: We cut the volume of surface code S gates by 25% by omitting a Hadamard gate., Comment: 3 pages, 3 figures
Published: 2017

41. Resolving catastrophic error bursts from cosmic rays in large arrays of superconducting qubits

Author: McEwen, Matt, Faoro, Lara, Arya, Kunal, Dunsworth, Andrew, Huang, Trent, Kim, Seon, Burkett, Brian, Fowler, Austin, Arute, Frank, Bardin, Joseph C., Bengtsson, Andreas, Bilmes, Alexander, Buckley, Bob B., Bushnell, Nicholas, Chen, Zijun, Collins, Roberto, Demura, Sean, Derk, Alan R., Erickson, Catherine, Giustina, Marissa, Harrington, Sean D., Hong, Sabrina, Jeffrey, Evan, Kelly, Julian, Klimov, Paul V., Kostritsa, Fedor, Laptev, Pavel, Locharla, Aditya, Mi, Xiao, Miao, Kevin C., Montazeri, Shirin, Mutus, Josh, Naaman, Ofer, Neeley, Matthew, Neill, Charles, Opremcak, Alex, Quintana, Chris, Redd, Nicholas, Roushan, Pedram, Sank, Daniel, Satzinger, Kevin J., Shvarts, Vladimir, White, Theodore, Yao, Z. Jamie, Yeh, Ping, Yoo, Juhwan, Chen, Yu, Smelyanskiy, Vadim, Martinis, John M., Neven, Hartmut, Megrant, Anthony, Ioffe, Lev, and Barends, Rami
Published: 2022
Full Text: View/download PDF

42. Surface Code Error Correction on a Defective Lattice

Author: Nagayama, Shota, Fowler, Austin G., Horsman, Dominic, Devitt, Simon J., and Van Meter, Rodney
Subjects: Quantum Physics
Abstract: The yield of physical qubits fabricated in the laboratory is much lower than that of classical transistors in production semiconductor fabrication. Actual implementations of quantum computers will be susceptible to loss in the form of physically faulty qubits. Though these physical faults must negatively affect the computation, we can deal with them by adapting error correction schemes. In this paper We have simulated statically placed single-fault lattices and lattices with randomly placed faults at functional qubit yields of 80%, 90% and 95%, showing practical performance of a defective surface code by employing actual circuit constructions and realistic errors on every gate, including identity gates. We extend Stace et al.'s superplaquettes solution against dynamic losses for the surface code to handle static losses such as physically faulty qubits. The single-fault analysis shows that a static loss at the periphery of the lattice has less negative effect than a static loss at the center. The randomly-faulty analysis shows that 95% yield is good enough to build a large scale quantum computer. The local gate error rate threshold is $\sim 0.3\%$, and a code distance of seven suppresses the residual error rate below the original error rate at $p=0.1\%$. 90% yield is also good enough when we discard badly fabricated quantum computation chips, while 80% yield does not show enough error suppression even when discarding 90% of the chips. We evaluated several metrics for predicting chip performance, and found that the average of the product of the number of data qubits and the cycle time of a stabilizer measurement of stabilizers gave the strongest correlation with post-correction residual error rates. Our analysis will help with selecting usable quantum computation chips from among the pool of all fabricated chips., Comment: 39 pages, 19 figures
Published: 2016
Full Text: View/download PDF

43. Synthesis of Arbitrary Quantum Circuits to Topological Assembly

Author: Paler, Alexandru, Devitt, Simon J., and Fowler, Austin G.
Subjects: Quantum Physics
Abstract: Given a quantum algorithm, it is highly nontrivial to devise an efficient sequence of physical gates implementing the algorithm on real hardware and incorporating topological quantum error correction. In this paper, we present a first step towards this goal, focusing on generating correct and simple arrangements of topological structures that correspond to a given quantum circuit and largely neglecting their efficiency. We detail the many challenges that will need to be tackled in the pursuit of efficiency. The software source code can be consulted at https://github.com/alexandrupaler/tqec., Comment: 24 pages, 28 figures
Published: 2016
Full Text: View/download PDF

44. Preservation of organic carbon in the Cretaceous Hue Shale on the North Slope of Alaska: Insights from pyrite morphology

Author: Song, Liaosha, Bhattacharya, Shuvajit, Webb, Zachary, Fowler, Austin, and Lee, Victoria
Published: 2021
Full Text: View/download PDF

45. Use of a PHQ-9 Heat Map to Facilitate Management Decisions in Patients with Depression.

Author: Rosas, Steven L., Deyo-Svendsen, Mark E., Taylor, Robert A., Taylor, Rachael R., Phillips, Michael R., Fowler, Austin, and Casey, Lauren
Published: 2024

46. Quantum approximate optimization of non-planar graph problems on a planar superconducting processor

Author: Harrigan, Matthew P., Sung, Kevin J., Neeley, Matthew, Satzinger, Kevin J., Arute, Frank, Arya, Kunal, Atalaya, Juan, Bardin, Joseph C., Barends, Rami, Boixo, Sergio, Broughton, Michael, Buckley, Bob B., Buell, David A., Burkett, Brian, Bushnell, Nicholas, Chen, Yu, Chen, Zijun, Ben Chiaro, Collins, Roberto, Courtney, William, Demura, Sean, Dunsworth, Andrew, Eppens, Daniel, Fowler, Austin, Foxen, Brooks, Gidney, Craig, Giustina, Marissa, Graff, Rob, Habegger, Steve, Ho, Alan, Hong, Sabrina, Huang, Trent, Ioffe, L. B., Isakov, Sergei V., Jeffrey, Evan, Jiang, Zhang, Jones, Cody, Kafri, Dvir, Kechedzhi, Kostyantyn, Kelly, Julian, Kim, Seon, Klimov, Paul V., Korotkov, Alexander N., Kostritsa, Fedor, Landhuis, David, Laptev, Pavel, Lindmark, Mike, Leib, Martin, Martin, Orion, Martinis, John M., McClean, Jarrod R., McEwen, Matt, Megrant, Anthony, Mi, Xiao, Mohseni, Masoud, Mruczkiewicz, Wojciech, Mutus, Josh, Naaman, Ofer, Neill, Charles, Neukart, Florian, Niu, Murphy Yuezhen, O’Brien, Thomas E., O’Gorman, Bryan, Ostby, Eric, Petukhov, Andre, Putterman, Harald, Quintana, Chris, Roushan, Pedram, Rubin, Nicholas C., Sank, Daniel, Skolik, Andrea, Smelyanskiy, Vadim, Strain, Doug, Streif, Michael, Szalay, Marco, Vainsencher, Amit, White, Theodore, Yao, Z. Jamie, Yeh, Ping, Zalcman, Adam, Zhou, Leo, Neven, Hartmut, Bacon, Dave, Lucero, Erik, Farhi, Edward, and Babbush, Ryan
Published: 2021
Full Text: View/download PDF

47. Practical Topological Cluster State Quantum Computing Requires Loss Below 1%

Author: Whiteside, Adam C. and Fowler, Austin G.
Subjects: Quantum Physics
Abstract: The surface code cannot be used when qubits vanish during computation; instead, a variant known as the topological cluster state is necessary. It has a gate error threshold of $0.75% and only requires nearest-neighbor interactions on a 2D array of qubits. Previous work on loss tolerance using this code only considered qubits vanishing during measurement. We begin by also including qubit loss during two-qubit gates and initialization, and then additionally consider interaction errors that occur when neighbors attempt to entangle with a qubit that isn't there. In doing so, we show that even our best case scenario requires a loss rate below 1% in order to avoid considerable space-time overhead., Comment: 12 pages, 19 figures
Published: 2014
Full Text: View/download PDF

48. Resource comparison of two surface code implementations of small angle Z rotations

Author: Mishra, Prashant and Fowler, Austin
Subjects: Quantum Physics
Abstract: Fault-tolerant Z rotations by pi/2^k are important as they arise in numerous quantum algorithms, most notably those involving quantum Fourier transforms. We describe surface code implementations of two recently described methods of efficiently constructing these rotations. One method uses state distillation to get low-error (|0> + exp(i pi/2^k)|1>)/sqrt(2) states, with each distillation level requiring 2^(k+2)-1 input states to produce a single purer output state, and uses these distilled states to directly implement pi/2^k angle Z rotations. The other method is indirect, using sequences of single-qubit Clifford and T gates. We compute and compare the overhead of our surface code implementations of these two techniques. We find that the approximating sequence overhead is less than or equal to direct distillation for k > 3 and logical error rates <~ 10^-12., Comment: 16 pages, 13 figures
Published: 2014

49. A leakage-resilient approach to fault-tolerant quantum computing with superconducting elements

Author: Ghosh, Joydip and Fowler, Austin G.
Subjects: Quantum Physics, Condensed Matter - Superconductivity
Abstract: Superconducting qubits, while promising for scalability and long coherence times, contain more than two energy levels, and therefore are susceptible to errors generated by the leakage of population outside of the computational subspace. Such leakage errors constitute a prominent roadblock towards fault-tolerant quantum computing (FTQC) with superconducting qubits. FTQC using topological codes is based on sequential measurements of multiqubit stabilizer operators. Here, we first propose a leakage-resilient procedure to perform repetitive measurements of multiqubit stabilizer operators, and then use this scheme as an ingredient to develop a leakage-resilient approach for surface code quantum error correction with superconducting circuits. Our protocol is based on swap operations between data and ancilla qubits at the end of every cycle, requiring read-out and reset operations on every physical qubit in the system, and thereby preventing persistent leakage errors from occurring., Comment: 6 pages, 6 figures. PRA version
Published: 2014
Full Text: View/download PDF

50. Scalable extraction of error models from the output of error detection circuits

Author: Fowler, Austin G., Sank, D., Kelly, J., Barends, R., and Martinis, John M.
Subjects: Quantum Physics
Abstract: Accurate methods of assessing the performance of quantum gates are extremely important. Quantum process tomography and randomized benchmarking are the current favored methods. Quantum process tomography gives detailed information, but significant approximations must be made to reduce this information to a form quantum error correction simulations can use. Randomized benchmarking typically outputs just a single number, the fidelity, giving no information on the structure of errors during the gate. Neither method is optimized to assess gate performance within an error detection circuit, where gates will be actually used in a large-scale quantum computer. Specifically, the important issues of error composition and error propagation lie outside the scope of both methods. We present a fast, simple, and scalable method of obtaining exactly the information required to perform effective quantum error correction from the output of continuously running error detection circuits, enabling accurate prediction of large-scale behavior., Comment: 9 pages, 6 figures, comments and additional reference suggestions welcome
Published: 2014

Catalog

Books, media, physical & digital resources

See catalog results

Searchworks

Select search scope, currently: Articles Catalog books, media & more in Jio Institute collections Articles journal articles & other e-resources

Search

Search Constraints

Refine your results

Search Limiters

Topic

Publication Year Range

Language

Publication Type

Journal

Database

Publisher

300 results on '"Fowler, Austin"'

Search Results

Catalog

Select search scope, currently: Articles

Catalog

books, media & more in Jio Institute collections

Articles

journal articles & other e-resources