Abstract
AbstractQuantum algorithms and simulations often require the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of required gates grows exponentially with the number of qubits, becoming unfeasible on near-term quantum devices. Here, we aim at creating an approximate encoding of the target state using a limited number of gates. As a first step, we consider a quantum state that is efficiently represented classically, such as a one-dimensional matrix product state. Using tensor network techniques, we develop and implement an efficient optimization algorithm that approaches the optimal implementation, requiring a polynomial number of iterations. We, next, consider the implementation of the proposed optimization algorithm directly on a quantum computer and overcome inherent barren plateaus by employing a local cost function. Our work offers a universal method to prepare target states using local gates and represents a significant improvement over known strategies.
Funder
Israel Science Foundation
Publisher
Springer Science and Business Media LLC
Reference71 articles.
1. Duan, B., Yuan, J., Yu, C.-H., Huang, J. & Hsieh, C.-Y. A survey on hhl algorithm: from theory to application in quantum machine learning. Phys. Lett. A 384, 126595 (2020).
2. Schuld, M. & Petruccione, F. Supervised Learning with Quantum Computers, 139–171 (Springer, 2018).
3. Leymann, F. & Barzen, J. The bitter truth about gate-based quantum algorithms in the nisq era. Quant. Sci. Technol. 5, 044007 (2020).
4. Kerenidis, I. & Prakash, A. Quantum recommendation systems. Preprint at https://arxiv.org/abs/1603.08675 (2016).
5. Calabrese, P. & Cardy, J. Time dependence of correlation functions following a quantum quench. Phy. Rev. Lett. 96, 136801 (2006).