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.

arXiv comment10 + 6 pages

References in corpus (48)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Elementary gates for quantum computation
• The density-matrix renormalization group in the age of matrix product states
• Variational Quantum Algorithms
• Area laws for the entanglement entropy - a review
• Nonequilibrium dynamics of closed interacting quantum systems
• Barren plateaus in quantum neural network training landscapes
• A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
• Time-dependence of correlation functions following a quantum quench
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• An Area Law for One Dimensional Quantum Systems
• Validating quantum computers using randomized model circuits
• Synthesis of Quantum Logic Circuits
• Time-evolution methods for matrix-product states
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Hybrid quantum-classical algorithms and quantum error mitigation
• Hand-waving and Interpretive Dance: An Introductory Course on Tensor Networks
• Quantum-assisted quantum compiling
• Tensor Network Renormalization
• Quantum-state preparation with universal gate decompositions
• Sequential generation of entangled multi-qubit states
• Variational quantum algorithms for nonlinear problems
• Towards Quantum Machine Learning with Tensor Networks
• Minimal Universal Two-qubit Quantum Circuits
• Efficient decomposition of quantum gates
• Quantum quench dynamics
• The Bitter Truth About Quantum Algorithms in the NISQ Era
• Quantum Circuits for Isometries
• Structure optimization for parameterized quantum circuits
• Real- and imaginary-time evolution with compressed quantum circuits
• Noise Resilience of Variational Quantum Compiling
• Sequential minimal optimization for quantum-classical hybrid algorithms
• Lecture Notes of Tensor Network Contractions
• Quantum circuits with uniformly controlled one-qubit gates
• Encoding of Matrix Product States into Quantum Circuits of One- and Two-Qubit Gates
• Efficient Scheme for Initializing a Quantum Register with an Arbitrary Superposed State
• Approximate amplitude encoding in shallow parameterized quantum circuits and its application to financial market indicator
• Exact two-qubit universal quantum circuit
• Riemannian optimization of isometric tensor networks
• Variational Quantum Circuits for Quantum State Tomography
• Data compression for quantum machine learning
• Robust quantum compilation and circuit optimisation via energy minimisation
• Optimal compression of quantum many-body time evolution operators into brickwall circuits
• Optimizing quantum circuits with Riemannian gradient flow
• Constrained optimization of sequentially generated entangled multiqubit states
• Ancilla-assisted sequential approximation of nonlocal unitary operations
• Exploring ab initio machine synthesis of quantum circuits
• Constraint optimization and $\mathcal{S}\mathcal{U}(N)$ quantum control landscapes

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