Zobrazeno 1 - 10
of 666
pro vyhledávání: '"G S L"'
Autor:
Hann, Connor T., Noh, Kyungjoo, Putterman, Harald, Matheny, Matthew H., Iverson, Joseph K., Fang, Michael T., Chamberland, Christopher, Painter, Oskar, Brandão, Fernando G. S. L.
Dissipative cat qubits are a promising physical platform for quantum computing, since their large noise bias can enable more hardware-efficient quantum error correction. In this work we theoretically study the long-term prospects of a hybrid cat-tran
Externí odkaz:
http://arxiv.org/abs/2410.23363
Autor:
Putterman, Harald, Noh, Kyungjoo, Patel, Rishi N., Peairs, Gregory A., MacCabe, Gregory S., Lee, Menyoung, Aghaeimeibodi, Shahriar, Hann, Connor T., Jarrige, Ignace, Marcaud, Guillaume, He, Yuan, Moradinejad, Hesam, Owens, John Clai, Scaffidi, Thomas, Arrangoiz-Arriola, Patricio, Iverson, Joe, Levine, Harry, Brandão, Fernando G. S. L., Matheny, Matthew H., Painter, Oskar
Cat qubits, a type of bosonic qubit encoded in a harmonic oscillator, can exhibit an exponential noise bias against bit-flip errors with increasing mean photon number. Here, we focus on cat qubits stabilized by two-photon dissipation, where pairs of
Externí odkaz:
http://arxiv.org/abs/2409.17556
Autor:
Putterman, Harald, Noh, Kyungjoo, Hann, Connor T., MacCabe, Gregory S., Aghaeimeibodi, Shahriar, Patel, Rishi N., Lee, Menyoung, Jones, William M., Moradinejad, Hesam, Rodriguez, Roberto, Mahuli, Neha, Rose, Jefferson, Owens, John Clai, Levine, Harry, Rosenfeld, Emma, Reinhold, Philip, Moncelsi, Lorenzo, Alcid, Joshua Ari, Alidoust, Nasser, Arrangoiz-Arriola, Patricio, Barnett, James, Bienias, Przemyslaw, Carson, Hugh A., Chen, Cliff, Chen, Li, Chinkezian, Harutiun, Chisholm, Eric M., Chou, Ming-Han, Clerk, Aashish, Clifford, Andrew, Cosmic, R., Curiel, Ana Valdes, Davis, Erik, DeLorenzo, Laura, D'Ewart, J. Mitchell, Diky, Art, D'Souza, Nathan, Dumitrescu, Philipp T., Eisenmann, Shmuel, Elkhouly, Essam, Evenbly, Glen, Fang, Michael T., Fang, Yawen, Fling, Matthew J., Fon, Warren, Garcia, Gabriel, Gorshkov, Alexey V., Grant, Julia A., Gray, Mason J., Grimberg, Sebastian, Grimsmo, Arne L., Haim, Arbel, Hand, Justin, He, Yuan, Hernandez, Mike, Hover, David, Hung, Jimmy S. C., Hunt, Matthew, Iverson, Joe, Jarrige, Ignace, Jaskula, Jean-Christophe, Jiang, Liang, Kalaee, Mahmoud, Karabalin, Rassul, Karalekas, Peter J., Keller, Andrew J., Khalajhedayati, Amirhossein, Kubica, Aleksander, Lee, Hanho, Leroux, Catherine, Lieu, Simon, Ly, Victor, Madrigal, Keven Villegas, Marcaud, Guillaume, McCabe, Gavin, Miles, Cody, Milsted, Ashley, Minguzzi, Joaquin, Mishra, Anurag, Mukherjee, Biswaroop, Naghiloo, Mahdi, Oblepias, Eric, Ortuno, Gerson, Pagdilao, Jason, Pancotti, Nicola, Panduro, Ashley, Paquette, JP, Park, Minje, Peairs, Gregory A., Perello, David, Peterson, Eric C., Ponte, Sophia, Preskill, John, Qiao, Johnson, Refael, Gil, Resnick, Rachel, Retzker, Alex, Reyna, Omar A., Runyan, Marc, Ryan, Colm A., Sahmoud, Abdulrahman, Sanchez, Ernesto, Sanil, Rohan, Sankar, Krishanu, Sato, Yuki, Scaffidi, Thomas, Siavoshi, Salome, Sivarajah, Prasahnt, Skogland, Trenton, Su, Chun-Ju, Swenson, Loren J., Teo, Stephanie M., Tomada, Astrid, Torlai, Giacomo, Wollack, E. Alex, Ye, Yufeng, Zerrudo, Jessica A., Zhang, Kailing, Brandão, Fernando G. S. L., Matheny, Matthew H., Painter, Oskar
In order to solve problems of practical importance, quantum computers will likely need to incorporate quantum error correction, where a logical qubit is redundantly encoded in many noisy physical qubits. The large physical-qubit overhead typically as
Externí odkaz:
http://arxiv.org/abs/2409.13025
Autor:
Chen, Chi-Fang, Bouland, Adam, Brandão, Fernando G. S. L., Docter, Jordan, Hayden, Patrick, Xu, Michelle
In this work we give an efficient construction of unitary $k$-designs using $\tilde{O}(k\cdot poly(n))$ quantum gates, as well as an efficient construction of a parallel-secure pseudorandom unitary (PRU). Both results are obtained by giving an effici
Externí odkaz:
http://arxiv.org/abs/2404.16751
Autor:
Dalzell, Alexander M., McArdle, Sam, Berta, Mario, Bienias, Przemyslaw, Chen, Chi-Fang, Gilyén, András, Hann, Connor T., Kastoryano, Michael J., Khabiboulline, Emil T., Kubica, Aleksander, Salton, Grant, Wang, Samson, Brandão, Fernando G. S. L.
The anticipated applications of quantum computers span across science and industry, ranging from quantum chemistry and many-body physics to optimization, finance, and machine learning. Proposed quantum solutions in these areas typically combine multi
Externí odkaz:
http://arxiv.org/abs/2310.03011
Autor:
Levine, Harry, Haim, Arbel, Hung, Jimmy S. C., Alidoust, Nasser, Kalaee, Mahmoud, DeLorenzo, Laura, Wollack, E. Alex, Arrangoiz-Arriola, Patricio, Khalajhedayati, Amirhossein, Sanil, Rohan, Moradinejad, Hesam, Vaknin, Yotam, Kubica, Aleksander, Hover, David, Aghaeimeibodi, Shahriar, Alcid, Joshua Ari, Baek, Christopher, Barnett, James, Bawdekar, Kaustubh, Bienias, Przemyslaw, Carson, Hugh, Chen, Cliff, Chen, Li, Chinkezian, Harut, Chisholm, Eric M., Clifford, Andrew, Cosmic, R., Crisosto, Nicole, Dalzell, Alexander M., Davis, Erik, D'Ewart, J. Mitch, Diez, Sandra, D'Souza, Nathan, Dumitrescu, Philipp T., Elkhouly, Essam, Fang, Michael, Fang, Yawen, Flammia, Steven T., Fling, Matthew J., Garcia, Gabriel, Gharzai, M. Kabeer, Gorshkov, Alexey V., Gray, Mason J., Grimberg, Sebastian, Grimsmo, Arne L., Hann, Connor T., He, Yuan, Heidel, Steven, Howell, Sean, Hunt, Matthew, Iverson, Joseph K., Jarrige, Ignace, Jiang, Liang, Jones, William M., Karabalin, Rassul, Karalekas, Peter J., Keller, Andrew J., Lasi, Davide, Lee, Menyoung, Ly, Victor, MacCabe, Gregory S., Mahuli, Neha, Marcaud, Guillaume, Matheny, Matthew H., McArdle, Sam, McCabe, Gavin, Merton, Gabe, Miles, Cody, Milsted, Ashley, Mishra, Anurag, Moncelsi, Lorenzo, Naghiloo, Mahdi, Noh, Kyungjoo, Oblepias, Eric, Ortuno, Gerson, Owens, John Clai, Pagdilao, Jason, Panduro, Ashley, Paquette, J. -P., Patel, Rishi N., Peairs, Gregory A., Perello, David J., Peterson, Eric C., Ponte, Sophia, Putterman, Harald, Refael, Gil, Reinhold, Philip, Resnick, Rachel, Reyna, Omar A., Rodriguez, Roberto, Rose, Jefferson, Rubin, Alex H., Runyan, Marc, Ryan, Colm A., Sahmoud, Abdulrahman, Scaffidi, Thomas, Shah, Bhavik, Siavoshi, Salome, Sivarajah, Prasahnt, Skogland, Trenton, Su, Chun-Ju, Swenson, Loren J., Sylvia, Jared, Teo, Stephanie M., Tomada, Astrid, Torlai, Giacomo, Wistrom, Mark, Zhang, Kailing, Zuk, Ido, Clerk, Aashish A., Brandão, Fernando G. S. L., Retzker, Alex, Painter, Oskar
Publikováno v:
Physical Review X 14, 011051 (2024)
Quantum error correction with erasure qubits promises significant advantages over standard error correction due to favorable thresholds for erasure errors. To realize this advantage in practice requires a qubit for which nearly all errors are such er
Externí odkaz:
http://arxiv.org/abs/2307.08737
Preparing ground states and thermal states is essential for simulating quantum systems on quantum computers. Despite the hope for practical quantum advantage in quantum simulation, popular state preparation approaches have been challenged. Monte Carl
Externí odkaz:
http://arxiv.org/abs/2303.18224
Autor:
Chi-Fang, Chen, Dalzell, Alexander M., Berta, Mario, Brandão, Fernando G. S. L., Tropp, Joel A.
A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. For this task, there is a well-studied quantum algorithm that performs quantum phase estimation on an initial trial state that has a nonne
Externí odkaz:
http://arxiv.org/abs/2302.03394
We present a quantum algorithm that has rigorous runtime guarantees for several families of binary optimization problems, including Quadratic Unconstrained Binary Optimization (QUBO), Ising spin glasses ($p$-spin model), and $k$-local constraint sati
Externí odkaz:
http://arxiv.org/abs/2212.01513
Autor:
Dalzell, Alexander M., Clader, B. David, Salton, Grant, Berta, Mario, Lin, Cedric Yen-Yu, Bader, David A., Stamatopoulos, Nikitas, Schuetz, Martin J. A., Brandão, Fernando G. S. L., Katzgraber, Helmut G., Zeng, William J.
Publikováno v:
PRX Quantum 4, 040325 (2023)
We study quantum interior point methods (QIPMs) for second-order cone programming (SOCP), guided by the example use case of portfolio optimization (PO). We provide a complete quantum circuit-level description of the algorithm from problem input to pr
Externí odkaz:
http://arxiv.org/abs/2211.12489