Automatically Differentiable Quantum Circuit for Many-qubit State Preparation

Abstract

Constructing quantum circuits for efficient state preparation belongs to the central topics in the field of quantum information and computation. As the number of qubits grows fast, methods to derive large-scale quantum circuits are strongly desired. In this work, we propose the automatically differentiable quantum circuit (ADQC) approach to efficiently prepare arbitrary quantum many-qubit states. A key ingredient is to introduce the latent gates whose decompositions give the unitary gates that form the quantum circuit. The circuit is optimized by updating the latent gates using back propagation to minimize the distance between the evolved and target states. Taking the ground states of quantum lattice models and random matrix product states as examples, with the number of qubits where processing the full coefficients is unlikely, ADQC obtains high fidelities with small numbers of layers $N_L\sim O(1)$. Superior accuracy is reached compared with the existing state-preparation approach based on the matrix product disentangler. The parameter complexity of MPS can be significantly reduced by ADQC with the compression ratio $r\sim O(10^{-3})$. Our work sheds light on the "intelligent construction" of quantum circuits for many-qubit systems by combining with the machine learning methods.

arXiv comment5 pages, 5 figures

References in corpus (55)

• Adam: A Method for Stochastic Optimization
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• A variational eigenvalue solver on a quantum processor
• Quantum Mechanics helps in searching for a needle in a haystack
• Elementary gates for quantum computation
• The density-matrix renormalization group in the age of matrix product states
• Area laws for the entanglement entropy - a review
• Entanglement in quantum critical phenomena
• Quantum state engineering with Josephson-junction devices
• Efficient classical simulation of slightly entangled quantum computations
• Barren plateaus in quantum neural network training landscapes
• The theory of variational hybrid quantum-classical algorithms
• A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
• Entropy and Area
• Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
• Efficient simulation of one-dimensional quantum many-body systems
• Quantum Circuit Learning
• Measurement of conditional phase shifts for quantum logic
• Spin Liquid Ground State of the $S=1/2$ Kagome Heisenberg Model
• Entanglement renormalization
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Measurement-based quantum computation
• Two-Bit Gates are Universal for Quantum Computation
• Classical simulation of infinite-size quantum lattice systems in one spatial dimension
• Remote State Preparation
• Quantum Computational Supremacy
• Classical simulation of infinite-size quantum lattice systems in two spatial dimensions
• Identifying Topological Order by Entanglement Entropy
• Tensor networks for complex quantum systems
• Topological Transition in a Non-Hermitian Quantum Walk
• A Simple Quantum Computer
• Entropy scaling and simulability by Matrix Product States
• An initialization strategy for addressing barren plateaus in parametrized quantum circuits
• Simulation of two dimensional quantum systems on an infinite lattice revisited: corner transfer matrix for tensor contraction
• Renormalization and tensor product states in spin chains and lattices
• Matrix product operator representations
• Theory of finite-entanglement scaling at one-dimensional quantum critical points
• Quantum-state preparation with universal gate decompositions
• Scaling of entanglement support for Matrix Product States
• Differentiable Learning of Quantum Circuit Born Machine
• Differentiable Programming Tensor Networks
• Real- and imaginary-time evolution with compressed quantum circuits
• Renormalization group transformations on quantum states
• Lecture Notes of Tensor Network Contractions
• A divide-and-conquer algorithm for quantum state preparation
• Symmetry-protected phases for measurement-based quantum computation
• Encoding of Matrix Product States into Quantum Circuits of One- and Two-Qubit Gates
• Higher Order Derivatives of Quantum Neural Networks with Barren Plateaus
• Machine learning method for state preparation and gate synthesis on photonic quantum computers
• Black-box quantum state preparation without arithmetic
• Realization of a superconducting atom chip
• Machine Learning by Unitary Tensor Network of Hierarchical Tree Structure
• Z_3 symmetry-protected topological phases in the SU(3) AKLT model
• Automatic Differentiation for Second Renormalization of Tensor Networks
• Gapless Hamiltonians for the toric code using the PEPS formalism

Cited by in corpus (9)

• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage
• Absence of barren plateaus in finite local-depth circuits with long-range entanglement
• Tensor networks for interpretable and efficient quantum-inspired machine learning
• Automatic quantum circuit encoding of a given arbitrary quantum state
• Compressing Neural Networks Using Tensor Networks with Exponentially Fewer Variational Parameters
• The State Preparation of Multivariate Normal Distributions using Tree Tensor Network
• Tensor Network Efficiently Representing Schmidt Decomposition of Quantum Many-Body States
• Matrix-product entanglement characterizing the optimality of state-preparation quantum circuits
• Preparation of Many-body Ground States by Time Evolution with Variational Microscopic Magnetic Fields and Incomplete Interactions