Approximate encoding of quantum states using shallow circuits

Abstract

A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of 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 an optimization algorithm that approaches the optimal implementation for a fixed number of gates. Our algorithm runs efficiently on classical computers and requires a polynomial number of iterations only. We demonstrate the feasibility of our approach by comparing optimal and suboptimal circuits on real devices. 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 rather than a global one. By simulating realistic shot noise, we verify that the number of required measurements scales polynomially with the number of qubits. Our work offers a universal method to prepare target states using local gates and represents a significant improvement over known strategies.

10 + 6 pages

References in corpus (9)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• The density-matrix renormalization group in the age of matrix product states
• Synthesis of Quantum Logic Circuits
• Hybrid quantum-classical algorithms and quantum error mitigation
• Quantum-state preparation with universal gate decompositions
• The Bitter Truth About Quantum Algorithms in the NISQ Era
• Data compression for quantum machine learning
• Optimal compression of quantum many-body time evolution operators into brickwall circuits
• Exploring ab initio machine synthesis of quantum circuits

Cited by in corpus (12)

• Initial state preparation for quantum chemistry on quantum computers
• Tensor networks for quantum computing
• Spin coupling is all you need: Encoding strong electron correlation in molecules on quantum computers
• Approximate Quantum Compiling for Quantum Simulation: A Tensor Network based approach
• The State Preparation of Multivariate Normal Distributions using Tree Tensor Network
• Tensor-Programmable Quantum Circuits for Solving Differential Equations
• Preparation Circuits for Matrix Product States by Classical Variational Disentanglement
• Typical Machine Learning Datasets as Low-Depth Quantum Circuits
• Sublinear Classical-to-Quantum Data Encoding using $n$-Toffoli Gates
• A quantum eigenvalue solver based on tensor networks
• Comment on arXiv:2307.08384 "Efficient Quantum State Preparation with Walsh Series"
• Quantum Encoding of Structured Data with Matrix Product States