E
E. Lucero
Researcher at Google
Publications - 38
Citations - 6828
E. Lucero is an academic researcher from Google. The author has contributed to research in topics: Qubit & Quantum computer. The author has an hindex of 24, co-authored 38 publications receiving 5538 citations. Previous affiliations of E. Lucero include University of California, Santa Barbara.
Papers
More filters
Journal ArticleDOI
Quantum supremacy using a programmable superconducting processor
Frank Arute,Kunal Arya,Ryan Babbush,Dave Bacon,Joseph C. Bardin,Joseph C. Bardin,Rami Barends,Rupak Biswas,Sergio Boixo,Fernando G. S. L. Brandão,Fernando G. S. L. Brandão,David A. Buell,B. Burkett,Yu Chen,Zijun Chen,Ben Chiaro,Roberto Collins,William Courtney,Andrew Dunsworth,Edward Farhi,Brooks Foxen,Brooks Foxen,Austin G. Fowler,Craig Gidney,Marissa Giustina,R. Graff,Keith Guerin,Steve Habegger,Matthew P. Harrigan,Michael J. Hartmann,Michael J. Hartmann,Alan Ho,Markus R. Hoffmann,Trent Huang,Travis S. Humble,Sergei V. Isakov,Evan Jeffrey,Zhang Jiang,Dvir Kafri,Kostyantyn Kechedzhi,Julian Kelly,Paul V. Klimov,Sergey Knysh,Alexander N. Korotkov,Alexander N. Korotkov,Fedor Kostritsa,David Landhuis,Mike Lindmark,E. Lucero,Dmitry I. Lyakh,Salvatore Mandrà,Jarrod R. McClean,Matt McEwen,Anthony Megrant,Xiao Mi,Kristel Michielsen,Kristel Michielsen,Masoud Mohseni,Josh Mutus,Ofer Naaman,Matthew Neeley,Charles Neill,Murphy Yuezhen Niu,Eric Ostby,Andre Petukhov,John Platt,Chris Quintana,Eleanor Rieffel,Pedram Roushan,Nicholas C. Rubin,Daniel Sank,Kevin J. Satzinger,Vadim Smelyanskiy,Kevin J. Sung,Kevin J. Sung,Matthew D. Trevithick,Amit Vainsencher,Benjamin Villalonga,Benjamin Villalonga,Theodore White,Z. Jamie Yao,Ping Yeh,Adam Zalcman,Hartmut Neven,John M. Martinis,John M. Martinis +85 more
TL;DR: Quantum supremacy is demonstrated using a programmable superconducting processor known as Sycamore, taking approximately 200 seconds to sample one instance of a quantum circuit a million times, which would take a state-of-the-art supercomputer around ten thousand years to compute.
Journal ArticleDOI
Spectroscopic signatures of localization with interacting photons in superconducting qubits
Pedram Roushan,Charles Neill,Jirawat Tangpanitanon,Victor M. Bastidas,Anthony Megrant,Rami Barends,Yu Chen,Zijun Chen,Benjamin Chiaro,Andrew Dunsworth,Austin G. Fowler,Brooks Foxen,Marissa Giustina,Evan Jeffrey,Julian Kelly,E. Lucero,Josh Mutus,Matthew Neeley,Chris Quintana,Daniel Sank,Amit Vainsencher,James Wenner,Ted White,Hartmut Neven,Dimitris G. Angelakis,Dimitris G. Angelakis,John M. Martinis,John M. Martinis +27 more
TL;DR: This work introduces a many-body spectroscopy technique based on a chain of superconducting qubits to study quantum phases of matter and introduces disorder to study the statistics of the energy levels of the system as it undergoes the transition from a thermalized to a localized phase.
Journal ArticleDOI
A blueprint for demonstrating quantum supremacy with superconducting qubits.
Charles Neill,Pedram Roushan,Kostyantyn Kechedzhi,Kostyantyn Kechedzhi,Sergio Boixo,Sergei V. Isakov,Vadim Smelyanskiy,Anthony Megrant,Benjamin Chiaro,Andrew Dunsworth,Kunal Arya,Rami Barends,B. Burkett,Yu Chen,Zijun Chen,Austin G. Fowler,Brooks Foxen,Marissa Giustina,R. Graff,Evan Jeffrey,Trent Huang,Julian Kelly,Paul V. Klimov,E. Lucero,Josh Mutus,Matthew Neeley,Chris Quintana,Daniel Sank,Amit Vainsencher,James Wenner,Ted White,Hartmut Neven,John M. Martinis,John M. Martinis +33 more
TL;DR: Nine superconducting qubits are used to demonstrate a promising path toward quantum supremacy and the scaling of errors and output with the number of qubits is explored in a five- to nine-qubit device.
Journal ArticleDOI
Quantum approximate optimization of non-planar graph problems on a planar superconducting processor
Matthew P. Harrigan,Kevin J. Sung,Kevin J. Sung,Matthew Neeley,Kevin J. Satzinger,Frank Arute,Kunal Arya,Juan Atalaya,Joseph C. Bardin,Joseph C. Bardin,Rami Barends,Sergio Boixo,Michael Broughton,Bob B. Buckley,David A. Buell,B. Burkett,Nicholas Bushnell,Yu Chen,Zijun Chen,Ben Chiaro,Ben Chiaro,Roberto Collins,William Courtney,Sean Demura,Andrew Dunsworth,Daniel Eppens,Austin G. Fowler,Brooks Foxen,Craig Gidney,Marissa Giustina,R. Graff,Steve Habegger,Alan Ho,Sabrina Hong,Trent Huang,Lev Ioffe,Sergei V. Isakov,Evan Jeffrey,Zhang Jiang,Cody Jones,Dvir Kafri,Kostyantyn Kechedzhi,Julian Kelly,Seon Kim,Paul V. Klimov,Alexander N. Korotkov,Alexander N. Korotkov,Fedor Kostritsa,David Landhuis,Pavel Laptev,Mike Lindmark,Martin Leib,Orion Martin,John M. Martinis,John M. Martinis,Jarrod R. McClean,Matt McEwen,Matt McEwen,Anthony Megrant,Xiao Mi,Masoud Mohseni,Wojciech Mruczkiewicz,Josh Mutus,Ofer Naaman,Charles Neill,Florian Neukart,Murphy Yuezhen Niu,Thomas E. O'Brien,Bryan O'Gorman,Bryan O'Gorman,Eric Ostby,Andre Petukhov,Harald Putterman,Chris Quintana,Pedram Roushan,Nicholas C. Rubin,Daniel Sank,Andrea Skolik,Andrea Skolik,Vadim Smelyanskiy,Doug Strain,Michael Streif,Michael Streif,Marco Szalay,Amit Vainsencher,Theodore White,Z. Jamie Yao,Ping Yeh,Adam Zalcman,Leo Zhou,Leo Zhou,Hartmut Neven,Dave Bacon,E. Lucero,Edward Farhi,Ryan Babbush +95 more
TL;DR: The application of the Google Sycamore superconducting qubit quantum processor to combinatorial optimization problems with the quantum approximate optimization algorithm (QAOA) is demonstrated and an approximation ratio is obtained that is independent of problem size and for the first time, that performance increases with circuit depth.
Journal ArticleDOI
Digitized adiabatic quantum computing with a superconducting circuit
Rami Barends,Alireza Shabani,Lucas Lamata,Julian Kelly,Antonio Mezzacapo,U. Las Heras,Ryan Babbush,Austin G. Fowler,Brooks Campbell,Yu Chen,Zijun Chen,Benjamin Chiaro,Andrew Dunsworth,Evan Jeffrey,E. Lucero,A. Megrant,Josh Mutus,Matthew Neeley,Charles Neill,Peter O'Malley,Chris Quintana,Pedram Roushan,Daniel Sank,Amit Vainsencher,James Wenner,Ted White,Enrique Solano,Enrique Solano,Hartmut Neven,John M. Martinis,John M. Martinis +30 more
TL;DR: In this article, a digital quantum simulation of the adiabatic algorithm is presented, which consists of up to nine qubits and up to 1,000 quantum logic gates and can solve random instances of the one-dimensional Ising problem as well as problem Hamiltonians that involve more complex interactions.