APS Logo

Quantum Simulation I: Speedups, Improvements, and Beyond

FOCUS · D64 · ID: 1112644

Presentations

  • Efficient calculation of nuclear forces on noisy intermediate-scale quantum computers

    ORAL

    –

    Publication: https://arxiv.org/abs/2111.12437

    Presenters

    • Michael Streif

      Boehringer Ingelheim

    Authors

    • Michael Streif

      Boehringer Ingelheim

    • Thomas E O'Brien

      Google LLC

    • Nicholas C Rubin

      Google

    • Raffaele Santagati

      Boehringer-Ingelheim Quantum Lab

    • Yuan Su

      Microsoft Quantum, Google Research, Google

    • William J Huggins

      Google, Google Quantum AI

    • Joshua Goings

      IonQ, Inc, IonQ, Google

    • Nikolaj Moll

      Boehringer Ingelheim

    • Elica Kyoseva

      Boehringer Ingelheim, Boehringer-Ingelheim

    • Matthias Degroote

      Boehringer Ingelheim, Boehringer-Ingelheim

    • Christofer Tautermann

      Boehringer Ingelheim, Boehringer Ingelheim Pharma Inc., Boehringer-Ingelheim

    • Joonho Lee

      Columbia University

    • Dominic W Berry

      Macquarie University

    • Nathan Wiebe

      University of Toronto, Pacific Northwest National Laboratory, University of Toronto, Pacific Northwest Natl Lab

    • Ryan Babbush

      Google

    View abstract →

  • Quantum Speedups for Computing Expectation Values and Partition Functions

    ORAL · Invited

    –

    Publication: A Sublinear-Time Quantum Algorithm for Approximating Partition Functions.<br>Near-Optimal Quantum Algorithms for Multivariate Mean Estimation.<br>Quantum Sub-Gaussian Mean Estimator.<br>Quantum Chebyshev's Inequality and Applications.

    Presenters

    • Yassine Hamoudi

      UC Berkeley

    Authors

    • Yassine Hamoudi

      UC Berkeley

    View abstract →

  • Perturbation theory with quantum signal processing

    ORAL

    –

    Publication: arXiv:2210.00718<br>

    Presenters

    • Kosuke Mitarai

      QIQB, Osaka University; Osaka University; JST PRESTO, Osaka University, QIQB, JST PRESTO, Osaka University, osaka university graduate school of engineering science

    Authors

    • Kosuke Mitarai

      QIQB, Osaka University; Osaka University; JST PRESTO, Osaka University, QIQB, JST PRESTO, Osaka University, osaka university graduate school of engineering science

    • Wataru Mizukami

      Center for Quantum Information and Quantum Biology, Osaka University, Osaka University

    View abstract →

  • Variational optimization of PREPARE circuit for block-encoding Hamiltonians without ancillary qubits

    ORAL

    –

    Publication: ·Babbush, R., Gidney, C., Berry, D. W., Wiebe, N., McClean, J., Paler, A., Fowler, A. and Neven, H.: En- coding Electronic Spectra in Quantum Circuits with Linear T Complexity, Phys. Rev. X, Vol. 8, p. 041015 (online), DOI: 10.1103/PhysRevX.8.041015 (2018).<br>·Shirakawa, T., Ueda, H. and Yunoki, S.: Automatic quantum circuit encoding of a given arbitrary quan- tum state, arXiv preprint arXiv:2112.14524 (2021).<br>·Vatan, F. and Williams, C.: Optimal quantum cir- cuits for general two-qubit gates, Physical Review A, Vol. 69, No. 3, p. 032315 (2004).<br>·Ross, N. J. and Selinger, P.: Optimal ancilla-free Clif- ford+ T approximation of z-rotations, arXiv preprint arXiv:1403.2975 (2014).<br>·Araujo, I.F., Park, D.K., Petruccione, F. et al. A divide-and-conquer algorithm for quantum state preparation. Sci Rep 11, 6329 (2021).

    Presenters

    • Hayata Morisaki

      QunaSys Inc.

    Authors

    • Hayata Morisaki

      QunaSys Inc.

    • Keisuke Fujii

      QIQB, Osaka University; Osaka University; RIKEN Center for Quantum Computing, Osaka University/ RIKEN RQC, Osaka University, QIQB, RIKEN, Osaka University, osaka university graduate school of engineering science

    • Kosuke Mitarai

      QIQB, Osaka University; Osaka University; JST PRESTO, Osaka University, QIQB, JST PRESTO, Osaka University, osaka university graduate school of engineering science

    • Yuya O Nakagawa

      QunaSys Inc.

    View abstract →