.png){kind=icon}
Return
Hardware-efficient variational quantum algorithms for time evolution
.png){kind=icon}
OA
AI
DOI：10.1103/PhysRevResearch.3.033083.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
MATRIX PRODUCT STATES
SYSTEMS
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.2
Papers:
7.6K
Citations:
2.7W
Organization
No organization information available
Cited Papers
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSaveMatrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems.png)
ADVANCES IN PHYSICS
OAAI
ADVANCES IN PHYSICSIF13.8
OAAIShareSaveHardware efficient quantum algorithms for vibrational structure calculationsCHEMICAL SCIENCEOAAI
CHEMICAL SCIENCEIF7.4
OAAIShareSave
View more