Bulletin of the American Physical Society
APS March Meeting 2017
Volume 62, Number 4
Monday–Friday, March 13–17, 2017; New Orleans, Louisiana
Session A19: Near Term Applications of Small-scale Quantum ComputingInvited
|
Hide Abstracts |
Sponsoring Units: GQI Chair: Sabre Kais Room: 278-279 |
Monday, March 13, 2017 8:00AM - 8:36AM |
A19.00001: Quantum Supremacy: Checking A Quantum Computer With A Classical Supercomputer Invited Speaker: John Martinis {A key step in the roadmap to build a scientifically or commercially useful quantum computer will be to demonstrate its exponentially growing computing power. I will explain how a 7 by 7 array of superconducting xmon qubits with nearest-neighbor coupling, and with programmable single- and two-qubit gate with errors of about 0.1{\%}, can execute a modest depth quantum computation that fully entangles the 49 qubits. Sampling of the resulting output can be checked against a classical simulation to demonstrate proper operation of the quantum computer and compare its system error rate with predictions. With a computation space of 2\textasciicircum 49 }= \sout{\textsc{ 5.6 x 10\textasciicircum 14 states, the quantum computation can only be checked using the biggest supercomputers. With modest improvements in qubit performance, we plan to demonstrate this experiment in 2017.}} [Preview Abstract] |
Monday, March 13, 2017 8:36AM - 9:12AM |
A19.00002: Designing, programming, and optimizing a (small) quantum computer Invited Speaker: Krysta Svore In 1982, Richard Feynman proposed to use a computer founded on the laws of quantum physics to simulate physical systems. In the more than thirty years since, quantum computers have shown promise to solve problems in number theory, chemistry, and materials science that would otherwise take longer than the lifetime of the universe to solve on an exascale classical machine. The practical realization of a quantum computer requires understanding and manipulating subtle quantum states while experimentally controlling quantum interference. It also requires an end-to-end software architecture for programming, optimizing, and implementing a quantum algorithm on the quantum device hardware. In this talk, we will introduce recent advances in connecting abstract theory to present-day real-world applications through software. We will highlight recent advancement of quantum algorithms and the challenges in ultimately performing a scalable solution on a quantum device. [Preview Abstract] |
Monday, March 13, 2017 9:12AM - 9:48AM |
A19.00003: Quantum Machine Learning and Quantum Computing for Chemistry Invited Speaker: Alan Aspuru-Guzik In this talk, I will discuss the recent progress of my research group in quantum computing for quantum chemistry as well as new developments on quantum machine learning. [Preview Abstract] |
Monday, March 13, 2017 9:48AM - 10:24AM |
A19.00004: Quantum supremacy through the quantum approximate optimization algorithm Invited Speaker: Eddie Farhi |
Monday, March 13, 2017 10:24AM - 11:00AM |
A19.00005: Characterizing Beyond-Classical Computation in Near-Term Devices Invited Speaker: Sergio Boixo A critical question for the field of quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities of state-of-the-art classical computers, achieving beyond-classical computation. We study the computational task of sampling from the output distribution of random quantum circuits. We introduce the cross entropy difference as a useful benchmark of random quantum circuits which approximates the circuit fidelity. We show that the cross entropy can be efficiently measured when circuit simulations are available. Beyond the classically tractable regime, the cross entropy can be extrapolated and compared with theoretical estimates to define a practical demonstration. We study the computational cost of several classical algorithms, and compare with the estimated fidelity for state-of-the-art superconducting qubits. We conclude that beyond-classical computation can be achieved in the near-term with approximately fifty qubits. [Preview Abstract] |
Follow Us |
Engage
Become an APS Member |
My APS
Renew Membership |
Information for |
About APSThe American Physical Society (APS) is a non-profit membership organization working to advance the knowledge of physics. |
© 2024 American Physical Society
| All rights reserved | Terms of Use
| Contact Us
Headquarters
1 Physics Ellipse, College Park, MD 20740-3844
(301) 209-3200
Editorial Office
100 Motor Pkwy, Suite 110, Hauppauge, NY 11788
(631) 591-4000
Office of Public Affairs
529 14th St NW, Suite 1050, Washington, D.C. 20045-2001
(202) 662-8700