Efficient Convex Unitary Decompositions for Quantum Simulation

ORAL

Abstract

Current quantum approaches to simulating quantum systems are still practically challenging on NISQ-era devices, because they often require extensive gate sequences and/or many ancilla qubits. We propose a hybrid quantum-classical approach to problems in quantum simulation, which we demonstrate for both standard Hamiltonian simulation and open quantum systems. Our approach generates a novel decomposition of unitary operators, which can be efficiently implemented on a quantum computer. The resulting scheme allows for resource tradeoffs between circuit depth and sample complexity, enabling near-term applications.

*This work is supported by an NSF CAREER Award under Grant No. NSF-ECCS-1944085 and the NSF CNS program under Grant No. 2247007.

–

Presenters

  • Joseph Peetz

    • Department of Physics and Astronomy, University of California, Los Angeles (UCLA), CA, USA.
    • College of Letters and Science, University of California, Los Angeles (UCLA), CA, USA.

Authors

  • Joseph Peetz

    • Department of Physics and Astronomy, University of California, Los Angeles (UCLA), CA, USA.
    • College of Letters and Science, University of California, Los Angeles (UCLA), CA, USA.

  • Scott E Smart

    • College of Letters and Science, University of California, Los Angeles (UCLA), CA, USA.
    • University of California Los Angeles

  • Prineha Narang

    • College of Letters and Science, University of California, Los Angeles (UCLA), CA, USA.
    • University of California Los Angeles
    • College of Letters and Science, University of California, Los Angeles (UCLA)
    • UCLA
    • University of California, Los Angeles
    • College of Letters and Science, University of California, Los Angeles
    • Harvard University