Litcius/Paper detail

Hardware-efficient variational quantum algorithms for time evolution

Marcello Benedetti, Mattia Fiorentini, Michael Lubasch

2021Physical Review Research156 citationsDOIOpen Access PDF

Abstract

Parameterized quantum circuits are a promising technology for achieving a quantum advantage. An important application is the variational simulation of time evolution of quantum systems. To make the most of quantum hardware, variational algorithms need to be as hardware-efficient as possible. Here we present alternatives to the time-dependent variational principle that are hardware-efficient and do not require matrix inversion. In relation to imaginary time evolution, our approach significantly reduces the hardware requirements. With regards to real time evolution, where high precision can be important, we present algorithms of systematically increasing accuracy and hardware requirements. We numerically analyze the performance of our algorithms using quantum Hamiltonians with local interactions.

Topics & Concepts

Quantum algorithmParameterized complexityQuantumQuantum phase estimation algorithmAlgorithmImaginary timeComputer scienceQuantum computerQuantum sortQuantum circuitRelation (database)MathematicsQuantum systemQuantum operationQuantum simulatorTime evolutionOpen quantum systemMatrix (chemical analysis)Quantum processVariational methodQuantum error correctionQuantum dynamicsQuantum stateComponent (thermodynamics)Quantum Fourier transformQuantum networkHamiltonian (control theory)Quantum gateAdiabatic quantum computationQuantum Computing Algorithms and ArchitectureQuantum many-body systemsQuantum Information and Cryptography
Hardware-efficient variational quantum algorithms for time evolution | Litcius