Program
Full Program | Thursday | Friday | Saturday | All Sessions | Posters | Talks
SESSION 10: Near-term devices and applicationsChair: (Michael Nielsen (Y Combinator Research)) | |
| 8:30am-9:15am | Dave Bacon, Google The exciting and scary world of near term quantum computers | Abstract. Quantum computing technology is entering a new era with multiple technologies set to build O(100) qubit devices with gate and measurement fidelities from two to three nines. These devices can, for artificial problems, thwart direct classical simulation (exciting!) but whether they can solve problems that are of practical importance is yet to be seen (scary!). In this talk I will discuss the challenges of these near term devices from the perspective of the Google's xmon superconducting qubit computers. Interesting challenges in computer architectures and programming languages emerge for these devices. I'll then discuss the prospects for different near term algorithms on these devices, attempting to inspire your brain to come up with new quantum algorithms for near term quantum computers. |
| 9:15am-9:45am | Zhihui Wang, NASA - Ames Research Center Investigations of the quantum alternating operator ansatz or optimization problems with constraints | Abstract. The emerging prototype universal quantum processors enables implementation of a wider variety of algorithms. Of particular interest are quantum heuristics, which have the potential to significantly expand the breadth of quantum computing applications. Here, we investigate the Quantum Alternating Operator Ansatz [1], an extension of the framework defined by Farhi et al. [2], that supports optimization problems with constraints and more efficient implementations. We present both theoretical and empirical results that demonstrate that choosing mixing unitaries that maintain the quantum evolution in the feasible subspace achieves better performance than adding penalties to a cost function to enforce the constraints. We discuss design criteria for mixing operators [1], mappings of a variety of specific problems [1], and compilations to near-term hardware [3]. [1] Stuart Hadfield, Zhihui Wang, Bryan O'Gorman, Eleanor G. Rieffel, Davide Venturelli, Rupak Biswas, From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz, arXiv:1709.03489 [2] Edward Farhi, Jeffrey Goldstone, and Sam Gutmann. A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem. arXiv:1412.6062 [3] Davide Venturelli, Minh Do, Eleanor G. Rieffel, Jeremy Frank, Compiling Quantum Circuits to Realistic Hardware Architectures using Temporal Planners, arXiv:1705.08927 |
- Home
- SQuInT
- Past SQuInT Meetings
- Lodging and Transportation
- Hotel Floor Maps (.pdf)
- Registration
- Submit Your Abstract
- Program
- Instructions for Presenters
SQuInT Chief Organizer
Akimasa Miyake, Assistant Professor
amiyake@unm.edu
SQuInT Co-Organizer
Mark M. Wilde, Assistant Professor LSU
mwilde@phys.lsu.edu
SQuInT Administrator
Gloria Cordova
gjcordo1@unm.edu
505 277-1850
SQuInT Founder
Ivan Deutsch, Regents' Professor
ideutsch@unm.edu
